./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.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_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/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_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/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_153efd45-9994-49e4-9043-6ad024d8307a/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 75fd132a1a39ad1f2927845122893235fdf65fe2225472c79a2e84525dcd60fe --- 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:54:36,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:54:36,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:54:36,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:54:36,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:54:36,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:54:36,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:54:36,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:54:36,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:54:36,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:54:36,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:54:36,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:54:36,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:54:36,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:54:36,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:54:36,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:54:36,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:54:36,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:54:36,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:54:36,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:54:36,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:54:36,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:54:36,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:54:36,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:54:36,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:54:36,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:54:36,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:54:36,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:54:36,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:54:36,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:54:36,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:54:36,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:54:36,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:54:36,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:54:36,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:54:36,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:54:36,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:54:36,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:54:36,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:54:36,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:54:36,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:54:36,874 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:54:36,914 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:54:36,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:54:36,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:54:36,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:54:36,919 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:54:36,919 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:54:36,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:54:36,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:54:36,920 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:54:36,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:54:36,922 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:54:36,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:54:36,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:54:36,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:54:36,923 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:54:36,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:54:36,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:54:36,924 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:54:36,924 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:54:36,924 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:54:36,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:54:36,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:54:36,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:54:36,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:54:36,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:54:36,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:54:36,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:54:36,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:54:36,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:54:36,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:54:36,929 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:54:36,929 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:54:36,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:54:36,929 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_153efd45-9994-49e4-9043-6ad024d8307a/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_153efd45-9994-49e4-9043-6ad024d8307a/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 -> 75fd132a1a39ad1f2927845122893235fdf65fe2225472c79a2e84525dcd60fe [2022-11-02 20:54:37,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:54:37,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:54:37,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:54:37,372 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:54:37,374 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:54:37,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2022-11-02 20:54:37,482 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/data/38b388ddb/f1402c1bfc544011b2555544f425b0a2/FLAG46db25dde [2022-11-02 20:54:38,227 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:54:38,228 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2022-11-02 20:54:38,270 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/data/38b388ddb/f1402c1bfc544011b2555544f425b0a2/FLAG46db25dde [2022-11-02 20:54:38,462 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/data/38b388ddb/f1402c1bfc544011b2555544f425b0a2 [2022-11-02 20:54:38,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:54:38,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:54:38,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:54:38,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:54:38,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:54:38,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:38" (1/1) ... [2022-11-02 20:54:38,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc10540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:38, skipping insertion in model container [2022-11-02 20:54:38,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:38" (1/1) ... [2022-11-02 20:54:38,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:54:38,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:54:38,820 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_153efd45-9994-49e4-9043-6ad024d8307a/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c[2073,2086] [2022-11-02 20:54:39,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:54:39,101 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:54:39,137 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_153efd45-9994-49e4-9043-6ad024d8307a/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c[2073,2086] [2022-11-02 20:54:39,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:54:39,331 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:54:39,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:39 WrapperNode [2022-11-02 20:54:39,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:54:39,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:54:39,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:54:39,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:54:39,342 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:54:39" (1/1) ... [2022-11-02 20:54:39,363 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:54:39" (1/1) ... [2022-11-02 20:54:39,445 INFO L138 Inliner]: procedures = 41, calls = 107, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 1581 [2022-11-02 20:54:39,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:54:39,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:54:39,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:54:39,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:54:39,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:39" (1/1) ... [2022-11-02 20:54:39,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:39" (1/1) ... [2022-11-02 20:54:39,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:39" (1/1) ... [2022-11-02 20:54:39,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:39" (1/1) ... [2022-11-02 20:54:39,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:39" (1/1) ... [2022-11-02 20:54:39,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:39" (1/1) ... [2022-11-02 20:54:39,512 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:39" (1/1) ... [2022-11-02 20:54:39,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:39" (1/1) ... [2022-11-02 20:54:39,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:54:39,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:54:39,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:54:39,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:54:39,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:39" (1/1) ... [2022-11-02 20:54:39,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:54:39,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:39,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:54:39,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:54:39,648 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-11-02 20:54:39,648 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-11-02 20:54:39,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:54:39,649 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2022-11-02 20:54:39,649 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2022-11-02 20:54:39,649 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-11-02 20:54:39,649 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-11-02 20:54:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-11-02 20:54:39,653 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-11-02 20:54:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-11-02 20:54:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-11-02 20:54:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-11-02 20:54:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-11-02 20:54:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-11-02 20:54:39,654 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-11-02 20:54:39,655 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-11-02 20:54:39,655 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-11-02 20:54:39,655 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-11-02 20:54:39,655 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-11-02 20:54:39,655 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-11-02 20:54:39,656 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-11-02 20:54:39,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:54:39,656 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-11-02 20:54:39,656 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-11-02 20:54:39,656 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-11-02 20:54:39,657 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-11-02 20:54:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:54:39,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:54:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-11-02 20:54:39,657 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-11-02 20:54:40,099 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:54:40,103 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:54:40,334 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:54:40,439 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-11-02 20:54:40,439 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-11-02 20:54:40,538 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:54:40,564 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-11-02 20:54:40,564 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-11-02 20:54:40,579 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:54:40,583 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:54:40,588 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:54:40,610 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:54:40,626 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:54:40,633 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:54:40,639 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:54:41,541 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res#1 := 0; [2022-11-02 20:54:41,542 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume !false; [2022-11-02 20:54:41,542 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##257: assume false; [2022-11-02 20:54:41,542 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##286: assume !false; [2022-11-02 20:54:41,542 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume false; [2022-11-02 20:54:41,543 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-11-02 20:54:41,543 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-11-02 20:54:41,543 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##133: assume false; [2022-11-02 20:54:41,543 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##134: assume !false; [2022-11-02 20:54:41,544 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-11-02 20:54:41,544 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-11-02 20:54:41,544 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-11-02 20:54:41,544 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-11-02 20:54:41,544 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2022-11-02 20:54:41,545 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2022-11-02 20:54:41,591 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:54:41,603 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:54:41,604 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:54:41,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:41 BoogieIcfgContainer [2022-11-02 20:54:41,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:54:41,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:54:41,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:54:41,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:54:41,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:54:38" (1/3) ... [2022-11-02 20:54:41,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3395ae5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:41, skipping insertion in model container [2022-11-02 20:54:41,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:39" (2/3) ... [2022-11-02 20:54:41,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3395ae5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:41, skipping insertion in model container [2022-11-02 20:54:41,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:41" (3/3) ... [2022-11-02 20:54:41,619 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2022-11-02 20:54:41,641 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:54:41,642 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:54:41,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:54:41,752 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;@b6175d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:54:41,753 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:54:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 468 states, 367 states have (on average 1.5068119891008174) internal successors, (553), 385 states have internal predecessors, (553), 86 states have call successors, (86), 13 states have call predecessors, (86), 13 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-02 20:54:41,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:54:41,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:41,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:41,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:41,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1469618272, now seen corresponding path program 1 times [2022-11-02 20:54:41,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:41,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282561425] [2022-11-02 20:54:41,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:41,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,132 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:54:42,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:42,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282561425] [2022-11-02 20:54:42,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282561425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:42,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:42,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:42,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237225720] [2022-11-02 20:54:42,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:42,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:42,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:42,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:42,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:42,195 INFO L87 Difference]: Start difference. First operand has 468 states, 367 states have (on average 1.5068119891008174) internal successors, (553), 385 states have internal predecessors, (553), 86 states have call successors, (86), 13 states have call predecessors, (86), 13 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) 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:54:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:42,494 INFO L93 Difference]: Finished difference Result 809 states and 1294 transitions. [2022-11-02 20:54:42,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:42,497 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:54:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:42,513 INFO L225 Difference]: With dead ends: 809 [2022-11-02 20:54:42,513 INFO L226 Difference]: Without dead ends: 461 [2022-11-02 20:54:42,521 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:54:42,525 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 8 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:42,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1351 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:54:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-11-02 20:54:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2022-11-02 20:54:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 362 states have (on average 1.4751381215469612) internal successors, (534), 378 states have internal predecessors, (534), 86 states have call successors, (86), 13 states have call predecessors, (86), 12 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2022-11-02 20:54:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 691 transitions. [2022-11-02 20:54:42,628 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 691 transitions. Word has length 13 [2022-11-02 20:54:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:42,629 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 691 transitions. [2022-11-02 20:54:42,629 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:54:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 691 transitions. [2022-11-02 20:54:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:54:42,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:42,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:42,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:54:42,632 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:42,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:42,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1712840026, now seen corresponding path program 1 times [2022-11-02 20:54:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:42,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786607499] [2022-11-02 20:54:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:42,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,726 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:54:42,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:42,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786607499] [2022-11-02 20:54:42,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786607499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:42,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:42,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:42,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801834426] [2022-11-02 20:54:42,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:42,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:42,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:42,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:42,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:42,731 INFO L87 Difference]: Start difference. First operand 461 states and 691 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:54:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:42,977 INFO L93 Difference]: Finished difference Result 702 states and 1030 transitions. [2022-11-02 20:54:42,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:42,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 15 [2022-11-02 20:54:42,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:42,986 INFO L225 Difference]: With dead ends: 702 [2022-11-02 20:54:42,986 INFO L226 Difference]: Without dead ends: 597 [2022-11-02 20:54:42,988 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:54:42,990 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 566 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:42,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1048 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:54:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-11-02 20:54:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 579. [2022-11-02 20:54:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 466 states have (on average 1.4356223175965666) internal successors, (669), 468 states have internal predecessors, (669), 92 states have call successors, (92), 21 states have call predecessors, (92), 20 states have return successors, (97), 91 states have call predecessors, (97), 81 states have call successors, (97) [2022-11-02 20:54:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 858 transitions. [2022-11-02 20:54:43,060 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 858 transitions. Word has length 15 [2022-11-02 20:54:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:43,061 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 858 transitions. [2022-11-02 20:54:43,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:54:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 858 transitions. [2022-11-02 20:54:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:54:43,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:43,066 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:54:43,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:54:43,066 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:43,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:43,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1723202730, now seen corresponding path program 1 times [2022-11-02 20:54:43,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:43,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594555368] [2022-11-02 20:54:43,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:43,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:43,335 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:54:43,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:43,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594555368] [2022-11-02 20:54:43,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594555368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:43,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:43,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:43,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719691220] [2022-11-02 20:54:43,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:43,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:43,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:43,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:43,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:43,338 INFO L87 Difference]: Start difference. First operand 579 states and 858 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:54:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:43,424 INFO L93 Difference]: Finished difference Result 858 states and 1241 transitions. [2022-11-02 20:54:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:43,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-11-02 20:54:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:43,431 INFO L225 Difference]: With dead ends: 858 [2022-11-02 20:54:43,431 INFO L226 Difference]: Without dead ends: 723 [2022-11-02 20:54:43,432 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:54:43,433 INFO L413 NwaCegarLoop]: 681 mSDtfsCounter, 605 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:43,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 868 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:54:43,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-11-02 20:54:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 687. [2022-11-02 20:54:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 564 states have (on average 1.4326241134751774) internal successors, (808), 562 states have internal predecessors, (808), 93 states have call successors, (93), 26 states have call predecessors, (93), 29 states have return successors, (110), 98 states have call predecessors, (110), 85 states have call successors, (110) [2022-11-02 20:54:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1011 transitions. [2022-11-02 20:54:43,493 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1011 transitions. Word has length 19 [2022-11-02 20:54:43,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:43,494 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 1011 transitions. [2022-11-02 20:54:43,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:54:43,494 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1011 transitions. [2022-11-02 20:54:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:54:43,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:43,497 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] [2022-11-02 20:54:43,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:54:43,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash 981092466, now seen corresponding path program 1 times [2022-11-02 20:54:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:43,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233151629] [2022-11-02 20:54:43,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:43,546 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:54:43,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:43,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233151629] [2022-11-02 20:54:43,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233151629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:43,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:43,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:43,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447882686] [2022-11-02 20:54:43,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:43,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:43,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:43,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:43,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:43,549 INFO L87 Difference]: Start difference. First operand 687 states and 1011 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:54:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:43,766 INFO L93 Difference]: Finished difference Result 1290 states and 1958 transitions. [2022-11-02 20:54:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:43,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2022-11-02 20:54:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:43,774 INFO L225 Difference]: With dead ends: 1290 [2022-11-02 20:54:43,775 INFO L226 Difference]: Without dead ends: 1057 [2022-11-02 20:54:43,776 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:54:43,778 INFO L413 NwaCegarLoop]: 1006 mSDtfsCounter, 338 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:43,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1622 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:54:43,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2022-11-02 20:54:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 819. [2022-11-02 20:54:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 673 states have (on average 1.4338781575037147) internal successors, (965), 670 states have internal predecessors, (965), 106 states have call successors, (106), 34 states have call predecessors, (106), 39 states have return successors, (172), 114 states have call predecessors, (172), 98 states have call successors, (172) [2022-11-02 20:54:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1243 transitions. [2022-11-02 20:54:43,847 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1243 transitions. Word has length 21 [2022-11-02 20:54:43,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:43,848 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1243 transitions. [2022-11-02 20:54:43,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:54:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1243 transitions. [2022-11-02 20:54:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:54:43,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:43,850 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:54:43,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:54:43,850 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:43,851 INFO L85 PathProgramCache]: Analyzing trace with hash 110549048, now seen corresponding path program 1 times [2022-11-02 20:54:43,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:43,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706253361] [2022-11-02 20:54:43,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:43,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:44,063 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:54:44,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:44,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706253361] [2022-11-02 20:54:44,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706253361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:44,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:44,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554966074] [2022-11-02 20:54:44,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:44,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:44,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:44,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:44,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:44,067 INFO L87 Difference]: Start difference. First operand 819 states and 1243 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:54:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:44,751 INFO L93 Difference]: Finished difference Result 1372 states and 2088 transitions. [2022-11-02 20:54:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:54:44,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 22 [2022-11-02 20:54:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:44,759 INFO L225 Difference]: With dead ends: 1372 [2022-11-02 20:54:44,759 INFO L226 Difference]: Without dead ends: 829 [2022-11-02 20:54:44,762 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:54:44,764 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 1038 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:44,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 857 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:54:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-11-02 20:54:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 807. [2022-11-02 20:54:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 663 states have (on average 1.4283559577677225) internal successors, (947), 660 states have internal predecessors, (947), 104 states have call successors, (104), 32 states have call predecessors, (104), 39 states have return successors, (168), 114 states have call predecessors, (168), 96 states have call successors, (168) [2022-11-02 20:54:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1219 transitions. [2022-11-02 20:54:44,869 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1219 transitions. Word has length 22 [2022-11-02 20:54:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:44,869 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 1219 transitions. [2022-11-02 20:54:44,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:54:44,870 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1219 transitions. [2022-11-02 20:54:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:54:44,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:44,872 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] [2022-11-02 20:54:44,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:54:44,872 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:44,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash -401986644, now seen corresponding path program 1 times [2022-11-02 20:54:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:44,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436811753] [2022-11-02 20:54:44,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:44,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:44,932 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:54:44,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:44,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436811753] [2022-11-02 20:54:44,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436811753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:44,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:44,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381978738] [2022-11-02 20:54:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:44,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:44,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:44,936 INFO L87 Difference]: Start difference. First operand 807 states and 1219 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:54:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:45,071 INFO L93 Difference]: Finished difference Result 810 states and 1221 transitions. [2022-11-02 20:54:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:45,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 23 [2022-11-02 20:54:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:45,077 INFO L225 Difference]: With dead ends: 810 [2022-11-02 20:54:45,077 INFO L226 Difference]: Without dead ends: 806 [2022-11-02 20:54:45,078 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:54:45,079 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 22 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:45,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1252 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:54:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-11-02 20:54:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2022-11-02 20:54:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 663 states have (on average 1.4253393665158371) internal successors, (945), 659 states have internal predecessors, (945), 103 states have call successors, (103), 32 states have call predecessors, (103), 39 states have return successors, (168), 114 states have call predecessors, (168), 96 states have call successors, (168) [2022-11-02 20:54:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1216 transitions. [2022-11-02 20:54:45,166 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1216 transitions. Word has length 23 [2022-11-02 20:54:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:45,167 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1216 transitions. [2022-11-02 20:54:45,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:54:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1216 transitions. [2022-11-02 20:54:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:54:45,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:45,169 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:54:45,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:54:45,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1420935661, now seen corresponding path program 1 times [2022-11-02 20:54:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:45,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975763552] [2022-11-02 20:54:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:45,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,251 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:54:45,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:45,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975763552] [2022-11-02 20:54:45,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975763552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:45,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:45,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:45,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44829535] [2022-11-02 20:54:45,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:45,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:45,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:45,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:45,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:45,254 INFO L87 Difference]: Start difference. First operand 806 states and 1216 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:45,463 INFO L93 Difference]: Finished difference Result 1220 states and 1776 transitions. [2022-11-02 20:54:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:54:45,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 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:54:45,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:45,470 INFO L225 Difference]: With dead ends: 1220 [2022-11-02 20:54:45,470 INFO L226 Difference]: Without dead ends: 806 [2022-11-02 20:54:45,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:54:45,473 INFO L413 NwaCegarLoop]: 757 mSDtfsCounter, 318 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:45,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1941 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:54:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-11-02 20:54:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 681. [2022-11-02 20:54:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 559 states have (on average 1.407871198568873) internal successors, (787), 557 states have internal predecessors, (787), 88 states have call successors, (88), 28 states have call predecessors, (88), 33 states have return successors, (109), 95 states have call predecessors, (109), 81 states have call successors, (109) [2022-11-02 20:54:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 984 transitions. [2022-11-02 20:54:45,568 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 984 transitions. Word has length 28 [2022-11-02 20:54:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:45,569 INFO L495 AbstractCegarLoop]: Abstraction has 681 states and 984 transitions. [2022-11-02 20:54:45,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 984 transitions. [2022-11-02 20:54:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:54:45,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:45,572 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:54:45,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:54:45,572 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:45,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:45,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1565251403, now seen corresponding path program 1 times [2022-11-02 20:54:45,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:45,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303831781] [2022-11-02 20:54:45,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:45,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,675 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:54:45,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:45,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303831781] [2022-11-02 20:54:45,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303831781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:45,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:45,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:45,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301502178] [2022-11-02 20:54:45,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:45,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:45,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:45,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:45,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:45,678 INFO L87 Difference]: Start difference. First operand 681 states and 984 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:45,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:45,781 INFO L93 Difference]: Finished difference Result 764 states and 1091 transitions. [2022-11-02 20:54:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:45,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:54:45,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:45,788 INFO L225 Difference]: With dead ends: 764 [2022-11-02 20:54:45,788 INFO L226 Difference]: Without dead ends: 746 [2022-11-02 20:54:45,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:54:45,790 INFO L413 NwaCegarLoop]: 654 mSDtfsCounter, 628 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 716 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:54:45,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 716 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:54:45,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-11-02 20:54:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 703. [2022-11-02 20:54:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 579 states have (on average 1.4162348877374784) internal successors, (820), 584 states have internal predecessors, (820), 88 states have call successors, (88), 29 states have call predecessors, (88), 35 states have return successors, (104), 89 states have call predecessors, (104), 82 states have call successors, (104) [2022-11-02 20:54:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1012 transitions. [2022-11-02 20:54:45,865 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1012 transitions. Word has length 29 [2022-11-02 20:54:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:45,866 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 1012 transitions. [2022-11-02 20:54:45,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1012 transitions. [2022-11-02 20:54:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:54:45,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:45,872 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] [2022-11-02 20:54:45,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:54:45,873 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:45,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:45,874 INFO L85 PathProgramCache]: Analyzing trace with hash 18714975, now seen corresponding path program 1 times [2022-11-02 20:54:45,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:45,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336062919] [2022-11-02 20:54:45,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:45,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:54:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,951 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:54:45,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:45,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336062919] [2022-11-02 20:54:45,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336062919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:45,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:45,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:45,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185907191] [2022-11-02 20:54:45,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:45,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:45,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:45,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:45,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:45,959 INFO L87 Difference]: Start difference. First operand 703 states and 1012 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:54:46,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:46,420 INFO L93 Difference]: Finished difference Result 999 states and 1443 transitions. [2022-11-02 20:54:46,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:54:46,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-11-02 20:54:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:46,426 INFO L225 Difference]: With dead ends: 999 [2022-11-02 20:54:46,426 INFO L226 Difference]: Without dead ends: 772 [2022-11-02 20:54:46,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:54:46,428 INFO L413 NwaCegarLoop]: 729 mSDtfsCounter, 254 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:46,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1774 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:54:46,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2022-11-02 20:54:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 686. [2022-11-02 20:54:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 564 states have (on average 1.4113475177304964) internal successors, (796), 571 states have internal predecessors, (796), 87 states have call successors, (87), 28 states have call predecessors, (87), 34 states have return successors, (100), 86 states have call predecessors, (100), 81 states have call successors, (100) [2022-11-02 20:54:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 983 transitions. [2022-11-02 20:54:46,503 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 983 transitions. Word has length 35 [2022-11-02 20:54:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:46,503 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 983 transitions. [2022-11-02 20:54:46,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:54:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 983 transitions. [2022-11-02 20:54:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:54:46,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:46,506 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:54:46,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:54:46,507 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:46,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:46,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1008894227, now seen corresponding path program 1 times [2022-11-02 20:54:46,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:46,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904865280] [2022-11-02 20:54:46,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:46,573 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:54:46,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:46,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904865280] [2022-11-02 20:54:46,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904865280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:46,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:46,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:46,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484553154] [2022-11-02 20:54:46,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:46,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:46,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:46,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:46,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:46,576 INFO L87 Difference]: Start difference. First operand 686 states and 983 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:54:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:47,039 INFO L93 Difference]: Finished difference Result 744 states and 1056 transitions. [2022-11-02 20:54:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:54:47,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 32 [2022-11-02 20:54:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:47,045 INFO L225 Difference]: With dead ends: 744 [2022-11-02 20:54:47,045 INFO L226 Difference]: Without dead ends: 702 [2022-11-02 20:54:47,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:54:47,047 INFO L413 NwaCegarLoop]: 641 mSDtfsCounter, 691 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:47,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1101 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:54:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-11-02 20:54:47,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 686. [2022-11-02 20:54:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 564 states have (on average 1.4078014184397163) internal successors, (794), 571 states have internal predecessors, (794), 87 states have call successors, (87), 28 states have call predecessors, (87), 34 states have return successors, (100), 86 states have call predecessors, (100), 81 states have call successors, (100) [2022-11-02 20:54:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 981 transitions. [2022-11-02 20:54:47,152 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 981 transitions. Word has length 32 [2022-11-02 20:54:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:47,152 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 981 transitions. [2022-11-02 20:54:47,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:54:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 981 transitions. [2022-11-02 20:54:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:54:47,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:47,157 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] [2022-11-02 20:54:47,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:54:47,157 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:47,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:47,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1838861437, now seen corresponding path program 1 times [2022-11-02 20:54:47,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:47,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618192832] [2022-11-02 20:54:47,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:47,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:54:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:47,216 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:54:47,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:47,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618192832] [2022-11-02 20:54:47,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618192832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:47,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:47,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:47,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683937762] [2022-11-02 20:54:47,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:47,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:47,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:47,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:47,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:47,220 INFO L87 Difference]: Start difference. First operand 686 states and 981 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 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:54:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:47,616 INFO L93 Difference]: Finished difference Result 771 states and 1109 transitions. [2022-11-02 20:54:47,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:54:47,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 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 36 [2022-11-02 20:54:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:47,621 INFO L225 Difference]: With dead ends: 771 [2022-11-02 20:54:47,621 INFO L226 Difference]: Without dead ends: 711 [2022-11-02 20:54:47,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:54:47,623 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 703 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:47,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1254 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:54:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-11-02 20:54:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 675. [2022-11-02 20:54:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 557 states have (on average 1.4093357271095153) internal successors, (785), 564 states have internal predecessors, (785), 85 states have call successors, (85), 26 states have call predecessors, (85), 32 states have return successors, (98), 84 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 20:54:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 968 transitions. [2022-11-02 20:54:47,689 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 968 transitions. Word has length 36 [2022-11-02 20:54:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:47,689 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 968 transitions. [2022-11-02 20:54:47,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 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:54:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 968 transitions. [2022-11-02 20:54:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:54:47,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:47,692 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:54:47,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:54:47,692 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:47,693 INFO L85 PathProgramCache]: Analyzing trace with hash 138801832, now seen corresponding path program 1 times [2022-11-02 20:54:47,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:47,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831999367] [2022-11-02 20:54:47,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:47,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:47,735 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:54:47,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:47,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831999367] [2022-11-02 20:54:47,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831999367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:47,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:47,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:47,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532754276] [2022-11-02 20:54:47,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:47,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:47,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:47,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:47,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:47,739 INFO L87 Difference]: Start difference. First operand 675 states and 968 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:54:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:47,901 INFO L93 Difference]: Finished difference Result 832 states and 1184 transitions. [2022-11-02 20:54:47,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:47,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 34 [2022-11-02 20:54:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:47,906 INFO L225 Difference]: With dead ends: 832 [2022-11-02 20:54:47,907 INFO L226 Difference]: Without dead ends: 821 [2022-11-02 20:54:47,907 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:54:47,908 INFO L413 NwaCegarLoop]: 771 mSDtfsCounter, 132 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:47,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1384 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:54:47,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-11-02 20:54:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 723. [2022-11-02 20:54:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 601 states have (on average 1.3860232945091515) internal successors, (833), 601 states have internal predecessors, (833), 85 states have call successors, (85), 26 states have call predecessors, (85), 36 states have return successors, (109), 95 states have call predecessors, (109), 79 states have call successors, (109) [2022-11-02 20:54:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1027 transitions. [2022-11-02 20:54:48,013 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1027 transitions. Word has length 34 [2022-11-02 20:54:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:48,014 INFO L495 AbstractCegarLoop]: Abstraction has 723 states and 1027 transitions. [2022-11-02 20:54:48,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:54:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1027 transitions. [2022-11-02 20:54:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:54:48,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:48,017 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:54:48,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:54:48,017 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:48,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:48,018 INFO L85 PathProgramCache]: Analyzing trace with hash -298326298, now seen corresponding path program 1 times [2022-11-02 20:54:48,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:48,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834647910] [2022-11-02 20:54:48,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:48,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:48,113 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:54:48,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:48,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834647910] [2022-11-02 20:54:48,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834647910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:48,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:48,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:48,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283561435] [2022-11-02 20:54:48,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:48,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:48,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:48,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:48,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:48,116 INFO L87 Difference]: Start difference. First operand 723 states and 1027 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:54:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:48,568 INFO L93 Difference]: Finished difference Result 751 states and 1058 transitions. [2022-11-02 20:54:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:54:48,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 34 [2022-11-02 20:54:48,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:48,573 INFO L225 Difference]: With dead ends: 751 [2022-11-02 20:54:48,573 INFO L226 Difference]: Without dead ends: 704 [2022-11-02 20:54:48,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:54:48,575 INFO L413 NwaCegarLoop]: 640 mSDtfsCounter, 671 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:48,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1100 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:54:48,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-11-02 20:54:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 694. [2022-11-02 20:54:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 575 states have (on average 1.391304347826087) internal successors, (800), 581 states have internal predecessors, (800), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 20:54:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 983 transitions. [2022-11-02 20:54:48,658 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 983 transitions. Word has length 34 [2022-11-02 20:54:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:48,659 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 983 transitions. [2022-11-02 20:54:48,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:54:48,659 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 983 transitions. [2022-11-02 20:54:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:54:48,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:48,662 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] [2022-11-02 20:54:48,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:54:48,662 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:48,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:48,663 INFO L85 PathProgramCache]: Analyzing trace with hash 452395434, now seen corresponding path program 1 times [2022-11-02 20:54:48,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:48,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841666630] [2022-11-02 20:54:48,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:48,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:48,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:54:48,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:48,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841666630] [2022-11-02 20:54:48,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841666630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:48,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:48,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:48,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598336271] [2022-11-02 20:54:48,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:48,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:48,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:48,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:48,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:48,810 INFO L87 Difference]: Start difference. First operand 694 states and 983 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:54:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:49,340 INFO L93 Difference]: Finished difference Result 792 states and 1125 transitions. [2022-11-02 20:54:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:54:49,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 35 [2022-11-02 20:54:49,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:49,345 INFO L225 Difference]: With dead ends: 792 [2022-11-02 20:54:49,346 INFO L226 Difference]: Without dead ends: 788 [2022-11-02 20:54:49,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:54:49,347 INFO L413 NwaCegarLoop]: 723 mSDtfsCounter, 752 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:49,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1179 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:54:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-11-02 20:54:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 696. [2022-11-02 20:54:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 577 states have (on average 1.389948006932409) internal successors, (802), 583 states have internal predecessors, (802), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 20:54:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 985 transitions. [2022-11-02 20:54:49,444 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 985 transitions. Word has length 35 [2022-11-02 20:54:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:49,446 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 985 transitions. [2022-11-02 20:54:49,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:54:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 985 transitions. [2022-11-02 20:54:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:54:49,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:49,449 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] [2022-11-02 20:54:49,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:54:49,450 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash 452672264, now seen corresponding path program 1 times [2022-11-02 20:54:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:49,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001739834] [2022-11-02 20:54:49,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:49,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:49,572 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:54:49,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:49,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001739834] [2022-11-02 20:54:49,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001739834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:49,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:49,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:54:49,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098160822] [2022-11-02 20:54:49,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:49,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:49,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:49,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:49,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:49,576 INFO L87 Difference]: Start difference. First operand 696 states and 985 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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:54:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:49,771 INFO L93 Difference]: Finished difference Result 709 states and 998 transitions. [2022-11-02 20:54:49,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:54:49,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 35 [2022-11-02 20:54:49,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:49,776 INFO L225 Difference]: With dead ends: 709 [2022-11-02 20:54:49,776 INFO L226 Difference]: Without dead ends: 679 [2022-11-02 20:54:49,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:54:49,781 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 38 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:49,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3193 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:54:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-11-02 20:54:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2022-11-02 20:54:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 560 states have (on average 1.3964285714285714) internal successors, (782), 566 states have internal predecessors, (782), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 20:54:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 965 transitions. [2022-11-02 20:54:49,881 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 965 transitions. Word has length 35 [2022-11-02 20:54:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:49,882 INFO L495 AbstractCegarLoop]: Abstraction has 679 states and 965 transitions. [2022-11-02 20:54:49,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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:54:49,882 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 965 transitions. [2022-11-02 20:54:49,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:54:49,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:49,885 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] [2022-11-02 20:54:49,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:54:49,885 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:49,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:49,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1733603893, now seen corresponding path program 1 times [2022-11-02 20:54:49,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:49,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39183938] [2022-11-02 20:54:49,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:49,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:49,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:54:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:49,969 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:54:49,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:49,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39183938] [2022-11-02 20:54:49,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39183938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:49,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:49,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:49,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095521281] [2022-11-02 20:54:49,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:49,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:49,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:49,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:49,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:49,975 INFO L87 Difference]: Start difference. First operand 679 states and 965 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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:54:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:50,444 INFO L93 Difference]: Finished difference Result 717 states and 1030 transitions. [2022-11-02 20:54:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:54:50,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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 37 [2022-11-02 20:54:50,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:50,449 INFO L225 Difference]: With dead ends: 717 [2022-11-02 20:54:50,449 INFO L226 Difference]: Without dead ends: 710 [2022-11-02 20:54:50,450 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:54:50,451 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 150 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:50,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1540 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:54:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-02 20:54:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 692. [2022-11-02 20:54:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 573 states have (on average 1.3909249563699826) internal successors, (797), 579 states have internal predecessors, (797), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 20:54:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 980 transitions. [2022-11-02 20:54:50,595 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 980 transitions. Word has length 37 [2022-11-02 20:54:50,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:50,595 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 980 transitions. [2022-11-02 20:54:50,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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:54:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 980 transitions. [2022-11-02 20:54:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:54:50,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:50,599 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] [2022-11-02 20:54:50,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:54:50,599 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:50,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash -190291046, now seen corresponding path program 1 times [2022-11-02 20:54:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:50,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118245198] [2022-11-02 20:54:50,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:50,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:54:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,766 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:54:50,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:50,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118245198] [2022-11-02 20:54:50,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118245198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:50,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:50,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:54:50,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479586380] [2022-11-02 20:54:50,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:50,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:50,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:50,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:50,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:50,769 INFO L87 Difference]: Start difference. First operand 692 states and 980 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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:54:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:51,404 INFO L93 Difference]: Finished difference Result 716 states and 1026 transitions. [2022-11-02 20:54:51,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:54:51,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 39 [2022-11-02 20:54:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:51,409 INFO L225 Difference]: With dead ends: 716 [2022-11-02 20:54:51,409 INFO L226 Difference]: Without dead ends: 710 [2022-11-02 20:54:51,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:54:51,410 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 780 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:51,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1451 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:54:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-02 20:54:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 692. [2022-11-02 20:54:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 573 states have (on average 1.3891797556719023) internal successors, (796), 579 states have internal predecessors, (796), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-11-02 20:54:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 979 transitions. [2022-11-02 20:54:51,498 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 979 transitions. Word has length 39 [2022-11-02 20:54:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:51,498 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 979 transitions. [2022-11-02 20:54:51,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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:54:51,499 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 979 transitions. [2022-11-02 20:54:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:54:51,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:51,501 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:54:51,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:54:51,502 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1290991354, now seen corresponding path program 1 times [2022-11-02 20:54:51,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:51,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481236487] [2022-11-02 20:54:51,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:51,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:51,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:54:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:51,654 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:54:51,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:51,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481236487] [2022-11-02 20:54:51,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481236487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:51,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:51,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:54:51,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189425221] [2022-11-02 20:54:51,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:51,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:54:51,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:51,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:54:51,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:54:51,661 INFO L87 Difference]: Start difference. First operand 692 states and 979 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 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:54:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:52,295 INFO L93 Difference]: Finished difference Result 731 states and 1044 transitions. [2022-11-02 20:54:52,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:54:52,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 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:54:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:52,303 INFO L225 Difference]: With dead ends: 731 [2022-11-02 20:54:52,303 INFO L226 Difference]: Without dead ends: 699 [2022-11-02 20:54:52,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:54:52,305 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 158 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 3958 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:52,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 3958 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:54:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-11-02 20:54:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 683. [2022-11-02 20:54:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 566 states have (on average 1.3710247349823321) internal successors, (776), 572 states have internal predecessors, (776), 83 states have call successors, (83), 26 states have call predecessors, (83), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-11-02 20:54:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 955 transitions. [2022-11-02 20:54:52,398 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 955 transitions. Word has length 40 [2022-11-02 20:54:52,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:52,398 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 955 transitions. [2022-11-02 20:54:52,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 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:54:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 955 transitions. [2022-11-02 20:54:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:54:52,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:52,402 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:54:52,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:54:52,402 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:52,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:52,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1689117095, now seen corresponding path program 1 times [2022-11-02 20:54:52,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:52,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303779191] [2022-11-02 20:54:52,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:52,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:52,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:54:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:52,479 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:54:52,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:52,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303779191] [2022-11-02 20:54:52,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303779191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:52,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:52,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:54:52,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123880596] [2022-11-02 20:54:52,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:52,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:54:52,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:52,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:54:52,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:52,483 INFO L87 Difference]: Start difference. First operand 683 states and 955 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 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:54:53,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:53,288 INFO L93 Difference]: Finished difference Result 764 states and 1068 transitions. [2022-11-02 20:54:53,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:54:53,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 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:54:53,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:53,293 INFO L225 Difference]: With dead ends: 764 [2022-11-02 20:54:53,293 INFO L226 Difference]: Without dead ends: 728 [2022-11-02 20:54:53,294 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:54:53,295 INFO L413 NwaCegarLoop]: 660 mSDtfsCounter, 789 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:53,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1511 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:54:53,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-11-02 20:54:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 683. [2022-11-02 20:54:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 566 states have (on average 1.3692579505300353) internal successors, (775), 572 states have internal predecessors, (775), 83 states have call successors, (83), 26 states have call predecessors, (83), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-11-02 20:54:53,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 954 transitions. [2022-11-02 20:54:53,395 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 954 transitions. Word has length 41 [2022-11-02 20:54:53,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:53,396 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 954 transitions. [2022-11-02 20:54:53,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 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:54:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 954 transitions. [2022-11-02 20:54:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:54:53,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:53,399 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:54:53,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:54:53,399 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash -90091863, now seen corresponding path program 1 times [2022-11-02 20:54:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:53,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670532134] [2022-11-02 20:54:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:53,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:53,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:54:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:53,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:54:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:53,452 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:54:53,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:53,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670532134] [2022-11-02 20:54:53,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670532134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:53,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:53,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:54:53,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770789963] [2022-11-02 20:54:53,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:53,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:54:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:53,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:54:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:53,455 INFO L87 Difference]: Start difference. First operand 683 states and 954 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 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:54:54,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:54,073 INFO L93 Difference]: Finished difference Result 890 states and 1253 transitions. [2022-11-02 20:54:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:54:54,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 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 43 [2022-11-02 20:54:54,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:54,077 INFO L225 Difference]: With dead ends: 890 [2022-11-02 20:54:54,078 INFO L226 Difference]: Without dead ends: 678 [2022-11-02 20:54:54,079 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:54:54,080 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 252 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:54,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1790 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:54:54,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-11-02 20:54:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 662. [2022-11-02 20:54:54,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 548 states have (on average 1.364963503649635) internal successors, (748), 553 states have internal predecessors, (748), 82 states have call successors, (82), 26 states have call predecessors, (82), 31 states have return successors, (94), 82 states have call predecessors, (94), 77 states have call successors, (94) [2022-11-02 20:54:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 924 transitions. [2022-11-02 20:54:54,206 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 924 transitions. Word has length 43 [2022-11-02 20:54:54,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:54,206 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 924 transitions. [2022-11-02 20:54:54,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 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:54:54,207 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 924 transitions. [2022-11-02 20:54:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:54:54,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:54,210 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:54:54,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:54:54,210 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:54,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1421107692, now seen corresponding path program 1 times [2022-11-02 20:54:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:54,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743468649] [2022-11-02 20:54:54,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:54,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:54,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:54:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:54,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:54:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:54,502 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:54:54,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:54,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743468649] [2022-11-02 20:54:54,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743468649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:54,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:54,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:54:54,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684672395] [2022-11-02 20:54:54,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:54,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:54:54,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:54,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:54:54,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:54:54,505 INFO L87 Difference]: Start difference. First operand 662 states and 924 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 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:54:55,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:55,781 INFO L93 Difference]: Finished difference Result 692 states and 978 transitions. [2022-11-02 20:54:55,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:54:55,782 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 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 43 [2022-11-02 20:54:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:55,786 INFO L225 Difference]: With dead ends: 692 [2022-11-02 20:54:55,787 INFO L226 Difference]: Without dead ends: 676 [2022-11-02 20:54:55,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:54:55,789 INFO L413 NwaCegarLoop]: 608 mSDtfsCounter, 98 mSDsluCounter, 3829 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4437 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:55,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4437 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:54:55,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-11-02 20:54:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 660. [2022-11-02 20:54:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 547 states have (on average 1.363802559414991) internal successors, (746), 552 states have internal predecessors, (746), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (93), 81 states have call predecessors, (93), 76 states have call successors, (93) [2022-11-02 20:54:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 920 transitions. [2022-11-02 20:54:55,936 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 920 transitions. Word has length 43 [2022-11-02 20:54:55,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:55,937 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 920 transitions. [2022-11-02 20:54:55,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 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:54:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 920 transitions. [2022-11-02 20:54:55,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:54:55,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:55,941 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:54:55,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:54:55,941 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:55,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:55,942 INFO L85 PathProgramCache]: Analyzing trace with hash 531963361, now seen corresponding path program 1 times [2022-11-02 20:54:55,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:55,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352016734] [2022-11-02 20:54:55,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:55,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:56,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:54:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:56,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:54:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:56,220 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:54:56,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:56,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352016734] [2022-11-02 20:54:56,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352016734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:56,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:56,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:54:56,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701341667] [2022-11-02 20:54:56,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:56,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:54:56,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:56,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:54:56,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:54:56,223 INFO L87 Difference]: Start difference. First operand 660 states and 920 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 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:54:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:57,697 INFO L93 Difference]: Finished difference Result 712 states and 998 transitions. [2022-11-02 20:54:57,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:54:57,700 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 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 44 [2022-11-02 20:54:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:57,705 INFO L225 Difference]: With dead ends: 712 [2022-11-02 20:54:57,705 INFO L226 Difference]: Without dead ends: 691 [2022-11-02 20:54:57,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:54:57,706 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 171 mSDsluCounter, 4453 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 5034 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:57,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 5034 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:54:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-11-02 20:54:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 659. [2022-11-02 20:54:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 546 states have (on average 1.3461538461538463) internal successors, (735), 551 states have internal predecessors, (735), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (93), 81 states have call predecessors, (93), 76 states have call successors, (93) [2022-11-02 20:54:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 909 transitions. [2022-11-02 20:54:57,780 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 909 transitions. Word has length 44 [2022-11-02 20:54:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:57,781 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 909 transitions. [2022-11-02 20:54:57,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 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:54:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 909 transitions. [2022-11-02 20:54:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:54:57,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:57,784 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:54:57,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:54:57,784 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:57,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash -927803137, now seen corresponding path program 1 times [2022-11-02 20:54:57,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:57,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105213946] [2022-11-02 20:54:57,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:57,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:57,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:54:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:58,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:54:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:58,067 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:54:58,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:58,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105213946] [2022-11-02 20:54:58,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105213946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:58,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:58,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:54:58,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478306431] [2022-11-02 20:54:58,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:58,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:54:58,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:58,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:54:58,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:54:58,070 INFO L87 Difference]: Start difference. First operand 659 states and 909 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 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:54:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:59,153 INFO L93 Difference]: Finished difference Result 688 states and 962 transitions. [2022-11-02 20:54:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:54:59,154 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 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 44 [2022-11-02 20:54:59,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:59,161 INFO L225 Difference]: With dead ends: 688 [2022-11-02 20:54:59,161 INFO L226 Difference]: Without dead ends: 672 [2022-11-02 20:54:59,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:54:59,169 INFO L413 NwaCegarLoop]: 590 mSDtfsCounter, 98 mSDsluCounter, 3703 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4293 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:59,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4293 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:54:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-11-02 20:54:59,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 656. [2022-11-02 20:54:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 544 states have (on average 1.3455882352941178) internal successors, (732), 549 states have internal predecessors, (732), 80 states have call successors, (80), 26 states have call predecessors, (80), 31 states have return successors, (92), 80 states have call predecessors, (92), 75 states have call successors, (92) [2022-11-02 20:54:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2022-11-02 20:54:59,296 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 44 [2022-11-02 20:54:59,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:59,297 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2022-11-02 20:54:59,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 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:54:59,297 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2022-11-02 20:54:59,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:54:59,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:59,300 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:54:59,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:54:59,300 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:59,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:59,301 INFO L85 PathProgramCache]: Analyzing trace with hash 116231593, now seen corresponding path program 1 times [2022-11-02 20:54:59,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:59,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699625267] [2022-11-02 20:54:59,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:59,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:54:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:59,435 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:54:59,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:59,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699625267] [2022-11-02 20:54:59,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699625267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:59,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:59,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:54:59,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464954379] [2022-11-02 20:54:59,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:59,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:54:59,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:59,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:54:59,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:54:59,439 INFO L87 Difference]: Start difference. First operand 656 states and 904 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 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:55:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:00,046 INFO L93 Difference]: Finished difference Result 690 states and 962 transitions. [2022-11-02 20:55:00,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:55:00,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 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:55:00,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:00,050 INFO L225 Difference]: With dead ends: 690 [2022-11-02 20:55:00,050 INFO L226 Difference]: Without dead ends: 660 [2022-11-02 20:55:00,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:00,052 INFO L413 NwaCegarLoop]: 573 mSDtfsCounter, 158 mSDsluCounter, 3088 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 3661 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:00,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 3661 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:55:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-11-02 20:55:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 644. [2022-11-02 20:55:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 535 states have (on average 1.3401869158878505) internal successors, (717), 540 states have internal predecessors, (717), 77 states have call successors, (77), 26 states have call predecessors, (77), 31 states have return successors, (89), 77 states have call predecessors, (89), 72 states have call successors, (89) [2022-11-02 20:55:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 883 transitions. [2022-11-02 20:55:00,145 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 883 transitions. Word has length 44 [2022-11-02 20:55:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:00,145 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 883 transitions. [2022-11-02 20:55:00,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 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:55:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 883 transitions. [2022-11-02 20:55:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:55:00,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:00,149 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] [2022-11-02 20:55:00,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:55:00,149 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:00,150 INFO L85 PathProgramCache]: Analyzing trace with hash 39637354, now seen corresponding path program 1 times [2022-11-02 20:55:00,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:00,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803034787] [2022-11-02 20:55:00,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:00,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:00,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:55:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:00,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:55:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:00,225 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:55:00,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:00,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803034787] [2022-11-02 20:55:00,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803034787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:00,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:00,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:55:00,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345400528] [2022-11-02 20:55:00,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:00,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:00,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:00,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:00,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:00,228 INFO L87 Difference]: Start difference. First operand 644 states and 883 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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:55:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:00,839 INFO L93 Difference]: Finished difference Result 789 states and 1125 transitions. [2022-11-02 20:55:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:55:00,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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 45 [2022-11-02 20:55:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:00,844 INFO L225 Difference]: With dead ends: 789 [2022-11-02 20:55:00,845 INFO L226 Difference]: Without dead ends: 695 [2022-11-02 20:55:00,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:55:00,847 INFO L413 NwaCegarLoop]: 539 mSDtfsCounter, 134 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:00,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 2206 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:55:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-11-02 20:55:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 651. [2022-11-02 20:55:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 540 states have (on average 1.3407407407407408) internal successors, (724), 546 states have internal predecessors, (724), 78 states have call successors, (78), 26 states have call predecessors, (78), 32 states have return successors, (96), 78 states have call predecessors, (96), 73 states have call successors, (96) [2022-11-02 20:55:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 898 transitions. [2022-11-02 20:55:00,960 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 898 transitions. Word has length 45 [2022-11-02 20:55:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:00,960 INFO L495 AbstractCegarLoop]: Abstraction has 651 states and 898 transitions. [2022-11-02 20:55:00,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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:55:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 898 transitions. [2022-11-02 20:55:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:55:00,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:00,964 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] [2022-11-02 20:55:00,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:55:00,965 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:00,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:00,966 INFO L85 PathProgramCache]: Analyzing trace with hash -469835736, now seen corresponding path program 1 times [2022-11-02 20:55:00,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:00,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990551665] [2022-11-02 20:55:00,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:00,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:55:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:55:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,127 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:55:01,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:01,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990551665] [2022-11-02 20:55:01,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990551665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:01,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:01,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:55:01,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642222123] [2022-11-02 20:55:01,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:01,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:55:01,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:01,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:55:01,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:55:01,132 INFO L87 Difference]: Start difference. First operand 651 states and 898 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 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:55:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:01,906 INFO L93 Difference]: Finished difference Result 689 states and 966 transitions. [2022-11-02 20:55:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:55:01,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 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 45 [2022-11-02 20:55:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:01,912 INFO L225 Difference]: With dead ends: 689 [2022-11-02 20:55:01,912 INFO L226 Difference]: Without dead ends: 669 [2022-11-02 20:55:01,913 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:55:01,914 INFO L413 NwaCegarLoop]: 569 mSDtfsCounter, 161 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 3828 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:01,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 3828 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:55:01,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-02 20:55:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 649. [2022-11-02 20:55:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 539 states have (on average 1.339517625231911) internal successors, (722), 545 states have internal predecessors, (722), 77 states have call successors, (77), 26 states have call predecessors, (77), 32 states have return successors, (95), 77 states have call predecessors, (95), 72 states have call successors, (95) [2022-11-02 20:55:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 894 transitions. [2022-11-02 20:55:02,024 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 894 transitions. Word has length 45 [2022-11-02 20:55:02,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:02,024 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 894 transitions. [2022-11-02 20:55:02,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 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:55:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 894 transitions. [2022-11-02 20:55:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:55:02,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:02,027 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] [2022-11-02 20:55:02,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:55:02,028 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:02,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1759820693, now seen corresponding path program 1 times [2022-11-02 20:55:02,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:02,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382701273] [2022-11-02 20:55:02,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:02,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:02,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:55:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:02,146 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:55:02,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:02,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382701273] [2022-11-02 20:55:02,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382701273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:02,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:02,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:55:02,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898833490] [2022-11-02 20:55:02,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:02,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:55:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:55:02,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:55:02,149 INFO L87 Difference]: Start difference. First operand 649 states and 894 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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:55:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:02,717 INFO L93 Difference]: Finished difference Result 696 states and 976 transitions. [2022-11-02 20:55:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:55:02,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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 45 [2022-11-02 20:55:02,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:02,722 INFO L225 Difference]: With dead ends: 696 [2022-11-02 20:55:02,722 INFO L226 Difference]: Without dead ends: 661 [2022-11-02 20:55:02,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:02,724 INFO L413 NwaCegarLoop]: 568 mSDtfsCounter, 166 mSDsluCounter, 2996 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 3564 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:02,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 3564 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:55:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-11-02 20:55:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 641. [2022-11-02 20:55:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 533 states have (on average 1.3320825515947468) internal successors, (710), 539 states have internal predecessors, (710), 75 states have call successors, (75), 26 states have call predecessors, (75), 32 states have return successors, (93), 75 states have call predecessors, (93), 70 states have call successors, (93) [2022-11-02 20:55:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 878 transitions. [2022-11-02 20:55:02,811 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 878 transitions. Word has length 45 [2022-11-02 20:55:02,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:02,812 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 878 transitions. [2022-11-02 20:55:02,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 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:55:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 878 transitions. [2022-11-02 20:55:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:55:02,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:02,815 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:55:02,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:55:02,815 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:02,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1002239718, now seen corresponding path program 1 times [2022-11-02 20:55:02,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:02,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905748619] [2022-11-02 20:55:02,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:02,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:02,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:55:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:03,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:03,102 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:55:03,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:03,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905748619] [2022-11-02 20:55:03,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905748619] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:03,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:03,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:55:03,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421228610] [2022-11-02 20:55:03,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:03,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:55:03,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:03,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:55:03,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:03,105 INFO L87 Difference]: Start difference. First operand 641 states and 878 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 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:55:04,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:04,470 INFO L93 Difference]: Finished difference Result 676 states and 943 transitions. [2022-11-02 20:55:04,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:55:04,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 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 46 [2022-11-02 20:55:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:04,475 INFO L225 Difference]: With dead ends: 676 [2022-11-02 20:55:04,475 INFO L226 Difference]: Without dead ends: 658 [2022-11-02 20:55:04,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:55:04,476 INFO L413 NwaCegarLoop]: 545 mSDtfsCounter, 110 mSDsluCounter, 3784 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 4329 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:04,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 4329 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:55:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-11-02 20:55:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 638. [2022-11-02 20:55:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 531 states have (on average 1.3314500941619585) internal successors, (707), 537 states have internal predecessors, (707), 74 states have call successors, (74), 26 states have call predecessors, (74), 32 states have return successors, (92), 74 states have call predecessors, (92), 69 states have call successors, (92) [2022-11-02 20:55:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 873 transitions. [2022-11-02 20:55:04,568 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 873 transitions. Word has length 46 [2022-11-02 20:55:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:04,568 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 873 transitions. [2022-11-02 20:55:04,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 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:55:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 873 transitions. [2022-11-02 20:55:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:55:04,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:04,571 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:55:04,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:55:04,572 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash -113531146, now seen corresponding path program 1 times [2022-11-02 20:55:04,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:04,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859462573] [2022-11-02 20:55:04,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:04,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:04,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:55:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:04,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:55:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:04,658 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:55:04,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:04,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859462573] [2022-11-02 20:55:04,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859462573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:04,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:04,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:55:04,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176323712] [2022-11-02 20:55:04,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:04,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:55:04,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:04,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:55:04,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:04,661 INFO L87 Difference]: Start difference. First operand 638 states and 873 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 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:55:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:05,216 INFO L93 Difference]: Finished difference Result 695 states and 980 transitions. [2022-11-02 20:55:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:55:05,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 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 46 [2022-11-02 20:55:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:05,220 INFO L225 Difference]: With dead ends: 695 [2022-11-02 20:55:05,221 INFO L226 Difference]: Without dead ends: 668 [2022-11-02 20:55:05,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:55:05,223 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 187 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:05,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 2314 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:55:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-11-02 20:55:05,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 642. [2022-11-02 20:55:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 533 states have (on average 1.3302063789868668) internal successors, (709), 541 states have internal predecessors, (709), 74 states have call successors, (74), 26 states have call predecessors, (74), 34 states have return successors, (108), 74 states have call predecessors, (108), 69 states have call successors, (108) [2022-11-02 20:55:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 891 transitions. [2022-11-02 20:55:05,345 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 891 transitions. Word has length 46 [2022-11-02 20:55:05,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:05,346 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 891 transitions. [2022-11-02 20:55:05,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 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:55:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 891 transitions. [2022-11-02 20:55:05,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:55:05,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:05,349 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:55:05,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:55:05,350 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:05,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:05,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1506455403, now seen corresponding path program 1 times [2022-11-02 20:55:05,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:05,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26487675] [2022-11-02 20:55:05,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:05,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:05,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:55:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:05,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:05,632 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:55:05,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:05,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26487675] [2022-11-02 20:55:05,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26487675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:05,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:05,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:55:05,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658970993] [2022-11-02 20:55:05,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:05,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:55:05,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:05,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:55:05,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:55:05,635 INFO L87 Difference]: Start difference. First operand 642 states and 891 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 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:55:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:07,057 INFO L93 Difference]: Finished difference Result 680 states and 959 transitions. [2022-11-02 20:55:07,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:55:07,058 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 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 48 [2022-11-02 20:55:07,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:07,062 INFO L225 Difference]: With dead ends: 680 [2022-11-02 20:55:07,062 INFO L226 Difference]: Without dead ends: 660 [2022-11-02 20:55:07,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:55:07,064 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 239 mSDsluCounter, 3981 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 4514 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:07,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 4514 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:55:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-11-02 20:55:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 640. [2022-11-02 20:55:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 532 states have (on average 1.3289473684210527) internal successors, (707), 540 states have internal predecessors, (707), 73 states have call successors, (73), 26 states have call predecessors, (73), 34 states have return successors, (107), 73 states have call predecessors, (107), 68 states have call successors, (107) [2022-11-02 20:55:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 887 transitions. [2022-11-02 20:55:07,165 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 887 transitions. Word has length 48 [2022-11-02 20:55:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:07,165 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 887 transitions. [2022-11-02 20:55:07,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 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:55:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 887 transitions. [2022-11-02 20:55:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:55:07,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:07,168 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] [2022-11-02 20:55:07,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:55:07,169 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:07,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:07,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1400503670, now seen corresponding path program 1 times [2022-11-02 20:55:07,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:07,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309913931] [2022-11-02 20:55:07,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:07,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:07,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:55:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:07,508 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:55:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:07,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309913931] [2022-11-02 20:55:07,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309913931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:07,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:07,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:55:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060387186] [2022-11-02 20:55:07,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:07,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:55:07,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:07,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:55:07,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:55:07,511 INFO L87 Difference]: Start difference. First operand 640 states and 887 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 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:55:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:08,910 INFO L93 Difference]: Finished difference Result 694 states and 972 transitions. [2022-11-02 20:55:08,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:55:08,910 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 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 47 [2022-11-02 20:55:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:08,914 INFO L225 Difference]: With dead ends: 694 [2022-11-02 20:55:08,914 INFO L226 Difference]: Without dead ends: 674 [2022-11-02 20:55:08,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:55:08,916 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 172 mSDsluCounter, 3844 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 4361 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:08,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 4361 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:55:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-11-02 20:55:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 638. [2022-11-02 20:55:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 531 states have (on average 1.3276836158192091) internal successors, (705), 539 states have internal predecessors, (705), 72 states have call successors, (72), 26 states have call predecessors, (72), 34 states have return successors, (106), 72 states have call predecessors, (106), 67 states have call successors, (106) [2022-11-02 20:55:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 883 transitions. [2022-11-02 20:55:09,018 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 883 transitions. Word has length 47 [2022-11-02 20:55:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:09,018 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 883 transitions. [2022-11-02 20:55:09,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 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:55:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 883 transitions. [2022-11-02 20:55:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:55:09,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:09,022 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:55:09,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:55:09,023 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:09,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:09,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1310476923, now seen corresponding path program 1 times [2022-11-02 20:55:09,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:09,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997506737] [2022-11-02 20:55:09,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:09,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:09,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:55:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:09,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:09,362 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:55:09,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:09,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997506737] [2022-11-02 20:55:09,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997506737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:09,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:09,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:55:09,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876270511] [2022-11-02 20:55:09,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:09,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:55:09,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:09,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:55:09,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:09,367 INFO L87 Difference]: Start difference. First operand 638 states and 883 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 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:55:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:10,724 INFO L93 Difference]: Finished difference Result 673 states and 948 transitions. [2022-11-02 20:55:10,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:55:10,725 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 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 48 [2022-11-02 20:55:10,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:10,729 INFO L225 Difference]: With dead ends: 673 [2022-11-02 20:55:10,730 INFO L226 Difference]: Without dead ends: 655 [2022-11-02 20:55:10,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:55:10,731 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 123 mSDsluCounter, 4109 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4644 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:10,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4644 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:55:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2022-11-02 20:55:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 635. [2022-11-02 20:55:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 529 states have (on average 1.3270321361058601) internal successors, (702), 537 states have internal predecessors, (702), 71 states have call successors, (71), 26 states have call predecessors, (71), 34 states have return successors, (105), 71 states have call predecessors, (105), 66 states have call successors, (105) [2022-11-02 20:55:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 878 transitions. [2022-11-02 20:55:10,830 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 878 transitions. Word has length 48 [2022-11-02 20:55:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:10,831 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 878 transitions. [2022-11-02 20:55:10,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 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:55:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 878 transitions. [2022-11-02 20:55:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:55:10,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:10,835 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] [2022-11-02 20:55:10,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:55:10,835 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:10,836 INFO L85 PathProgramCache]: Analyzing trace with hash -631995317, now seen corresponding path program 1 times [2022-11-02 20:55:10,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:10,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599706059] [2022-11-02 20:55:10,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:10,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:55:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,196 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:55:11,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:11,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599706059] [2022-11-02 20:55:11,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599706059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:11,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:11,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:55:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944890565] [2022-11-02 20:55:11,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:11,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:55:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:11,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:55:11,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:11,199 INFO L87 Difference]: Start difference. First operand 635 states and 878 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 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:55:12,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:12,500 INFO L93 Difference]: Finished difference Result 670 states and 943 transitions. [2022-11-02 20:55:12,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:55:12,501 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 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 47 [2022-11-02 20:55:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:12,506 INFO L225 Difference]: With dead ends: 670 [2022-11-02 20:55:12,506 INFO L226 Difference]: Without dead ends: 652 [2022-11-02 20:55:12,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:55:12,507 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 123 mSDsluCounter, 4065 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4593 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:12,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4593 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:55:12,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-11-02 20:55:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 632. [2022-11-02 20:55:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 527 states have (on average 1.3263757115749526) internal successors, (699), 535 states have internal predecessors, (699), 70 states have call successors, (70), 26 states have call predecessors, (70), 34 states have return successors, (104), 70 states have call predecessors, (104), 65 states have call successors, (104) [2022-11-02 20:55:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 873 transitions. [2022-11-02 20:55:12,604 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 873 transitions. Word has length 47 [2022-11-02 20:55:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:12,605 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 873 transitions. [2022-11-02 20:55:12,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 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:55:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 873 transitions. [2022-11-02 20:55:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 20:55:12,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:12,608 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] [2022-11-02 20:55:12,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:55:12,609 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:12,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:12,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1897196007, now seen corresponding path program 1 times [2022-11-02 20:55:12,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:12,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604631557] [2022-11-02 20:55:12,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:12,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:12,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:55:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:12,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:12,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:12,713 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:55:12,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:12,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604631557] [2022-11-02 20:55:12,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604631557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:12,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:12,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:12,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722054267] [2022-11-02 20:55:12,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:12,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:55:12,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:12,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:55:12,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:55:12,716 INFO L87 Difference]: Start difference. First operand 632 states and 873 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:55:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:13,375 INFO L93 Difference]: Finished difference Result 893 states and 1240 transitions. [2022-11-02 20:55:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:55:13,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-11-02 20:55:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:13,380 INFO L225 Difference]: With dead ends: 893 [2022-11-02 20:55:13,380 INFO L226 Difference]: Without dead ends: 743 [2022-11-02 20:55:13,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:13,382 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 315 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:13,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1332 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:55:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-11-02 20:55:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 696. [2022-11-02 20:55:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 581 states have (on average 1.3253012048192772) internal successors, (770), 589 states have internal predecessors, (770), 73 states have call successors, (73), 30 states have call predecessors, (73), 41 states have return successors, (113), 76 states have call predecessors, (113), 69 states have call successors, (113) [2022-11-02 20:55:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 956 transitions. [2022-11-02 20:55:13,487 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 956 transitions. Word has length 50 [2022-11-02 20:55:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:13,488 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 956 transitions. [2022-11-02 20:55:13,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:55:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 956 transitions. [2022-11-02 20:55:13,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:55:13,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:13,491 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:55:13,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:55:13,492 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:13,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash -273874573, now seen corresponding path program 1 times [2022-11-02 20:55:13,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:13,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005938244] [2022-11-02 20:55:13,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:13,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:13,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:55:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:13,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:55:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:13,547 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:55:13,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:13,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005938244] [2022-11-02 20:55:13,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005938244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:13,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:13,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:13,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160243630] [2022-11-02 20:55:13,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:13,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:55:13,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:13,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:55:13,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:55:13,550 INFO L87 Difference]: Start difference. First operand 696 states and 956 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 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:55:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:13,960 INFO L93 Difference]: Finished difference Result 952 states and 1311 transitions. [2022-11-02 20:55:13,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:55:13,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 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 48 [2022-11-02 20:55:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:13,965 INFO L225 Difference]: With dead ends: 952 [2022-11-02 20:55:13,965 INFO L226 Difference]: Without dead ends: 652 [2022-11-02 20:55:13,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:13,968 INFO L413 NwaCegarLoop]: 498 mSDtfsCounter, 174 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:13,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1278 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:55:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2022-11-02 20:55:14,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 623. [2022-11-02 20:55:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 524 states have (on average 1.3206106870229009) internal successors, (692), 530 states have internal predecessors, (692), 64 states have call successors, (64), 27 states have call predecessors, (64), 34 states have return successors, (77), 65 states have call predecessors, (77), 60 states have call successors, (77) [2022-11-02 20:55:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 833 transitions. [2022-11-02 20:55:14,062 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 833 transitions. Word has length 48 [2022-11-02 20:55:14,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:14,062 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 833 transitions. [2022-11-02 20:55:14,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 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:55:14,063 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 833 transitions. [2022-11-02 20:55:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:55:14,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:14,065 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:55:14,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:55:14,066 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:14,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:14,066 INFO L85 PathProgramCache]: Analyzing trace with hash 232958448, now seen corresponding path program 1 times [2022-11-02 20:55:14,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:14,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899164012] [2022-11-02 20:55:14,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:14,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:14,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:55:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:14,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:14,421 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:55:14,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:14,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899164012] [2022-11-02 20:55:14,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899164012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:14,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:14,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:55:14,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131054139] [2022-11-02 20:55:14,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:14,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:55:14,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:14,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:55:14,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:55:14,423 INFO L87 Difference]: Start difference. First operand 623 states and 833 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:15,590 INFO L93 Difference]: Finished difference Result 669 states and 888 transitions. [2022-11-02 20:55:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:55:15,590 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-11-02 20:55:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:15,593 INFO L225 Difference]: With dead ends: 669 [2022-11-02 20:55:15,593 INFO L226 Difference]: Without dead ends: 649 [2022-11-02 20:55:15,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:55:15,595 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 345 mSDsluCounter, 3316 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 3796 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:15,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 3796 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:55:15,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-11-02 20:55:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 621. [2022-11-02 20:55:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 523 states have (on average 1.3193116634799236) internal successors, (690), 529 states have internal predecessors, (690), 63 states have call successors, (63), 27 states have call predecessors, (63), 34 states have return successors, (76), 64 states have call predecessors, (76), 59 states have call successors, (76) [2022-11-02 20:55:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 829 transitions. [2022-11-02 20:55:15,695 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 829 transitions. Word has length 51 [2022-11-02 20:55:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:15,696 INFO L495 AbstractCegarLoop]: Abstraction has 621 states and 829 transitions. [2022-11-02 20:55:15,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 829 transitions. [2022-11-02 20:55:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-02 20:55:15,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:15,699 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] [2022-11-02 20:55:15,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:55:15,699 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:15,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1171724014, now seen corresponding path program 1 times [2022-11-02 20:55:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:15,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666665900] [2022-11-02 20:55:15,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:15,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:15,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:55:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:55:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:15,818 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:55:15,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:15,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666665900] [2022-11-02 20:55:15,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666665900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:15,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:15,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:55:15,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274486509] [2022-11-02 20:55:15,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:15,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:55:15,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:15,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:55:15,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:15,824 INFO L87 Difference]: Start difference. First operand 621 states and 829 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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:55:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:16,461 INFO L93 Difference]: Finished difference Result 724 states and 953 transitions. [2022-11-02 20:55:16,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:55:16,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 50 [2022-11-02 20:55:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:16,464 INFO L225 Difference]: With dead ends: 724 [2022-11-02 20:55:16,464 INFO L226 Difference]: Without dead ends: 698 [2022-11-02 20:55:16,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:55:16,466 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 259 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:16,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 2458 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:55:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-11-02 20:55:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 627. [2022-11-02 20:55:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 528 states have (on average 1.3181818181818181) internal successors, (696), 534 states have internal predecessors, (696), 64 states have call successors, (64), 27 states have call predecessors, (64), 34 states have return successors, (77), 65 states have call predecessors, (77), 60 states have call successors, (77) [2022-11-02 20:55:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 837 transitions. [2022-11-02 20:55:16,561 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 837 transitions. Word has length 50 [2022-11-02 20:55:16,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:16,562 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 837 transitions. [2022-11-02 20:55:16,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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:55:16,562 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 837 transitions. [2022-11-02 20:55:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:55:16,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:16,565 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:55:16,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:55:16,565 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:16,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash 850113778, now seen corresponding path program 1 times [2022-11-02 20:55:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:16,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634695537] [2022-11-02 20:55:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:16,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:16,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:16,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:16,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:16,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:16,665 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:55:16,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:16,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634695537] [2022-11-02 20:55:16,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634695537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:16,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:16,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:55:16,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272808870] [2022-11-02 20:55:16,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:16,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:16,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:16,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:16,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:16,669 INFO L87 Difference]: Start difference. First operand 627 states and 837 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:55:17,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:17,234 INFO L93 Difference]: Finished difference Result 744 states and 998 transitions. [2022-11-02 20:55:17,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:17,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2022-11-02 20:55:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:17,237 INFO L225 Difference]: With dead ends: 744 [2022-11-02 20:55:17,238 INFO L226 Difference]: Without dead ends: 639 [2022-11-02 20:55:17,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:17,240 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 265 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:17,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1189 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:55:17,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-11-02 20:55:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 627. [2022-11-02 20:55:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 528 states have (on average 1.3143939393939394) internal successors, (694), 534 states have internal predecessors, (694), 64 states have call successors, (64), 27 states have call predecessors, (64), 34 states have return successors, (77), 65 states have call predecessors, (77), 60 states have call successors, (77) [2022-11-02 20:55:17,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 835 transitions. [2022-11-02 20:55:17,335 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 835 transitions. Word has length 53 [2022-11-02 20:55:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:17,335 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 835 transitions. [2022-11-02 20:55:17,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:55:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 835 transitions. [2022-11-02 20:55:17,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:55:17,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:17,338 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] [2022-11-02 20:55:17,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:55:17,338 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:17,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash -532277969, now seen corresponding path program 1 times [2022-11-02 20:55:17,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:17,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66339346] [2022-11-02 20:55:17,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:17,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:17,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:55:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:17,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:55:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:17,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:17,647 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:55:17,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:17,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66339346] [2022-11-02 20:55:17,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66339346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:17,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:17,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:55:17,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820253083] [2022-11-02 20:55:17,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:17,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:55:17,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:17,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:55:17,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:55:17,651 INFO L87 Difference]: Start difference. First operand 627 states and 835 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:18,808 INFO L93 Difference]: Finished difference Result 657 states and 873 transitions. [2022-11-02 20:55:18,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:55:18,809 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2022-11-02 20:55:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:18,811 INFO L225 Difference]: With dead ends: 657 [2022-11-02 20:55:18,811 INFO L226 Difference]: Without dead ends: 637 [2022-11-02 20:55:18,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:55:18,813 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 252 mSDsluCounter, 3597 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 4086 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:18,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 4086 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:55:18,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-11-02 20:55:18,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 625. [2022-11-02 20:55:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 527 states have (on average 1.3130929791271346) internal successors, (692), 533 states have internal predecessors, (692), 63 states have call successors, (63), 27 states have call predecessors, (63), 34 states have return successors, (76), 64 states have call predecessors, (76), 59 states have call successors, (76) [2022-11-02 20:55:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 831 transitions. [2022-11-02 20:55:18,905 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 831 transitions. Word has length 52 [2022-11-02 20:55:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:18,906 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 831 transitions. [2022-11-02 20:55:18,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 831 transitions. [2022-11-02 20:55:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:55:18,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:18,919 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:55:18,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:55:18,919 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:18,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash -381678341, now seen corresponding path program 1 times [2022-11-02 20:55:18,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:18,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837927052] [2022-11-02 20:55:18,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:19,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:55:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:19,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:55:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:19,050 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:55:19,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:19,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837927052] [2022-11-02 20:55:19,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837927052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:19,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:19,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:55:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892304963] [2022-11-02 20:55:19,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:19,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:55:19,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:19,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:55:19,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:55:19,053 INFO L87 Difference]: Start difference. First operand 625 states and 831 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 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:55:19,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:19,800 INFO L93 Difference]: Finished difference Result 671 states and 891 transitions. [2022-11-02 20:55:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:55:19,801 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), 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 51 [2022-11-02 20:55:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:19,814 INFO L225 Difference]: With dead ends: 671 [2022-11-02 20:55:19,814 INFO L226 Difference]: Without dead ends: 617 [2022-11-02 20:55:19,815 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:55:19,816 INFO L413 NwaCegarLoop]: 487 mSDtfsCounter, 185 mSDsluCounter, 2683 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 3170 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:19,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 3170 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:55:19,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-02 20:55:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 598. [2022-11-02 20:55:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 505 states have (on average 1.299009900990099) internal successors, (656), 511 states have internal predecessors, (656), 58 states have call successors, (58), 27 states have call predecessors, (58), 34 states have return successors, (70), 59 states have call predecessors, (70), 54 states have call successors, (70) [2022-11-02 20:55:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 784 transitions. [2022-11-02 20:55:19,903 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 784 transitions. Word has length 51 [2022-11-02 20:55:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:19,904 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 784 transitions. [2022-11-02 20:55:19,904 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), 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:55:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 784 transitions. [2022-11-02 20:55:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:55:19,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:19,910 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:55:19,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:55:19,910 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:19,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1990060921, now seen corresponding path program 1 times [2022-11-02 20:55:19,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:19,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48544304] [2022-11-02 20:55:19,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:19,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:19,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:55:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:20,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:55:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:20,003 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:55:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:20,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48544304] [2022-11-02 20:55:20,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48544304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:20,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:20,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:55:20,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140448098] [2022-11-02 20:55:20,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:20,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:55:20,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:20,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:55:20,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:20,008 INFO L87 Difference]: Start difference. First operand 598 states and 784 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 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:55:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:20,509 INFO L93 Difference]: Finished difference Result 651 states and 845 transitions. [2022-11-02 20:55:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:55:20,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 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 51 [2022-11-02 20:55:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:20,513 INFO L225 Difference]: With dead ends: 651 [2022-11-02 20:55:20,513 INFO L226 Difference]: Without dead ends: 604 [2022-11-02 20:55:20,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:55:20,514 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 98 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:20,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 2066 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:55:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-11-02 20:55:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 588. [2022-11-02 20:55:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 497 states have (on average 1.295774647887324) internal successors, (644), 503 states have internal predecessors, (644), 56 states have call successors, (56), 27 states have call predecessors, (56), 34 states have return successors, (68), 57 states have call predecessors, (68), 52 states have call successors, (68) [2022-11-02 20:55:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 768 transitions. [2022-11-02 20:55:20,608 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 768 transitions. Word has length 51 [2022-11-02 20:55:20,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:20,608 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 768 transitions. [2022-11-02 20:55:20,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 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:55:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 768 transitions. [2022-11-02 20:55:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:55:20,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:20,611 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] [2022-11-02 20:55:20,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:55:20,612 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:20,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:20,612 INFO L85 PathProgramCache]: Analyzing trace with hash 105801563, now seen corresponding path program 1 times [2022-11-02 20:55:20,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:20,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109388164] [2022-11-02 20:55:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:20,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:20,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:55:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:20,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:55:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:20,708 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:55:20,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:20,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109388164] [2022-11-02 20:55:20,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109388164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:20,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:20,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:55:20,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318794768] [2022-11-02 20:55:20,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:20,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:55:20,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:55:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:20,711 INFO L87 Difference]: Start difference. First operand 588 states and 768 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 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:55:21,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:21,245 INFO L93 Difference]: Finished difference Result 627 states and 815 transitions. [2022-11-02 20:55:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:55:21,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 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 52 [2022-11-02 20:55:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:21,251 INFO L225 Difference]: With dead ends: 627 [2022-11-02 20:55:21,252 INFO L226 Difference]: Without dead ends: 595 [2022-11-02 20:55:21,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:55:21,256 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 94 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:21,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 2070 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:55:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-11-02 20:55:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 583. [2022-11-02 20:55:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 493 states have (on average 1.2961460446247464) internal successors, (639), 499 states have internal predecessors, (639), 55 states have call successors, (55), 27 states have call predecessors, (55), 34 states have return successors, (67), 56 states have call predecessors, (67), 51 states have call successors, (67) [2022-11-02 20:55:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 761 transitions. [2022-11-02 20:55:21,334 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 761 transitions. Word has length 52 [2022-11-02 20:55:21,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:21,335 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 761 transitions. [2022-11-02 20:55:21,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 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:55:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 761 transitions. [2022-11-02 20:55:21,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:55:21,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:21,337 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] [2022-11-02 20:55:21,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:55:21,337 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:21,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:21,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1444104729, now seen corresponding path program 1 times [2022-11-02 20:55:21,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:21,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75642519] [2022-11-02 20:55:21,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:21,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:21,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:55:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:21,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:21,398 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:55:21,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:21,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75642519] [2022-11-02 20:55:21,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75642519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:21,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:21,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:21,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336115933] [2022-11-02 20:55:21,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:21,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:55:21,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:21,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:55:21,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:55:21,401 INFO L87 Difference]: Start difference. First operand 583 states and 761 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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:55:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:21,933 INFO L93 Difference]: Finished difference Result 700 states and 914 transitions. [2022-11-02 20:55:21,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:55:21,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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 52 [2022-11-02 20:55:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:21,936 INFO L225 Difference]: With dead ends: 700 [2022-11-02 20:55:21,936 INFO L226 Difference]: Without dead ends: 692 [2022-11-02 20:55:21,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:21,938 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 287 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:21,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1074 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:55:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-11-02 20:55:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 611. [2022-11-02 20:55:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 519 states have (on average 1.2909441233140655) internal successors, (670), 525 states have internal predecessors, (670), 55 states have call successors, (55), 27 states have call predecessors, (55), 36 states have return successors, (69), 58 states have call predecessors, (69), 51 states have call successors, (69) [2022-11-02 20:55:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 794 transitions. [2022-11-02 20:55:22,039 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 794 transitions. Word has length 52 [2022-11-02 20:55:22,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:22,041 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 794 transitions. [2022-11-02 20:55:22,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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:55:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 794 transitions. [2022-11-02 20:55:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:55:22,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:22,043 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:55:22,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:55:22,044 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:22,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:22,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2032610889, now seen corresponding path program 1 times [2022-11-02 20:55:22,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:22,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191965451] [2022-11-02 20:55:22,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:22,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:55:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,151 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:55:22,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:22,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191965451] [2022-11-02 20:55:22,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191965451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:22,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:22,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:55:22,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404514547] [2022-11-02 20:55:22,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:22,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:55:22,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:22,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:55:22,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:22,154 INFO L87 Difference]: Start difference. First operand 611 states and 794 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 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:55:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:22,937 INFO L93 Difference]: Finished difference Result 696 states and 908 transitions. [2022-11-02 20:55:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:55:22,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 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 53 [2022-11-02 20:55:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:22,940 INFO L225 Difference]: With dead ends: 696 [2022-11-02 20:55:22,940 INFO L226 Difference]: Without dead ends: 690 [2022-11-02 20:55:22,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:22,941 INFO L413 NwaCegarLoop]: 483 mSDtfsCounter, 788 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:22,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1319 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:55:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-11-02 20:55:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 611. [2022-11-02 20:55:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 519 states have (on average 1.2890173410404624) internal successors, (669), 525 states have internal predecessors, (669), 55 states have call successors, (55), 27 states have call predecessors, (55), 36 states have return successors, (69), 58 states have call predecessors, (69), 51 states have call successors, (69) [2022-11-02 20:55:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 793 transitions. [2022-11-02 20:55:23,047 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 793 transitions. Word has length 53 [2022-11-02 20:55:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:23,047 INFO L495 AbstractCegarLoop]: Abstraction has 611 states and 793 transitions. [2022-11-02 20:55:23,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 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:55:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 793 transitions. [2022-11-02 20:55:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 20:55:23,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:23,050 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] [2022-11-02 20:55:23,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 20:55:23,050 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:23,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:23,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2028580847, now seen corresponding path program 1 times [2022-11-02 20:55:23,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:23,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000197722] [2022-11-02 20:55:23,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:23,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:23,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:55:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:23,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:55:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:23,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:23,394 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:55:23,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:23,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000197722] [2022-11-02 20:55:23,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000197722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:23,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:23,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-02 20:55:23,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900708845] [2022-11-02 20:55:23,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:23,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:55:23,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:23,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:55:23,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:55:23,396 INFO L87 Difference]: Start difference. First operand 611 states and 793 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:24,768 INFO L93 Difference]: Finished difference Result 643 states and 833 transitions. [2022-11-02 20:55:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:55:24,769 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2022-11-02 20:55:24,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:24,772 INFO L225 Difference]: With dead ends: 643 [2022-11-02 20:55:24,772 INFO L226 Difference]: Without dead ends: 620 [2022-11-02 20:55:24,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:55:24,774 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 328 mSDsluCounter, 3398 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 3824 SdHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:24,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 3824 Invalid, 1687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:55:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-11-02 20:55:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 608. [2022-11-02 20:55:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 517 states have (on average 1.2882011605415862) internal successors, (666), 523 states have internal predecessors, (666), 54 states have call successors, (54), 27 states have call predecessors, (54), 36 states have return successors, (68), 57 states have call predecessors, (68), 50 states have call successors, (68) [2022-11-02 20:55:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 788 transitions. [2022-11-02 20:55:24,887 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 788 transitions. Word has length 55 [2022-11-02 20:55:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:24,888 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 788 transitions. [2022-11-02 20:55:24,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 788 transitions. [2022-11-02 20:55:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:55:24,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:24,890 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] [2022-11-02 20:55:24,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 20:55:24,891 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:24,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:24,891 INFO L85 PathProgramCache]: Analyzing trace with hash -926060850, now seen corresponding path program 1 times [2022-11-02 20:55:24,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:24,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638049295] [2022-11-02 20:55:24,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:24,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:25,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:55:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:25,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:25,269 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:55:25,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:25,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638049295] [2022-11-02 20:55:25,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638049295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:25,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:25,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:55:25,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995386174] [2022-11-02 20:55:25,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:25,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:55:25,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:25,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:55:25,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:25,271 INFO L87 Difference]: Start difference. First operand 608 states and 788 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 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:55:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:26,432 INFO L93 Difference]: Finished difference Result 635 states and 822 transitions. [2022-11-02 20:55:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:55:26,433 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 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 54 [2022-11-02 20:55:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:26,435 INFO L225 Difference]: With dead ends: 635 [2022-11-02 20:55:26,435 INFO L226 Difference]: Without dead ends: 610 [2022-11-02 20:55:26,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:55:26,437 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 116 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 3615 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:26,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 3615 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:55:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-02 20:55:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 598. [2022-11-02 20:55:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 509 states have (on average 1.2888015717092338) internal successors, (656), 515 states have internal predecessors, (656), 52 states have call successors, (52), 27 states have call predecessors, (52), 36 states have return successors, (66), 55 states have call predecessors, (66), 48 states have call successors, (66) [2022-11-02 20:55:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 774 transitions. [2022-11-02 20:55:26,536 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 774 transitions. Word has length 54 [2022-11-02 20:55:26,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:26,536 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 774 transitions. [2022-11-02 20:55:26,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 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:55:26,536 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 774 transitions. [2022-11-02 20:55:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:55:26,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:26,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] [2022-11-02 20:55:26,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 20:55:26,539 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:26,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:26,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1717160597, now seen corresponding path program 1 times [2022-11-02 20:55:26,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:26,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459814648] [2022-11-02 20:55:26,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:26,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:26,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:55:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:26,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:55:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:26,630 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:55:26,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:26,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459814648] [2022-11-02 20:55:26,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459814648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:26,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:26,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:55:26,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654574590] [2022-11-02 20:55:26,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:26,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:55:26,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:26,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:55:26,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:26,634 INFO L87 Difference]: Start difference. First operand 598 states and 774 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 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:55:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:27,119 INFO L93 Difference]: Finished difference Result 637 states and 820 transitions. [2022-11-02 20:55:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:55:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 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 54 [2022-11-02 20:55:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:27,122 INFO L225 Difference]: With dead ends: 637 [2022-11-02 20:55:27,122 INFO L226 Difference]: Without dead ends: 605 [2022-11-02 20:55:27,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:55:27,124 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 171 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:27,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1696 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:55:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-11-02 20:55:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 593. [2022-11-02 20:55:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 505 states have (on average 1.2891089108910891) internal successors, (651), 511 states have internal predecessors, (651), 51 states have call successors, (51), 27 states have call predecessors, (51), 36 states have return successors, (65), 54 states have call predecessors, (65), 47 states have call successors, (65) [2022-11-02 20:55:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 767 transitions. [2022-11-02 20:55:27,233 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 767 transitions. Word has length 54 [2022-11-02 20:55:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:27,234 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 767 transitions. [2022-11-02 20:55:27,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 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:55:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 767 transitions. [2022-11-02 20:55:27,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:55:27,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:27,237 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] [2022-11-02 20:55:27,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 20:55:27,237 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:27,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1513646241, now seen corresponding path program 1 times [2022-11-02 20:55:27,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:27,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224134740] [2022-11-02 20:55:27,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:27,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:27,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:55:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:27,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:55:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:27,405 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:55:27,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:27,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224134740] [2022-11-02 20:55:27,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224134740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:27,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:27,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:55:27,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437495769] [2022-11-02 20:55:27,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:27,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:55:27,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:27,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:55:27,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:27,408 INFO L87 Difference]: Start difference. First operand 593 states and 767 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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:55:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:28,060 INFO L93 Difference]: Finished difference Result 628 states and 810 transitions. [2022-11-02 20:55:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:55:28,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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 54 [2022-11-02 20:55:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:28,062 INFO L225 Difference]: With dead ends: 628 [2022-11-02 20:55:28,062 INFO L226 Difference]: Without dead ends: 602 [2022-11-02 20:55:28,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:55:28,063 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 232 mSDsluCounter, 2698 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 3112 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:28,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 3112 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:55:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-11-02 20:55:28,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 590. [2022-11-02 20:55:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 503 states have (on average 1.2882703777335984) internal successors, (648), 509 states have internal predecessors, (648), 50 states have call successors, (50), 27 states have call predecessors, (50), 36 states have return successors, (64), 53 states have call predecessors, (64), 46 states have call successors, (64) [2022-11-02 20:55:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 762 transitions. [2022-11-02 20:55:28,145 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 762 transitions. Word has length 54 [2022-11-02 20:55:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:28,146 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 762 transitions. [2022-11-02 20:55:28,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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:55:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 762 transitions. [2022-11-02 20:55:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:55:28,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:28,148 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] [2022-11-02 20:55:28,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-02 20:55:28,148 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:28,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:28,149 INFO L85 PathProgramCache]: Analyzing trace with hash 773886590, now seen corresponding path program 1 times [2022-11-02 20:55:28,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:28,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84855948] [2022-11-02 20:55:28,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:28,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:55:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:28,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:28,250 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:55:28,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:28,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84855948] [2022-11-02 20:55:28,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84855948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:28,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:28,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:55:28,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015037406] [2022-11-02 20:55:28,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:28,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:55:28,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:28,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:55:28,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:28,252 INFO L87 Difference]: Start difference. First operand 590 states and 762 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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:55:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:29,022 INFO L93 Difference]: Finished difference Result 673 states and 872 transitions. [2022-11-02 20:55:29,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:55:29,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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 54 [2022-11-02 20:55:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:29,024 INFO L225 Difference]: With dead ends: 673 [2022-11-02 20:55:29,024 INFO L226 Difference]: Without dead ends: 669 [2022-11-02 20:55:29,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:55:29,026 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 695 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:29,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1465 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:55:29,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-02 20:55:29,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 588. [2022-11-02 20:55:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 501 states have (on average 1.2874251497005988) internal successors, (645), 507 states have internal predecessors, (645), 50 states have call successors, (50), 27 states have call predecessors, (50), 36 states have return successors, (64), 53 states have call predecessors, (64), 46 states have call successors, (64) [2022-11-02 20:55:29,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 759 transitions. [2022-11-02 20:55:29,113 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 759 transitions. Word has length 54 [2022-11-02 20:55:29,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:29,113 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 759 transitions. [2022-11-02 20:55:29,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 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:55:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 759 transitions. [2022-11-02 20:55:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:55:29,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:29,115 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] [2022-11-02 20:55:29,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-02 20:55:29,116 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:29,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash 774163420, now seen corresponding path program 1 times [2022-11-02 20:55:29,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:29,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954827434] [2022-11-02 20:55:29,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:29,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:55:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:29,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:29,322 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:55:29,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:29,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954827434] [2022-11-02 20:55:29,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954827434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:29,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:29,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:55:29,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323358668] [2022-11-02 20:55:29,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:29,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:55:29,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:29,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:55:29,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:29,326 INFO L87 Difference]: Start difference. First operand 588 states and 759 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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:55:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:30,306 INFO L93 Difference]: Finished difference Result 610 states and 786 transitions. [2022-11-02 20:55:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:55:30,307 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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 54 [2022-11-02 20:55:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:30,308 INFO L225 Difference]: With dead ends: 610 [2022-11-02 20:55:30,309 INFO L226 Difference]: Without dead ends: 562 [2022-11-02 20:55:30,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:55:30,310 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 211 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:30,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2763 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:55:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-02 20:55:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 546. [2022-11-02 20:55:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 461 states have (on average 1.2776572668112798) internal successors, (589), 467 states have internal predecessors, (589), 50 states have call successors, (50), 27 states have call predecessors, (50), 34 states have return successors, (62), 51 states have call predecessors, (62), 46 states have call successors, (62) [2022-11-02 20:55:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 701 transitions. [2022-11-02 20:55:30,391 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 701 transitions. Word has length 54 [2022-11-02 20:55:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:30,391 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 701 transitions. [2022-11-02 20:55:30,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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:55:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 701 transitions. [2022-11-02 20:55:30,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:55:30,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:30,393 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:55:30,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-02 20:55:30,394 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:30,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1341431007, now seen corresponding path program 1 times [2022-11-02 20:55:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:30,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146697200] [2022-11-02 20:55:30,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:30,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:55:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:55:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,642 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:55:30,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:30,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146697200] [2022-11-02 20:55:30,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146697200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:30,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:30,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:55:30,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428006858] [2022-11-02 20:55:30,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:30,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:55:30,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:30,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:55:30,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:55:30,645 INFO L87 Difference]: Start difference. First operand 546 states and 701 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:55:31,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:31,761 INFO L93 Difference]: Finished difference Result 601 states and 768 transitions. [2022-11-02 20:55:31,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:55:31,761 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2022-11-02 20:55:31,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:31,763 INFO L225 Difference]: With dead ends: 601 [2022-11-02 20:55:31,763 INFO L226 Difference]: Without dead ends: 581 [2022-11-02 20:55:31,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:55:31,765 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 256 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 3781 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:31,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 3781 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:55:31,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-11-02 20:55:31,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 544. [2022-11-02 20:55:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 460 states have (on average 1.2760869565217392) internal successors, (587), 466 states have internal predecessors, (587), 49 states have call successors, (49), 27 states have call predecessors, (49), 34 states have return successors, (61), 50 states have call predecessors, (61), 45 states have call successors, (61) [2022-11-02 20:55:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 697 transitions. [2022-11-02 20:55:31,842 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 697 transitions. Word has length 59 [2022-11-02 20:55:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:31,843 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 697 transitions. [2022-11-02 20:55:31,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:55:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 697 transitions. [2022-11-02 20:55:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:55:31,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:31,845 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] [2022-11-02 20:55:31,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-02 20:55:31,845 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:31,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1350619309, now seen corresponding path program 1 times [2022-11-02 20:55:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:31,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119689417] [2022-11-02 20:55:31,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:55:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:31,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:55:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:31,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:31,949 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:55:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:31,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119689417] [2022-11-02 20:55:31,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119689417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:31,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:31,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:55:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168646303] [2022-11-02 20:55:31,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:31,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:55:31,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:31,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:55:31,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:55:31,952 INFO L87 Difference]: Start difference. First operand 544 states and 697 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 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:55:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:32,507 INFO L93 Difference]: Finished difference Result 605 states and 767 transitions. [2022-11-02 20:55:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:55:32,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 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 56 [2022-11-02 20:55:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:32,510 INFO L225 Difference]: With dead ends: 605 [2022-11-02 20:55:32,510 INFO L226 Difference]: Without dead ends: 574 [2022-11-02 20:55:32,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:55:32,511 INFO L413 NwaCegarLoop]: 401 mSDtfsCounter, 187 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:32,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1747 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:55:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-11-02 20:55:32,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 544. [2022-11-02 20:55:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 460 states have (on average 1.2739130434782608) internal successors, (586), 466 states have internal predecessors, (586), 49 states have call successors, (49), 27 states have call predecessors, (49), 34 states have return successors, (61), 50 states have call predecessors, (61), 45 states have call successors, (61) [2022-11-02 20:55:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 696 transitions. [2022-11-02 20:55:32,590 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 696 transitions. Word has length 56 [2022-11-02 20:55:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:32,591 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 696 transitions. [2022-11-02 20:55:32,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 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:55:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 696 transitions. [2022-11-02 20:55:32,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:55:32,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:32,593 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] [2022-11-02 20:55:32,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-02 20:55:32,593 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:32,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:32,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1373251563, now seen corresponding path program 1 times [2022-11-02 20:55:32,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:32,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907875716] [2022-11-02 20:55:32,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:32,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:32,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:55:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:32,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:55:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:32,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:32,831 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:55:32,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:32,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907875716] [2022-11-02 20:55:32,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907875716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:32,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:32,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:55:32,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806413192] [2022-11-02 20:55:32,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:32,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:55:32,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:32,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:55:32,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:55:32,834 INFO L87 Difference]: Start difference. First operand 544 states and 696 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:33,910 INFO L93 Difference]: Finished difference Result 599 states and 763 transitions. [2022-11-02 20:55:33,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:55:33,911 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2022-11-02 20:55:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:33,913 INFO L225 Difference]: With dead ends: 599 [2022-11-02 20:55:33,913 INFO L226 Difference]: Without dead ends: 569 [2022-11-02 20:55:33,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:55:33,914 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 347 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 3261 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:33,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 3261 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:55:33,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-11-02 20:55:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 539. [2022-11-02 20:55:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 456 states have (on average 1.269736842105263) internal successors, (579), 462 states have internal predecessors, (579), 48 states have call successors, (48), 27 states have call predecessors, (48), 34 states have return successors, (59), 49 states have call predecessors, (59), 44 states have call successors, (59) [2022-11-02 20:55:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 686 transitions. [2022-11-02 20:55:33,975 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 686 transitions. Word has length 56 [2022-11-02 20:55:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:33,976 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 686 transitions. [2022-11-02 20:55:33,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 686 transitions. [2022-11-02 20:55:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:55:33,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:33,978 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] [2022-11-02 20:55:33,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-02 20:55:33,978 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:33,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:33,979 INFO L85 PathProgramCache]: Analyzing trace with hash -801787505, now seen corresponding path program 1 times [2022-11-02 20:55:33,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:33,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597286043] [2022-11-02 20:55:33,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:34,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:55:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:34,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:55:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:34,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:34,080 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:55:34,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:34,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597286043] [2022-11-02 20:55:34,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597286043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:34,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:34,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:55:34,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983715338] [2022-11-02 20:55:34,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:34,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:55:34,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:34,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:55:34,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:55:34,082 INFO L87 Difference]: Start difference. First operand 539 states and 686 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 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:55:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:34,659 INFO L93 Difference]: Finished difference Result 582 states and 736 transitions. [2022-11-02 20:55:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:55:34,660 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 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 56 [2022-11-02 20:55:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:34,662 INFO L225 Difference]: With dead ends: 582 [2022-11-02 20:55:34,662 INFO L226 Difference]: Without dead ends: 545 [2022-11-02 20:55:34,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:55:34,663 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 168 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:34,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1841 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:55:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-11-02 20:55:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 533. [2022-11-02 20:55:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 451 states have (on average 1.270509977827051) internal successors, (573), 457 states have internal predecessors, (573), 47 states have call successors, (47), 27 states have call predecessors, (47), 34 states have return successors, (58), 48 states have call predecessors, (58), 43 states have call successors, (58) [2022-11-02 20:55:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 678 transitions. [2022-11-02 20:55:34,724 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 678 transitions. Word has length 56 [2022-11-02 20:55:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:34,724 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 678 transitions. [2022-11-02 20:55:34,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 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:55:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 678 transitions. [2022-11-02 20:55:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:55:34,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:34,726 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] [2022-11-02 20:55:34,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-02 20:55:34,727 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:34,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:34,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1511727278, now seen corresponding path program 1 times [2022-11-02 20:55:34,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:34,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714307225] [2022-11-02 20:55:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:34,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:55:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:34,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:55:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:34,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:34,839 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:55:34,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:34,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714307225] [2022-11-02 20:55:34,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714307225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:34,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:34,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:55:34,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721189580] [2022-11-02 20:55:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:34,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:55:34,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:34,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:55:34,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:55:34,842 INFO L87 Difference]: Start difference. First operand 533 states and 678 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 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:55:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:35,374 INFO L93 Difference]: Finished difference Result 576 states and 728 transitions. [2022-11-02 20:55:35,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:55:35,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 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 58 [2022-11-02 20:55:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:35,377 INFO L225 Difference]: With dead ends: 576 [2022-11-02 20:55:35,377 INFO L226 Difference]: Without dead ends: 533 [2022-11-02 20:55:35,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:55:35,378 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 261 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:35,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1376 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:55:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-11-02 20:55:35,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 521. [2022-11-02 20:55:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 440 states have (on average 1.2659090909090909) internal successors, (557), 446 states have internal predecessors, (557), 46 states have call successors, (46), 27 states have call predecessors, (46), 34 states have return successors, (57), 47 states have call predecessors, (57), 42 states have call successors, (57) [2022-11-02 20:55:35,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 660 transitions. [2022-11-02 20:55:35,439 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 660 transitions. Word has length 58 [2022-11-02 20:55:35,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:35,440 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 660 transitions. [2022-11-02 20:55:35,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 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:55:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 660 transitions. [2022-11-02 20:55:35,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 20:55:35,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:35,442 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:55:35,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-02 20:55:35,442 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:35,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:35,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2069212948, now seen corresponding path program 1 times [2022-11-02 20:55:35,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:35,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196590122] [2022-11-02 20:55:35,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:35,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:35,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:55:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:35,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:55:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:35,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:35,750 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:55:35,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:35,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196590122] [2022-11-02 20:55:35,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196590122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:35,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:35,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:55:35,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104619887] [2022-11-02 20:55:35,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:35,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:55:35,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:35,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:55:35,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:55:35,753 INFO L87 Difference]: Start difference. First operand 521 states and 660 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:55:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:36,805 INFO L93 Difference]: Finished difference Result 549 states and 694 transitions. [2022-11-02 20:55:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:55:36,805 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-11-02 20:55:36,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:36,806 INFO L225 Difference]: With dead ends: 549 [2022-11-02 20:55:36,806 INFO L226 Difference]: Without dead ends: 528 [2022-11-02 20:55:36,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:55:36,807 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 200 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 3012 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:36,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 3012 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:55:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-11-02 20:55:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 516. [2022-11-02 20:55:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 437 states have (on average 1.265446224256293) internal successors, (553), 443 states have internal predecessors, (553), 44 states have call successors, (44), 27 states have call predecessors, (44), 34 states have return successors, (55), 45 states have call predecessors, (55), 40 states have call successors, (55) [2022-11-02 20:55:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 652 transitions. [2022-11-02 20:55:36,885 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 652 transitions. Word has length 64 [2022-11-02 20:55:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:36,886 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 652 transitions. [2022-11-02 20:55:36,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:55:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 652 transitions. [2022-11-02 20:55:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-02 20:55:36,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:36,888 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] [2022-11-02 20:55:36,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-02 20:55:36,888 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:36,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash 477751716, now seen corresponding path program 1 times [2022-11-02 20:55:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:36,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346928047] [2022-11-02 20:55:36,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:36,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 20:55:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,203 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:55:37,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:37,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346928047] [2022-11-02 20:55:37,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346928047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:37,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:37,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:55:37,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001326444] [2022-11-02 20:55:37,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:37,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:55:37,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:37,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:55:37,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:37,205 INFO L87 Difference]: Start difference. First operand 516 states and 652 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 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:55:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:38,059 INFO L93 Difference]: Finished difference Result 530 states and 670 transitions. [2022-11-02 20:55:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:55:38,059 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 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 57 [2022-11-02 20:55:38,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:38,061 INFO L225 Difference]: With dead ends: 530 [2022-11-02 20:55:38,061 INFO L226 Difference]: Without dead ends: 486 [2022-11-02 20:55:38,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:55:38,062 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 115 mSDsluCounter, 2464 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:38,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 2803 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:55:38,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2022-11-02 20:55:38,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 474. [2022-11-02 20:55:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 400 states have (on average 1.2775) internal successors, (511), 405 states have internal predecessors, (511), 41 states have call successors, (41), 25 states have call predecessors, (41), 32 states have return successors, (53), 43 states have call predecessors, (53), 38 states have call successors, (53) [2022-11-02 20:55:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 605 transitions. [2022-11-02 20:55:38,153 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 605 transitions. Word has length 57 [2022-11-02 20:55:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:38,153 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 605 transitions. [2022-11-02 20:55:38,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 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:55:38,154 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 605 transitions. [2022-11-02 20:55:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:55:38,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:38,155 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] [2022-11-02 20:55:38,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-02 20:55:38,155 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:38,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:38,156 INFO L85 PathProgramCache]: Analyzing trace with hash 999008539, now seen corresponding path program 1 times [2022-11-02 20:55:38,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:38,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099348204] [2022-11-02 20:55:38,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:38,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:38,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:55:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:38,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:55:38,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:38,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099348204] [2022-11-02 20:55:38,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099348204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:38,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:38,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:55:38,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055901407] [2022-11-02 20:55:38,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:38,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:55:38,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:38,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:55:38,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:38,391 INFO L87 Difference]: Start difference. First operand 474 states and 605 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:40,117 INFO L93 Difference]: Finished difference Result 967 states and 1234 transitions. [2022-11-02 20:55:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-02 20:55:40,118 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-11-02 20:55:40,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:40,119 INFO L225 Difference]: With dead ends: 967 [2022-11-02 20:55:40,120 INFO L226 Difference]: Without dead ends: 850 [2022-11-02 20:55:40,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2022-11-02 20:55:40,121 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 657 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:40,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 2267 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:55:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2022-11-02 20:55:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 657. [2022-11-02 20:55:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 549 states have (on average 1.2859744990892532) internal successors, (706), 560 states have internal predecessors, (706), 58 states have call successors, (58), 38 states have call predecessors, (58), 49 states have return successors, (78), 58 states have call predecessors, (78), 55 states have call successors, (78) [2022-11-02 20:55:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 842 transitions. [2022-11-02 20:55:40,203 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 842 transitions. Word has length 58 [2022-11-02 20:55:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:40,203 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 842 transitions. [2022-11-02 20:55:40,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 842 transitions. [2022-11-02 20:55:40,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:55:40,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:40,205 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] [2022-11-02 20:55:40,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-02 20:55:40,205 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:40,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:40,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1875027545, now seen corresponding path program 1 times [2022-11-02 20:55:40,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:40,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328251216] [2022-11-02 20:55:40,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:40,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:40,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:55:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:40,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:40,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:40,283 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:55:40,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:40,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328251216] [2022-11-02 20:55:40,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328251216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:40,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:40,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:55:40,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597605490] [2022-11-02 20:55:40,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:40,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:55:40,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:40,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:55:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:40,285 INFO L87 Difference]: Start difference. First operand 657 states and 842 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:41,050 INFO L93 Difference]: Finished difference Result 951 states and 1213 transitions. [2022-11-02 20:55:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:55:41,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-11-02 20:55:41,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:41,053 INFO L225 Difference]: With dead ends: 951 [2022-11-02 20:55:41,053 INFO L226 Difference]: Without dead ends: 867 [2022-11-02 20:55:41,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:55:41,055 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 907 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:41,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 1662 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:55:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-11-02 20:55:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 487. [2022-11-02 20:55:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 412 states have (on average 1.2718446601941749) internal successors, (524), 416 states have internal predecessors, (524), 41 states have call successors, (41), 27 states have call predecessors, (41), 33 states have return successors, (53), 43 states have call predecessors, (53), 38 states have call successors, (53) [2022-11-02 20:55:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 618 transitions. [2022-11-02 20:55:41,127 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 618 transitions. Word has length 58 [2022-11-02 20:55:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:41,127 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 618 transitions. [2022-11-02 20:55:41,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 618 transitions. [2022-11-02 20:55:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:55:41,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:41,128 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] [2022-11-02 20:55:41,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-02 20:55:41,129 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:41,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:41,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1125550286, now seen corresponding path program 1 times [2022-11-02 20:55:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:41,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010986462] [2022-11-02 20:55:41,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:41,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:41,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:41,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:55:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:41,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:55:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:41,388 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:55:41,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:41,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010986462] [2022-11-02 20:55:41,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010986462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:41,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:41,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:55:41,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361585393] [2022-11-02 20:55:41,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:41,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:55:41,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:41,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:55:41,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:55:41,397 INFO L87 Difference]: Start difference. First operand 487 states and 618 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:55:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:42,356 INFO L93 Difference]: Finished difference Result 522 states and 661 transitions. [2022-11-02 20:55:42,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:55:42,356 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2022-11-02 20:55:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:42,358 INFO L225 Difference]: With dead ends: 522 [2022-11-02 20:55:42,358 INFO L226 Difference]: Without dead ends: 490 [2022-11-02 20:55:42,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:55:42,359 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 209 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 2659 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:42,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 2659 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:55:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-11-02 20:55:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 478. [2022-11-02 20:55:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 405 states have (on average 1.2691358024691357) internal successors, (514), 409 states have internal predecessors, (514), 39 states have call successors, (39), 27 states have call predecessors, (39), 33 states have return successors, (50), 41 states have call predecessors, (50), 36 states have call successors, (50) [2022-11-02 20:55:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 603 transitions. [2022-11-02 20:55:42,424 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 603 transitions. Word has length 60 [2022-11-02 20:55:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:42,424 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 603 transitions. [2022-11-02 20:55:42,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:55:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 603 transitions. [2022-11-02 20:55:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:55:42,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:42,425 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] [2022-11-02 20:55:42,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-02 20:55:42,425 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:42,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2088220112, now seen corresponding path program 1 times [2022-11-02 20:55:42,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:42,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973172501] [2022-11-02 20:55:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:42,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:42,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:55:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:42,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:55:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:42,504 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:55:42,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:42,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973172501] [2022-11-02 20:55:42,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973172501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:42,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:42,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:55:42,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678061125] [2022-11-02 20:55:42,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:42,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:55:42,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:42,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:55:42,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:42,506 INFO L87 Difference]: Start difference. First operand 478 states and 603 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 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:55:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:42,840 INFO L93 Difference]: Finished difference Result 517 states and 647 transitions. [2022-11-02 20:55:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:55:42,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 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 58 [2022-11-02 20:55:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:42,841 INFO L225 Difference]: With dead ends: 517 [2022-11-02 20:55:42,842 INFO L226 Difference]: Without dead ends: 480 [2022-11-02 20:55:42,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:55:42,842 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 79 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:42,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1454 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:55:42,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-11-02 20:55:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 468. [2022-11-02 20:55:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 396 states have (on average 1.27020202020202) internal successors, (503), 400 states have internal predecessors, (503), 38 states have call successors, (38), 27 states have call predecessors, (38), 33 states have return successors, (48), 40 states have call predecessors, (48), 35 states have call successors, (48) [2022-11-02 20:55:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 589 transitions. [2022-11-02 20:55:42,937 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 589 transitions. Word has length 58 [2022-11-02 20:55:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:42,938 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 589 transitions. [2022-11-02 20:55:42,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 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:55:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 589 transitions. [2022-11-02 20:55:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:55:42,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:42,939 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:42,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-02 20:55:42,940 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:42,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1074633973, now seen corresponding path program 1 times [2022-11-02 20:55:42,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:42,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779020838] [2022-11-02 20:55:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:42,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:43,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:55:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:43,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:55:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:43,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:55:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:55:43,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:43,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779020838] [2022-11-02 20:55:43,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779020838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:43,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:43,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:55:43,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979101233] [2022-11-02 20:55:43,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:43,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:55:43,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:43,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:55:43,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:43,027 INFO L87 Difference]: Start difference. First operand 468 states and 589 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 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:55:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:43,333 INFO L93 Difference]: Finished difference Result 507 states and 633 transitions. [2022-11-02 20:55:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:55:43,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 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 60 [2022-11-02 20:55:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:43,335 INFO L225 Difference]: With dead ends: 507 [2022-11-02 20:55:43,335 INFO L226 Difference]: Without dead ends: 470 [2022-11-02 20:55:43,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:55:43,336 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 139 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:43,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1237 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:55:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-11-02 20:55:43,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 458. [2022-11-02 20:55:43,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 388 states have (on average 1.2706185567010309) internal successors, (493), 392 states have internal predecessors, (493), 36 states have call successors, (36), 27 states have call predecessors, (36), 33 states have return successors, (46), 38 states have call predecessors, (46), 33 states have call successors, (46) [2022-11-02 20:55:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 575 transitions. [2022-11-02 20:55:43,389 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 575 transitions. Word has length 60 [2022-11-02 20:55:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:43,389 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 575 transitions. [2022-11-02 20:55:43,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 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:55:43,389 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 575 transitions. [2022-11-02 20:55:43,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:55:43,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:43,391 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] [2022-11-02 20:55:43,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-02 20:55:43,391 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:43,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:43,391 INFO L85 PathProgramCache]: Analyzing trace with hash 175179390, now seen corresponding path program 1 times [2022-11-02 20:55:43,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:43,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286815572] [2022-11-02 20:55:43,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:43,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:43,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:55:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:43,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:43,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:55:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:43,594 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:55:43,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:43,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286815572] [2022-11-02 20:55:43,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286815572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:43,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:43,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:55:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582846583] [2022-11-02 20:55:43,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:43,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:55:43,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:43,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:55:43,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:43,596 INFO L87 Difference]: Start difference. First operand 458 states and 575 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:44,685 INFO L93 Difference]: Finished difference Result 798 states and 1014 transitions. [2022-11-02 20:55:44,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:55:44,685 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2022-11-02 20:55:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:44,687 INFO L225 Difference]: With dead ends: 798 [2022-11-02 20:55:44,688 INFO L226 Difference]: Without dead ends: 693 [2022-11-02 20:55:44,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:55:44,689 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 705 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:44,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 2264 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:55:44,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-11-02 20:55:44,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 352. [2022-11-02 20:55:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 294 states have (on average 1.2891156462585034) internal successors, (379), 297 states have internal predecessors, (379), 31 states have call successors, (31), 23 states have call predecessors, (31), 26 states have return successors, (39), 31 states have call predecessors, (39), 29 states have call successors, (39) [2022-11-02 20:55:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 449 transitions. [2022-11-02 20:55:44,747 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 449 transitions. Word has length 60 [2022-11-02 20:55:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:44,747 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 449 transitions. [2022-11-02 20:55:44,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:55:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 449 transitions. [2022-11-02 20:55:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:55:44,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:44,748 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:55:44,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-02 20:55:44,749 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:44,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:44,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1562268864, now seen corresponding path program 1 times [2022-11-02 20:55:44,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:44,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118084778] [2022-11-02 20:55:44,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:44,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:55:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:55:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:44,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:55:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:44,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:44,964 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:55:44,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:44,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118084778] [2022-11-02 20:55:44,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118084778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:44,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:44,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:55:44,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838284778] [2022-11-02 20:55:44,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:44,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:55:44,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:44,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:55:44,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:55:44,972 INFO L87 Difference]: Start difference. First operand 352 states and 449 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:55:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:45,674 INFO L93 Difference]: Finished difference Result 384 states and 486 transitions. [2022-11-02 20:55:45,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:55:45,674 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 62 [2022-11-02 20:55:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:45,676 INFO L225 Difference]: With dead ends: 384 [2022-11-02 20:55:45,676 INFO L226 Difference]: Without dead ends: 362 [2022-11-02 20:55:45,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:55:45,677 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 194 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:45,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1882 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:55:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-11-02 20:55:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 350. [2022-11-02 20:55:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 292 states have (on average 1.2876712328767124) internal successors, (376), 295 states have internal predecessors, (376), 31 states have call successors, (31), 23 states have call predecessors, (31), 26 states have return successors, (39), 31 states have call predecessors, (39), 29 states have call successors, (39) [2022-11-02 20:55:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 446 transitions. [2022-11-02 20:55:45,736 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 446 transitions. Word has length 62 [2022-11-02 20:55:45,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:45,736 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 446 transitions. [2022-11-02 20:55:45,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:55:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 446 transitions. [2022-11-02 20:55:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 20:55:45,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:45,738 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:55:45,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-02 20:55:45,738 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash 224602701, now seen corresponding path program 1 times [2022-11-02 20:55:45,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:45,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891522858] [2022-11-02 20:55:45,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:45,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:45,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:45,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:45,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:46,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:55:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:46,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:55:46,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:46,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891522858] [2022-11-02 20:55:46,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891522858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:46,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:46,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:55:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36546810] [2022-11-02 20:55:46,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:46,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:55:46,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:46,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:55:46,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:55:46,011 INFO L87 Difference]: Start difference. First operand 350 states and 446 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:55:46,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:46,508 INFO L93 Difference]: Finished difference Result 547 states and 704 transitions. [2022-11-02 20:55:46,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:55:46,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2022-11-02 20:55:46,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:46,510 INFO L225 Difference]: With dead ends: 547 [2022-11-02 20:55:46,510 INFO L226 Difference]: Without dead ends: 355 [2022-11-02 20:55:46,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:46,511 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 146 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:46,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1244 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:55:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-02 20:55:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 343. [2022-11-02 20:55:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 285 states have (on average 1.280701754385965) internal successors, (365), 288 states have internal predecessors, (365), 31 states have call successors, (31), 23 states have call predecessors, (31), 26 states have return successors, (39), 31 states have call predecessors, (39), 29 states have call successors, (39) [2022-11-02 20:55:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 435 transitions. [2022-11-02 20:55:46,613 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 435 transitions. Word has length 64 [2022-11-02 20:55:46,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:46,614 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 435 transitions. [2022-11-02 20:55:46,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:55:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 435 transitions. [2022-11-02 20:55:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 20:55:46,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:46,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] [2022-11-02 20:55:46,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-02 20:55:46,616 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:46,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1752625095, now seen corresponding path program 1 times [2022-11-02 20:55:46,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:46,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929790072] [2022-11-02 20:55:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:46,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:55:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:46,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:55:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:55:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:46,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:55:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:46,723 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:55:46,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:46,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929790072] [2022-11-02 20:55:46,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929790072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:46,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:46,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:55:46,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720489043] [2022-11-02 20:55:46,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:46,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:55:46,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:46,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:55:46,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:55:46,726 INFO L87 Difference]: Start difference. First operand 343 states and 435 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 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:55:47,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:47,157 INFO L93 Difference]: Finished difference Result 376 states and 471 transitions. [2022-11-02 20:55:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:55:47,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 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 63 [2022-11-02 20:55:47,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:47,158 INFO L225 Difference]: With dead ends: 376 [2022-11-02 20:55:47,158 INFO L226 Difference]: Without dead ends: 308 [2022-11-02 20:55:47,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:55:47,159 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 95 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:47,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1080 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:55:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-02 20:55:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 302. [2022-11-02 20:55:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 252 states have (on average 1.2738095238095237) internal successors, (321), 255 states have internal predecessors, (321), 25 states have call successors, (25), 21 states have call predecessors, (25), 24 states have return successors, (32), 25 states have call predecessors, (32), 23 states have call successors, (32) [2022-11-02 20:55:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 378 transitions. [2022-11-02 20:55:47,233 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 378 transitions. Word has length 63 [2022-11-02 20:55:47,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:47,233 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 378 transitions. [2022-11-02 20:55:47,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 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:55:47,234 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 378 transitions. [2022-11-02 20:55:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:55:47,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:47,235 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:55:47,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-02 20:55:47,235 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:47,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:47,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1823600415, now seen corresponding path program 1 times [2022-11-02 20:55:47,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:47,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512978542] [2022-11-02 20:55:47,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:47,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:47,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:55:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:55:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:47,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:55:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:55:47,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:47,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512978542] [2022-11-02 20:55:47,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512978542] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:47,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994332164] [2022-11-02 20:55:47,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:47,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:47,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:47,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:47,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:55:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:47,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:55:47,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:47,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:55:47,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994332164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:47,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:55:47,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-02 20:55:47,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338928085] [2022-11-02 20:55:47,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:47,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:55:47,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:47,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:55:47,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:47,681 INFO L87 Difference]: Start difference. First operand 302 states and 378 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 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:55:47,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:47,850 INFO L93 Difference]: Finished difference Result 325 states and 400 transitions. [2022-11-02 20:55:47,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:55:47,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 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 62 [2022-11-02 20:55:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:47,851 INFO L225 Difference]: With dead ends: 325 [2022-11-02 20:55:47,851 INFO L226 Difference]: Without dead ends: 264 [2022-11-02 20:55:47,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:47,854 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:47,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 717 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:55:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-02 20:55:47,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2022-11-02 20:55:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 220 states have (on average 1.3) internal successors, (286), 222 states have internal predecessors, (286), 22 states have call successors, (22), 19 states have call predecessors, (22), 21 states have return successors, (28), 22 states have call predecessors, (28), 20 states have call successors, (28) [2022-11-02 20:55:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 336 transitions. [2022-11-02 20:55:47,931 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 336 transitions. Word has length 62 [2022-11-02 20:55:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:47,931 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 336 transitions. [2022-11-02 20:55:47,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 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:55:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 336 transitions. [2022-11-02 20:55:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 20:55:47,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:47,933 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:55:47,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:48,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-11-02 20:55:48,146 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:48,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:48,147 INFO L85 PathProgramCache]: Analyzing trace with hash 585691284, now seen corresponding path program 1 times [2022-11-02 20:55:48,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:48,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552804769] [2022-11-02 20:55:48,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:48,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:55:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:55:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,339 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:55:48,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:48,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552804769] [2022-11-02 20:55:48,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552804769] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:48,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:48,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:55:48,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769890671] [2022-11-02 20:55:48,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:48,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:55:48,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:48,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:55:48,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:48,342 INFO L87 Difference]: Start difference. First operand 264 states and 336 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:55:48,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:48,736 INFO L93 Difference]: Finished difference Result 455 states and 585 transitions. [2022-11-02 20:55:48,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:55:48,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2022-11-02 20:55:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:48,737 INFO L225 Difference]: With dead ends: 455 [2022-11-02 20:55:48,738 INFO L226 Difference]: Without dead ends: 270 [2022-11-02 20:55:48,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:55:48,739 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 244 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:48,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 730 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:55:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-02 20:55:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 264. [2022-11-02 20:55:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 220 states have (on average 1.2954545454545454) internal successors, (285), 222 states have internal predecessors, (285), 22 states have call successors, (22), 19 states have call predecessors, (22), 21 states have return successors, (28), 22 states have call predecessors, (28), 20 states have call successors, (28) [2022-11-02 20:55:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 335 transitions. [2022-11-02 20:55:48,819 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 335 transitions. Word has length 68 [2022-11-02 20:55:48,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:48,819 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 335 transitions. [2022-11-02 20:55:48,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:55:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 335 transitions. [2022-11-02 20:55:48,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-02 20:55:48,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:48,820 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] [2022-11-02 20:55:48,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-02 20:55:48,821 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:48,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:48,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1800918031, now seen corresponding path program 1 times [2022-11-02 20:55:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:48,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286172670] [2022-11-02 20:55:48,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:48,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:55:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:55:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:48,967 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:55:48,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:48,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286172670] [2022-11-02 20:55:48,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286172670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:48,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:48,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:55:48,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575243062] [2022-11-02 20:55:48,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:48,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:55:48,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:48,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:55:48,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:55:48,969 INFO L87 Difference]: Start difference. First operand 264 states and 335 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:55:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:49,246 INFO L93 Difference]: Finished difference Result 343 states and 431 transitions. [2022-11-02 20:55:49,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:55:49,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2022-11-02 20:55:49,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:49,248 INFO L225 Difference]: With dead ends: 343 [2022-11-02 20:55:49,248 INFO L226 Difference]: Without dead ends: 216 [2022-11-02 20:55:49,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:55:49,249 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 72 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:49,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 660 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:55:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-02 20:55:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 175. [2022-11-02 20:55:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 146 states have internal predecessors, (179), 15 states have call successors, (15), 13 states have call predecessors, (15), 14 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-02 20:55:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2022-11-02 20:55:49,291 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 70 [2022-11-02 20:55:49,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:49,291 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2022-11-02 20:55:49,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:55:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2022-11-02 20:55:49,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-02 20:55:49,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:49,293 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, 1, 1, 1, 1] [2022-11-02 20:55:49,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-02 20:55:49,293 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:49,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:49,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1069664757, now seen corresponding path program 1 times [2022-11-02 20:55:49,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:49,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689994684] [2022-11-02 20:55:49,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:49,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:55:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:55:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:55:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,445 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:55:49,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:49,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689994684] [2022-11-02 20:55:49,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689994684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:49,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:49,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:55:49,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062558275] [2022-11-02 20:55:49,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:49,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:55:49,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:49,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:55:49,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:49,447 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:55:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:49,797 INFO L93 Difference]: Finished difference Result 224 states and 267 transitions. [2022-11-02 20:55:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:55:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 84 [2022-11-02 20:55:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:49,798 INFO L225 Difference]: With dead ends: 224 [2022-11-02 20:55:49,799 INFO L226 Difference]: Without dead ends: 185 [2022-11-02 20:55:49,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:55:49,799 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 174 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:49,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 806 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:55:49,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-02 20:55:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 173. [2022-11-02 20:55:49,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 143 states have (on average 1.2027972027972027) internal successors, (172), 144 states have internal predecessors, (172), 15 states have call successors, (15), 13 states have call predecessors, (15), 14 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2022-11-02 20:55:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2022-11-02 20:55:49,841 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 84 [2022-11-02 20:55:49,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:49,842 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2022-11-02 20:55:49,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:55:49,842 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2022-11-02 20:55:49,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-02 20:55:49,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:49,843 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, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:49,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-11-02 20:55:49,843 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:49,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:49,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1463540250, now seen corresponding path program 1 times [2022-11-02 20:55:49,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:49,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559674752] [2022-11-02 20:55:49,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:49,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:55:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:55:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:55:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,005 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:55:50,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:50,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559674752] [2022-11-02 20:55:50,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559674752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:50,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:50,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:55:50,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808303259] [2022-11-02 20:55:50,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:50,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:55:50,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:50,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:55:50,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:50,008 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:55:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:50,334 INFO L93 Difference]: Finished difference Result 201 states and 234 transitions. [2022-11-02 20:55:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:55:50,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2022-11-02 20:55:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:50,336 INFO L225 Difference]: With dead ends: 201 [2022-11-02 20:55:50,336 INFO L226 Difference]: Without dead ends: 153 [2022-11-02 20:55:50,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:55:50,337 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 131 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:50,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 803 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:55:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-02 20:55:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2022-11-02 20:55:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.1637931034482758) internal successors, (135), 117 states have internal predecessors, (135), 12 states have call successors, (12), 11 states have call predecessors, (12), 12 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-02 20:55:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2022-11-02 20:55:50,367 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 86 [2022-11-02 20:55:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:50,367 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2022-11-02 20:55:50,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:55:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2022-11-02 20:55:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:55:50,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:50,368 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:50,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-11-02 20:55:50,368 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:50,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:50,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1416419599, now seen corresponding path program 1 times [2022-11-02 20:55:50,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:50,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009347210] [2022-11-02 20:55:50,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:50,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:55:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:55:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:55:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:55:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:55:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:55:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:55:50,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:50,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009347210] [2022-11-02 20:55:50,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009347210] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:50,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277022201] [2022-11-02 20:55:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:50,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:50,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:50,513 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:50,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:55:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:50,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:55:50,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:55:50,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:55:50,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277022201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:50,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:55:50,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-02 20:55:50,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106660936] [2022-11-02 20:55:50,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:50,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:50,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:50,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:50,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:50,772 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:55:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:50,822 INFO L93 Difference]: Finished difference Result 205 states and 238 transitions. [2022-11-02 20:55:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:50,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2022-11-02 20:55:50,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:50,823 INFO L225 Difference]: With dead ends: 205 [2022-11-02 20:55:50,823 INFO L226 Difference]: Without dead ends: 170 [2022-11-02 20:55:50,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:50,824 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 18 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:50,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 232 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:55:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-02 20:55:50,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2022-11-02 20:55:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.152) internal successors, (144), 125 states have internal predecessors, (144), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-02 20:55:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 172 transitions. [2022-11-02 20:55:50,858 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 172 transitions. Word has length 103 [2022-11-02 20:55:50,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:50,859 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 172 transitions. [2022-11-02 20:55:50,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:55:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 172 transitions. [2022-11-02 20:55:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:55:50,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:50,860 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:50,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:51,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable71 [2022-11-02 20:55:51,074 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash -479392400, now seen corresponding path program 1 times [2022-11-02 20:55:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:51,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731470100] [2022-11-02 20:55:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:55:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:55:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:55:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:55:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:55:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:55:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:55:51,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:51,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731470100] [2022-11-02 20:55:51,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731470100] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:51,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079876527] [2022-11-02 20:55:51,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:51,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:51,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:51,243 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:51,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:55:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:55:51,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:55:51,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:55:51,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079876527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:51,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:55:51,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-02 20:55:51,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097491230] [2022-11-02 20:55:51,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:51,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:51,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:51,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:51,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:51,473 INFO L87 Difference]: Start difference. First operand 151 states and 172 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:55:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:51,573 INFO L93 Difference]: Finished difference Result 203 states and 228 transitions. [2022-11-02 20:55:51,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:51,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2022-11-02 20:55:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:51,575 INFO L225 Difference]: With dead ends: 203 [2022-11-02 20:55:51,575 INFO L226 Difference]: Without dead ends: 170 [2022-11-02 20:55:51,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:51,576 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 21 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:51,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 255 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:55:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-02 20:55:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2022-11-02 20:55:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.12) internal successors, (140), 125 states have internal predecessors, (140), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-02 20:55:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2022-11-02 20:55:51,616 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 103 [2022-11-02 20:55:51,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:51,617 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2022-11-02 20:55:51,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:55:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2022-11-02 20:55:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:55:51,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:51,618 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:51,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:55:51,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:51,846 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:51,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:51,847 INFO L85 PathProgramCache]: Analyzing trace with hash 506808435, now seen corresponding path program 1 times [2022-11-02 20:55:51,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:51,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41312814] [2022-11-02 20:55:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:51,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:55:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:55:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:51,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:55:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:55:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:55:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:55:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:55:52,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:52,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41312814] [2022-11-02 20:55:52,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41312814] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:55:52,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924478210] [2022-11-02 20:55:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:52,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:52,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:55:52,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:55:52,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:55:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:55:52,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:55:52,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:55:52,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924478210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:52,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:55:52,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-11-02 20:55:52,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961656879] [2022-11-02 20:55:52,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:52,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:55:52,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:52,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:55:52,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:55:52,306 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:55:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:52,448 INFO L93 Difference]: Finished difference Result 283 states and 318 transitions. [2022-11-02 20:55:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:55:52,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2022-11-02 20:55:52,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:52,449 INFO L225 Difference]: With dead ends: 283 [2022-11-02 20:55:52,450 INFO L226 Difference]: Without dead ends: 151 [2022-11-02 20:55:52,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:55:52,451 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 144 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:52,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 214 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:55:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-02 20:55:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-02 20:55:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.104) internal successors, (138), 125 states have internal predecessors, (138), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-02 20:55:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2022-11-02 20:55:52,487 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 103 [2022-11-02 20:55:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:52,488 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2022-11-02 20:55:52,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 20:55:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2022-11-02 20:55:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 20:55:52,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:52,489 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:52,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-02 20:55:52,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_153efd45-9994-49e4-9043-6ad024d8307a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:55:52,714 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:52,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:52,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1772033550, now seen corresponding path program 1 times [2022-11-02 20:55:52,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:52,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977919881] [2022-11-02 20:55:52,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:52,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:55:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:55:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:55:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:55:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 20:55:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:55:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:55:52,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:52,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977919881] [2022-11-02 20:55:52,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977919881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:52,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:52,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:55:52,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316497014] [2022-11-02 20:55:52,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:52,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:55:52,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:52,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:55:52,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:52,921 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:55:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:53,360 INFO L93 Difference]: Finished difference Result 300 states and 328 transitions. [2022-11-02 20:55:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:55:53,361 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2022-11-02 20:55:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:53,362 INFO L225 Difference]: With dead ends: 300 [2022-11-02 20:55:53,362 INFO L226 Difference]: Without dead ends: 151 [2022-11-02 20:55:53,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:55:53,363 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 167 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:53,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 644 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:55:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-02 20:55:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-02 20:55:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.096) internal successors, (137), 125 states have internal predecessors, (137), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-11-02 20:55:53,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2022-11-02 20:55:53,400 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 104 [2022-11-02 20:55:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:53,401 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2022-11-02 20:55:53,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:55:53,401 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2022-11-02 20:55:53,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 20:55:53,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:53,402 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:53,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-11-02 20:55:53,402 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:53,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:53,403 INFO L85 PathProgramCache]: Analyzing trace with hash 125463216, now seen corresponding path program 1 times [2022-11-02 20:55:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:53,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239691784] [2022-11-02 20:55:53,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:53,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:55:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:55:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:55:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:55:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 20:55:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:55:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:55:53,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:53,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239691784] [2022-11-02 20:55:53,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239691784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:53,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:53,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:55:53,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31254204] [2022-11-02 20:55:53,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:53,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:55:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:53,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:55:53,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:55:53,652 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:55:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:54,108 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-11-02 20:55:54,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:55:54,109 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2022-11-02 20:55:54,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:54,110 INFO L225 Difference]: With dead ends: 151 [2022-11-02 20:55:54,110 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:55:54,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:55:54,111 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 151 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:54,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 619 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:55:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:55:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:55:54,112 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:55:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:55:54,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2022-11-02 20:55:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:54,112 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:55:54,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:55:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:55:54,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:55:54,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:55:54,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-11-02 20:55:54,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.