./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-1.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_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/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_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/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_407629ac-6c6f-4336-ab09-a1f135eee526/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 b9a657fa9aacca0974ed9e42f1311e36e1c5af368a54222ebad4a487f8951064 --- 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:26:35,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:26:35,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:26:35,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:26:35,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:26:35,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:26:35,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:26:35,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:26:35,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:26:35,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:26:35,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:26:35,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:26:35,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:26:35,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:26:35,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:26:35,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:26:35,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:26:35,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:26:35,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:26:35,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:26:35,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:26:35,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:26:35,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:26:35,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:26:35,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:26:35,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:26:35,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:26:35,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:26:35,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:26:35,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:26:35,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:26:35,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:26:35,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:26:35,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:26:35,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:26:35,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:26:35,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:26:35,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:26:35,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:26:35,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:26:35,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:26:35,820 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:26:35,859 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:26:35,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:26:35,865 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:26:35,865 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:26:35,866 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:26:35,866 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:26:35,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:26:35,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:26:35,868 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:26:35,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:26:35,869 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:26:35,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:26:35,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:26:35,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:26:35,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:26:35,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:26:35,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:26:35,871 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:26:35,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:26:35,871 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:26:35,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:26:35,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:26:35,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:26:35,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:26:35,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:26:35,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:26:35,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:26:35,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:26:35,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:26:35,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:26:35,874 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:26:35,874 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:26:35,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:26:35,875 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_407629ac-6c6f-4336-ab09-a1f135eee526/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_407629ac-6c6f-4336-ab09-a1f135eee526/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 -> b9a657fa9aacca0974ed9e42f1311e36e1c5af368a54222ebad4a487f8951064 [2022-11-02 20:26:36,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:26:36,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:26:36,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:26:36,239 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:26:36,241 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:26:36,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-1.c [2022-11-02 20:26:36,325 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/data/a9d62a504/19babbc40b574cf6a548ad86a0bab85c/FLAG1ef788920 [2022-11-02 20:26:36,920 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:26:36,924 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-1.c [2022-11-02 20:26:36,940 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/data/a9d62a504/19babbc40b574cf6a548ad86a0bab85c/FLAG1ef788920 [2022-11-02 20:26:37,168 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/data/a9d62a504/19babbc40b574cf6a548ad86a0bab85c [2022-11-02 20:26:37,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:26:37,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:26:37,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:26:37,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:26:37,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:26:37,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:26:37" (1/1) ... [2022-11-02 20:26:37,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519c4625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:37, skipping insertion in model container [2022-11-02 20:26:37,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:26:37" (1/1) ... [2022-11-02 20:26:37,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:26:37,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:26:37,749 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_407629ac-6c6f-4336-ab09-a1f135eee526/sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-1.c[73581,73594] [2022-11-02 20:26:37,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:26:37,788 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:26:37,923 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_407629ac-6c6f-4336-ab09-a1f135eee526/sv-benchmarks/c/openssl/s3_srvr.blast.10.i.cil-1.c[73581,73594] [2022-11-02 20:26:37,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:26:37,942 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:26:37,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:37 WrapperNode [2022-11-02 20:26:37,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:26:37,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:26:37,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:26:37,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:26:37,952 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:26:37" (1/1) ... [2022-11-02 20:26:37,973 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:26:37" (1/1) ... [2022-11-02 20:26:38,017 INFO L138 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 788 [2022-11-02 20:26:38,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:26:38,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:26:38,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:26:38,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:26:38,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:37" (1/1) ... [2022-11-02 20:26:38,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:37" (1/1) ... [2022-11-02 20:26:38,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:37" (1/1) ... [2022-11-02 20:26:38,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:37" (1/1) ... [2022-11-02 20:26:38,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:37" (1/1) ... [2022-11-02 20:26:38,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:37" (1/1) ... [2022-11-02 20:26:38,096 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:37" (1/1) ... [2022-11-02 20:26:38,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:37" (1/1) ... [2022-11-02 20:26:38,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:26:38,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:26:38,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:26:38,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:26:38,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:37" (1/1) ... [2022-11-02 20:26:38,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:26:38,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:26:38,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:26:38,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:26:38,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:26:38,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:26:38,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:26:38,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:26:38,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:26:38,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:26:38,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:26:38,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:26:38,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:26:38,375 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:26:38,378 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:26:38,396 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:26:40,107 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-11-02 20:26:40,107 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-11-02 20:26:40,108 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:26:40,121 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:26:40,121 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:26:40,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:26:40 BoogieIcfgContainer [2022-11-02 20:26:40,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:26:40,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:26:40,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:26:40,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:26:40,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:26:37" (1/3) ... [2022-11-02 20:26:40,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e24d517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:26:40, skipping insertion in model container [2022-11-02 20:26:40,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:37" (2/3) ... [2022-11-02 20:26:40,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e24d517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:26:40, skipping insertion in model container [2022-11-02 20:26:40,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:26:40" (3/3) ... [2022-11-02 20:26:40,136 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-1.c [2022-11-02 20:26:40,155 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:26:40,155 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:26:40,228 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:26:40,237 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;@1805ca57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:26:40,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:26:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 146 states have (on average 1.7123287671232876) internal successors, (250), 147 states have internal predecessors, (250), 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:26:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:26:40,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:40,276 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:26:40,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:26:40,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:40,286 INFO L85 PathProgramCache]: Analyzing trace with hash 917223054, now seen corresponding path program 1 times [2022-11-02 20:26:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:40,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629996385] [2022-11-02 20:26:40,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:40,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:41,585 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:26:41,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:41,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629996385] [2022-11-02 20:26:41,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629996385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:41,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:41,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:41,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933700764] [2022-11-02 20:26:41,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:41,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:41,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:41,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:41,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:41,647 INFO L87 Difference]: Start difference. First operand has 148 states, 146 states have (on average 1.7123287671232876) internal successors, (250), 147 states have internal predecessors, (250), 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) Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:26:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:43,327 INFO L93 Difference]: Finished difference Result 415 states and 704 transitions. [2022-11-02 20:26:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:26:43,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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) Word has length 44 [2022-11-02 20:26:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:43,341 INFO L225 Difference]: With dead ends: 415 [2022-11-02 20:26:43,342 INFO L226 Difference]: Without dead ends: 252 [2022-11-02 20:26:43,345 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:26:43,349 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 152 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:43,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 429 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:26:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-02 20:26:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 175. [2022-11-02 20:26:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.603448275862069) internal successors, (279), 174 states have internal predecessors, (279), 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:26:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 279 transitions. [2022-11-02 20:26:43,403 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 279 transitions. Word has length 44 [2022-11-02 20:26:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:43,404 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 279 transitions. [2022-11-02 20:26:43,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:26:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 279 transitions. [2022-11-02 20:26:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:26:43,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:43,407 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:26:43,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:26:43,408 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:26:43,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:43,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1833262993, now seen corresponding path program 1 times [2022-11-02 20:26:43,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:43,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079155721] [2022-11-02 20:26:43,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:43,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:43,854 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:26:43,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:43,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079155721] [2022-11-02 20:26:43,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079155721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:43,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:43,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:43,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930485262] [2022-11-02 20:26:43,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:43,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:43,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:43,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:43,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:43,858 INFO L87 Difference]: Start difference. First operand 175 states and 279 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:26:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:44,793 INFO L93 Difference]: Finished difference Result 368 states and 585 transitions. [2022-11-02 20:26:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:26:44,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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) Word has length 45 [2022-11-02 20:26:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:44,796 INFO L225 Difference]: With dead ends: 368 [2022-11-02 20:26:44,796 INFO L226 Difference]: Without dead ends: 203 [2022-11-02 20:26:44,797 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:26:44,798 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 22 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:44,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 457 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:26:44,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-02 20:26:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 186. [2022-11-02 20:26:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6108108108108108) internal successors, (298), 185 states have internal predecessors, (298), 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:26:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2022-11-02 20:26:44,814 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 298 transitions. Word has length 45 [2022-11-02 20:26:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:44,815 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 298 transitions. [2022-11-02 20:26:44,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:26:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 298 transitions. [2022-11-02 20:26:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:26:44,817 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:44,817 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] [2022-11-02 20:26:44,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:26:44,817 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:26:44,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:44,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1347538286, now seen corresponding path program 1 times [2022-11-02 20:26:44,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:44,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582789431] [2022-11-02 20:26:44,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:45,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:45,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582789431] [2022-11-02 20:26:45,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582789431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:45,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:45,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936485003] [2022-11-02 20:26:45,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:45,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:45,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:45,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:45,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:45,383 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:26:46,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:26:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:47,066 INFO L93 Difference]: Finished difference Result 506 states and 815 transitions. [2022-11-02 20:26:47,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:26:47,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) Word has length 58 [2022-11-02 20:26:47,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:47,070 INFO L225 Difference]: With dead ends: 506 [2022-11-02 20:26:47,070 INFO L226 Difference]: Without dead ends: 341 [2022-11-02 20:26:47,071 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:26:47,072 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 141 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:47,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 598 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:26:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-02 20:26:47,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 218. [2022-11-02 20:26:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.608294930875576) internal successors, (349), 217 states have internal predecessors, (349), 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:26:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 349 transitions. [2022-11-02 20:26:47,094 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 349 transitions. Word has length 58 [2022-11-02 20:26:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:47,094 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 349 transitions. [2022-11-02 20:26:47,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:26:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 349 transitions. [2022-11-02 20:26:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:26:47,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:47,097 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:47,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:26:47,098 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:26:47,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:47,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1361269889, now seen corresponding path program 1 times [2022-11-02 20:26:47,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:47,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555692028] [2022-11-02 20:26:47,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:47,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:47,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:47,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555692028] [2022-11-02 20:26:47,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555692028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:47,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:47,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:47,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566674413] [2022-11-02 20:26:47,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:47,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:47,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:47,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:47,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:47,569 INFO L87 Difference]: Start difference. First operand 218 states and 349 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:26:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:48,647 INFO L93 Difference]: Finished difference Result 514 states and 818 transitions. [2022-11-02 20:26:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:26:48,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) Word has length 59 [2022-11-02 20:26:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:48,649 INFO L225 Difference]: With dead ends: 514 [2022-11-02 20:26:48,649 INFO L226 Difference]: Without dead ends: 317 [2022-11-02 20:26:48,650 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:26:48,651 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 146 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:48,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 322 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:26:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-02 20:26:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 218. [2022-11-02 20:26:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 217 states have internal predecessors, (345), 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:26:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 345 transitions. [2022-11-02 20:26:48,667 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 345 transitions. Word has length 59 [2022-11-02 20:26:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:48,667 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 345 transitions. [2022-11-02 20:26:48,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:26:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 345 transitions. [2022-11-02 20:26:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:26:48,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:48,670 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] [2022-11-02 20:26:48,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:26:48,671 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:26:48,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:48,671 INFO L85 PathProgramCache]: Analyzing trace with hash 525633555, now seen corresponding path program 1 times [2022-11-02 20:26:48,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:48,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574441353] [2022-11-02 20:26:48,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:49,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:49,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:49,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574441353] [2022-11-02 20:26:49,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574441353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:49,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:49,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:49,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611957872] [2022-11-02 20:26:49,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:49,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:49,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:49,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:49,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:49,090 INFO L87 Difference]: Start difference. First operand 218 states and 345 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:26:50,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:50,207 INFO L93 Difference]: Finished difference Result 431 states and 679 transitions. [2022-11-02 20:26:50,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:26:50,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) Word has length 59 [2022-11-02 20:26:50,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:50,209 INFO L225 Difference]: With dead ends: 431 [2022-11-02 20:26:50,209 INFO L226 Difference]: Without dead ends: 234 [2022-11-02 20:26:50,210 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:26:50,211 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 26 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:50,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 461 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:26:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-02 20:26:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 218. [2022-11-02 20:26:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 217 states have internal predecessors, (344), 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:26:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 344 transitions. [2022-11-02 20:26:50,221 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 344 transitions. Word has length 59 [2022-11-02 20:26:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:50,221 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 344 transitions. [2022-11-02 20:26:50,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:26:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 344 transitions. [2022-11-02 20:26:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:26:50,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:50,224 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:50,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:26:50,224 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:26:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash -326483222, now seen corresponding path program 1 times [2022-11-02 20:26:50,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:50,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904624638] [2022-11-02 20:26:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:50,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:50,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:50,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904624638] [2022-11-02 20:26:50,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904624638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:50,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:50,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:50,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516144591] [2022-11-02 20:26:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:50,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:50,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:50,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:50,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:50,608 INFO L87 Difference]: Start difference. First operand 218 states and 344 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:26:51,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:51,732 INFO L93 Difference]: Finished difference Result 430 states and 677 transitions. [2022-11-02 20:26:51,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:26:51,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) Word has length 59 [2022-11-02 20:26:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:51,734 INFO L225 Difference]: With dead ends: 430 [2022-11-02 20:26:51,734 INFO L226 Difference]: Without dead ends: 233 [2022-11-02 20:26:51,735 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:26:51,735 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 19 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:51,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 463 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:26:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-02 20:26:51,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 218. [2022-11-02 20:26:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.5806451612903225) internal successors, (343), 217 states have internal predecessors, (343), 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:26:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 343 transitions. [2022-11-02 20:26:51,744 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 343 transitions. Word has length 59 [2022-11-02 20:26:51,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:51,745 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 343 transitions. [2022-11-02 20:26:51,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:26:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 343 transitions. [2022-11-02 20:26:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:26:51,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:51,746 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:51,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:26:51,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:26:51,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:51,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1965263786, now seen corresponding path program 1 times [2022-11-02 20:26:51,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:51,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579234453] [2022-11-02 20:26:51,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:51,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:52,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:52,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579234453] [2022-11-02 20:26:52,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579234453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:52,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:52,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:52,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505917481] [2022-11-02 20:26:52,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:52,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:52,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:52,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:52,120 INFO L87 Difference]: Start difference. First operand 218 states and 343 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:26:53,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:26:53,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:53,758 INFO L93 Difference]: Finished difference Result 514 states and 809 transitions. [2022-11-02 20:26:53,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:26:53,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) Word has length 59 [2022-11-02 20:26:53,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:53,760 INFO L225 Difference]: With dead ends: 514 [2022-11-02 20:26:53,760 INFO L226 Difference]: Without dead ends: 317 [2022-11-02 20:26:53,761 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:26:53,761 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 139 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:53,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 322 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:26:53,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-02 20:26:53,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 219. [2022-11-02 20:26:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.5688073394495412) internal successors, (342), 218 states have internal predecessors, (342), 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:26:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 342 transitions. [2022-11-02 20:26:53,776 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 342 transitions. Word has length 59 [2022-11-02 20:26:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:53,778 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 342 transitions. [2022-11-02 20:26:53,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:26:53,778 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 342 transitions. [2022-11-02 20:26:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:26:53,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:53,781 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:26:53,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:26:53,781 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:26:53,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1487157225, now seen corresponding path program 1 times [2022-11-02 20:26:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:53,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728129375] [2022-11-02 20:26:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:54,126 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:26:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:54,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728129375] [2022-11-02 20:26:54,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728129375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:54,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:54,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027704801] [2022-11-02 20:26:54,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:54,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:54,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:54,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:54,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:54,130 INFO L87 Difference]: Start difference. First operand 219 states and 342 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:26:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:54,775 INFO L93 Difference]: Finished difference Result 430 states and 673 transitions. [2022-11-02 20:26:54,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:26:54,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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) Word has length 60 [2022-11-02 20:26:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:54,777 INFO L225 Difference]: With dead ends: 430 [2022-11-02 20:26:54,777 INFO L226 Difference]: Without dead ends: 232 [2022-11-02 20:26:54,778 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:26:54,779 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 22 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:54,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 467 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:26:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-02 20:26:54,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 219. [2022-11-02 20:26:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.5642201834862386) internal successors, (341), 218 states have internal predecessors, (341), 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:26:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 341 transitions. [2022-11-02 20:26:54,794 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 341 transitions. Word has length 60 [2022-11-02 20:26:54,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:54,795 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 341 transitions. [2022-11-02 20:26:54,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:26:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 341 transitions. [2022-11-02 20:26:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:26:54,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:54,796 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:26:54,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:26:54,796 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:26:54,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:54,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1805600728, now seen corresponding path program 1 times [2022-11-02 20:26:54,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:54,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214810800] [2022-11-02 20:26:54,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:54,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:55,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:55,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214810800] [2022-11-02 20:26:55,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214810800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:55,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:55,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:55,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505451801] [2022-11-02 20:26:55,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:55,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:55,185 INFO L87 Difference]: Start difference. First operand 219 states and 341 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:26:56,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:26:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:57,048 INFO L93 Difference]: Finished difference Result 430 states and 672 transitions. [2022-11-02 20:26:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:26:57,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) Word has length 61 [2022-11-02 20:26:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:57,050 INFO L225 Difference]: With dead ends: 430 [2022-11-02 20:26:57,050 INFO L226 Difference]: Without dead ends: 232 [2022-11-02 20:26:57,050 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:26:57,051 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 20 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:57,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 467 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 20:26:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-02 20:26:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 219. [2022-11-02 20:26:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.5596330275229358) internal successors, (340), 218 states have internal predecessors, (340), 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:26:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 340 transitions. [2022-11-02 20:26:57,060 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 340 transitions. Word has length 61 [2022-11-02 20:26:57,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:57,061 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 340 transitions. [2022-11-02 20:26:57,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:26:57,061 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 340 transitions. [2022-11-02 20:26:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:26:57,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:57,062 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:26:57,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:26:57,063 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:26:57,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:57,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2066644860, now seen corresponding path program 1 times [2022-11-02 20:26:57,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:57,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618698637] [2022-11-02 20:26:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:57,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:57,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618698637] [2022-11-02 20:26:57,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618698637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:57,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:57,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:57,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137995291] [2022-11-02 20:26:57,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:57,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:57,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:57,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:57,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:57,411 INFO L87 Difference]: Start difference. First operand 219 states and 340 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:26:58,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:58,158 INFO L93 Difference]: Finished difference Result 420 states and 658 transitions. [2022-11-02 20:26:58,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:26:58,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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) Word has length 62 [2022-11-02 20:26:58,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:58,160 INFO L225 Difference]: With dead ends: 420 [2022-11-02 20:26:58,160 INFO L226 Difference]: Without dead ends: 222 [2022-11-02 20:26:58,161 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:26:58,161 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 11 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:58,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 481 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:26:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-02 20:26:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2022-11-02 20:26:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.555045871559633) internal successors, (339), 218 states have internal predecessors, (339), 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:26:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 339 transitions. [2022-11-02 20:26:58,170 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 339 transitions. Word has length 62 [2022-11-02 20:26:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:58,170 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 339 transitions. [2022-11-02 20:26:58,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:26:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 339 transitions. [2022-11-02 20:26:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:26:58,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:58,172 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:58,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:26:58,172 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:26:58,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:58,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1454771428, now seen corresponding path program 1 times [2022-11-02 20:26:58,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:58,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408522949] [2022-11-02 20:26:58,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:58,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:58,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:58,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408522949] [2022-11-02 20:26:58,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408522949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:58,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:58,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:58,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305752807] [2022-11-02 20:26:58,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:58,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:58,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:58,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:58,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:58,494 INFO L87 Difference]: Start difference. First operand 219 states and 339 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:26:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:59,499 INFO L93 Difference]: Finished difference Result 515 states and 803 transitions. [2022-11-02 20:26:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:26:59,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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) Word has length 62 [2022-11-02 20:26:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:59,501 INFO L225 Difference]: With dead ends: 515 [2022-11-02 20:26:59,501 INFO L226 Difference]: Without dead ends: 317 [2022-11-02 20:26:59,502 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:26:59,502 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 116 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:59,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 340 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:26:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-02 20:26:59,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 242. [2022-11-02 20:26:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 241 states have internal predecessors, (384), 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:26:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 384 transitions. [2022-11-02 20:26:59,515 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 384 transitions. Word has length 62 [2022-11-02 20:26:59,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:59,515 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 384 transitions. [2022-11-02 20:26:59,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:26:59,516 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 384 transitions. [2022-11-02 20:26:59,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-02 20:26:59,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:59,517 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:59,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:26:59,517 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:26:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:59,518 INFO L85 PathProgramCache]: Analyzing trace with hash 413039593, now seen corresponding path program 1 times [2022-11-02 20:26:59,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:59,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62093238] [2022-11-02 20:26:59,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:59,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:59,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:59,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62093238] [2022-11-02 20:26:59,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62093238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:59,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:59,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:59,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106969053] [2022-11-02 20:26:59,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:59,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:59,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:59,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:59,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:59,869 INFO L87 Difference]: Start difference. First operand 242 states and 384 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:27:01,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:27:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:02,367 INFO L93 Difference]: Finished difference Result 614 states and 983 transitions. [2022-11-02 20:27:02,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:02,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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) Word has length 90 [2022-11-02 20:27:02,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:02,370 INFO L225 Difference]: With dead ends: 614 [2022-11-02 20:27:02,370 INFO L226 Difference]: Without dead ends: 393 [2022-11-02 20:27:02,370 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:27:02,371 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 122 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:02,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 332 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 254 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:27:02,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-11-02 20:27:02,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 306. [2022-11-02 20:27:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.619672131147541) internal successors, (494), 305 states have internal predecessors, (494), 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:27:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 494 transitions. [2022-11-02 20:27:02,382 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 494 transitions. Word has length 90 [2022-11-02 20:27:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:02,382 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 494 transitions. [2022-11-02 20:27:02,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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:27:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 494 transitions. [2022-11-02 20:27:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 20:27:02,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:02,384 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:27:02,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:27:02,384 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:02,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:02,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1796798992, now seen corresponding path program 1 times [2022-11-02 20:27:02,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:02,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799292858] [2022-11-02 20:27:02,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:27:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:02,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799292858] [2022-11-02 20:27:02,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799292858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:02,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:02,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682026484] [2022-11-02 20:27:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:02,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:02,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:02,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:02,799 INFO L87 Difference]: Start difference. First operand 306 states and 494 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:27:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:03,905 INFO L93 Difference]: Finished difference Result 706 states and 1136 transitions. [2022-11-02 20:27:03,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:03,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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) Word has length 95 [2022-11-02 20:27:03,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:03,908 INFO L225 Difference]: With dead ends: 706 [2022-11-02 20:27:03,908 INFO L226 Difference]: Without dead ends: 421 [2022-11-02 20:27:03,909 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:27:03,909 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 118 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:03,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 320 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:27:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-11-02 20:27:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 343. [2022-11-02 20:27:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.628654970760234) internal successors, (557), 342 states have internal predecessors, (557), 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:27:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 557 transitions. [2022-11-02 20:27:03,923 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 557 transitions. Word has length 95 [2022-11-02 20:27:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:03,924 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 557 transitions. [2022-11-02 20:27:03,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:27:03,924 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 557 transitions. [2022-11-02 20:27:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-02 20:27:03,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:03,926 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:03,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:27:03,926 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:03,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:03,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2019754981, now seen corresponding path program 1 times [2022-11-02 20:27:03,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:03,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379775613] [2022-11-02 20:27:03,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:03,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:27:04,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:04,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379775613] [2022-11-02 20:27:04,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379775613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:04,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:04,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:04,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110859482] [2022-11-02 20:27:04,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:04,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:04,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:04,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:04,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:04,274 INFO L87 Difference]: Start difference. First operand 343 states and 557 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:27:06,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:27:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:06,489 INFO L93 Difference]: Finished difference Result 705 states and 1149 transitions. [2022-11-02 20:27:06,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:06,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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) Word has length 96 [2022-11-02 20:27:06,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:06,491 INFO L225 Difference]: With dead ends: 705 [2022-11-02 20:27:06,491 INFO L226 Difference]: Without dead ends: 383 [2022-11-02 20:27:06,492 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:27:06,492 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 31 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:06,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 485 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-02 20:27:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-11-02 20:27:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 365. [2022-11-02 20:27:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.6263736263736264) internal successors, (592), 364 states have internal predecessors, (592), 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:27:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 592 transitions. [2022-11-02 20:27:06,504 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 592 transitions. Word has length 96 [2022-11-02 20:27:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:06,504 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 592 transitions. [2022-11-02 20:27:06,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:27:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 592 transitions. [2022-11-02 20:27:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-02 20:27:06,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:06,506 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:27:06,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:27:06,507 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:06,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:06,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1199487487, now seen corresponding path program 1 times [2022-11-02 20:27:06,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:06,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401839960] [2022-11-02 20:27:06,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:06,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 20:27:06,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:06,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401839960] [2022-11-02 20:27:06,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401839960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:06,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:06,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:06,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932736085] [2022-11-02 20:27:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:06,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:06,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:06,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:06,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:06,819 INFO L87 Difference]: Start difference. First operand 365 states and 592 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:27:07,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:27:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:08,301 INFO L93 Difference]: Finished difference Result 727 states and 1183 transitions. [2022-11-02 20:27:08,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:08,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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) Word has length 110 [2022-11-02 20:27:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:08,304 INFO L225 Difference]: With dead ends: 727 [2022-11-02 20:27:08,304 INFO L226 Difference]: Without dead ends: 383 [2022-11-02 20:27:08,305 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:27:08,305 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 40 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:08,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 485 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:27:08,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-11-02 20:27:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 365. [2022-11-02 20:27:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.6236263736263736) internal successors, (591), 364 states have internal predecessors, (591), 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:27:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 591 transitions. [2022-11-02 20:27:08,317 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 591 transitions. Word has length 110 [2022-11-02 20:27:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:08,317 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 591 transitions. [2022-11-02 20:27:08,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:27:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 591 transitions. [2022-11-02 20:27:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-02 20:27:08,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:08,319 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:08,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:27:08,320 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:08,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1657732886, now seen corresponding path program 1 times [2022-11-02 20:27:08,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:08,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858951925] [2022-11-02 20:27:08,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:08,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 20:27:08,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:08,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858951925] [2022-11-02 20:27:08,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858951925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:08,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:08,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:08,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199673274] [2022-11-02 20:27:08,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:08,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:08,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:08,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:08,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:08,656 INFO L87 Difference]: Start difference. First operand 365 states and 591 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:27:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:10,053 INFO L93 Difference]: Finished difference Result 783 states and 1260 transitions. [2022-11-02 20:27:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:10,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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) Word has length 110 [2022-11-02 20:27:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:10,055 INFO L225 Difference]: With dead ends: 783 [2022-11-02 20:27:10,055 INFO L226 Difference]: Without dead ends: 439 [2022-11-02 20:27:10,056 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:27:10,056 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 137 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:10,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 322 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:27:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-11-02 20:27:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 365. [2022-11-02 20:27:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.6071428571428572) internal successors, (585), 364 states have internal predecessors, (585), 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:27:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 585 transitions. [2022-11-02 20:27:10,069 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 585 transitions. Word has length 110 [2022-11-02 20:27:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:10,070 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 585 transitions. [2022-11-02 20:27:10,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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:27:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 585 transitions. [2022-11-02 20:27:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-02 20:27:10,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:10,072 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:27:10,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:27:10,072 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:10,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:10,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1035654471, now seen corresponding path program 1 times [2022-11-02 20:27:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:10,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661819311] [2022-11-02 20:27:10,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:10,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 20:27:10,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:10,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661819311] [2022-11-02 20:27:10,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661819311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:10,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:10,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926925697] [2022-11-02 20:27:10,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:10,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:10,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:10,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:10,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:10,415 INFO L87 Difference]: Start difference. First operand 365 states and 585 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:27:11,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:11,721 INFO L93 Difference]: Finished difference Result 783 states and 1248 transitions. [2022-11-02 20:27:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:11,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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) Word has length 111 [2022-11-02 20:27:11,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:11,723 INFO L225 Difference]: With dead ends: 783 [2022-11-02 20:27:11,723 INFO L226 Difference]: Without dead ends: 439 [2022-11-02 20:27:11,724 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:27:11,724 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 141 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:11,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 322 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:27:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-11-02 20:27:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 365. [2022-11-02 20:27:11,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.5879120879120878) internal successors, (578), 364 states have internal predecessors, (578), 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:27:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 578 transitions. [2022-11-02 20:27:11,736 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 578 transitions. Word has length 111 [2022-11-02 20:27:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:11,737 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 578 transitions. [2022-11-02 20:27:11,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:27:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 578 transitions. [2022-11-02 20:27:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 20:27:11,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:11,739 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:27:11,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:27:11,739 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:11,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:11,740 INFO L85 PathProgramCache]: Analyzing trace with hash 44793668, now seen corresponding path program 1 times [2022-11-02 20:27:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:11,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695006884] [2022-11-02 20:27:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 20:27:12,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:12,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695006884] [2022-11-02 20:27:12,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695006884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:12,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:12,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:12,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566731787] [2022-11-02 20:27:12,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:12,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:12,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:12,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:12,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:12,081 INFO L87 Difference]: Start difference. First operand 365 states and 578 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:27:14,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:27:14,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:14,572 INFO L93 Difference]: Finished difference Result 783 states and 1234 transitions. [2022-11-02 20:27:14,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:14,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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) Word has length 112 [2022-11-02 20:27:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:14,574 INFO L225 Difference]: With dead ends: 783 [2022-11-02 20:27:14,574 INFO L226 Difference]: Without dead ends: 439 [2022-11-02 20:27:14,575 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:27:14,575 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 139 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:14,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 322 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:27:14,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-11-02 20:27:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 365. [2022-11-02 20:27:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.5686813186813187) internal successors, (571), 364 states have internal predecessors, (571), 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:27:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 571 transitions. [2022-11-02 20:27:14,588 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 571 transitions. Word has length 112 [2022-11-02 20:27:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:14,588 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 571 transitions. [2022-11-02 20:27:14,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:27:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 571 transitions. [2022-11-02 20:27:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 20:27:14,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:14,590 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:27:14,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:27:14,591 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:14,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash 829319710, now seen corresponding path program 1 times [2022-11-02 20:27:14,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:14,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490520403] [2022-11-02 20:27:14,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:14,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 20:27:14,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:14,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490520403] [2022-11-02 20:27:14,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490520403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:14,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:14,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:14,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356748570] [2022-11-02 20:27:14,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:14,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:14,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:14,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:14,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:14,945 INFO L87 Difference]: Start difference. First operand 365 states and 571 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:27:16,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:27:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:17,303 INFO L93 Difference]: Finished difference Result 783 states and 1220 transitions. [2022-11-02 20:27:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:17,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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) Word has length 113 [2022-11-02 20:27:17,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:17,307 INFO L225 Difference]: With dead ends: 783 [2022-11-02 20:27:17,307 INFO L226 Difference]: Without dead ends: 439 [2022-11-02 20:27:17,308 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:27:17,309 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 137 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:17,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 322 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:27:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-11-02 20:27:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 365. [2022-11-02 20:27:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.5494505494505495) internal successors, (564), 364 states have internal predecessors, (564), 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:27:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 564 transitions. [2022-11-02 20:27:17,323 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 564 transitions. Word has length 113 [2022-11-02 20:27:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:17,323 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 564 transitions. [2022-11-02 20:27:17,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:27:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 564 transitions. [2022-11-02 20:27:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-02 20:27:17,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:17,325 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:17,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:27:17,326 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:17,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:17,326 INFO L85 PathProgramCache]: Analyzing trace with hash 198816901, now seen corresponding path program 1 times [2022-11-02 20:27:17,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:17,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461195731] [2022-11-02 20:27:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:27:17,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:17,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461195731] [2022-11-02 20:27:17,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461195731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:17,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:17,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667594489] [2022-11-02 20:27:17,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:17,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:17,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:17,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:17,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:17,709 INFO L87 Difference]: Start difference. First operand 365 states and 564 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:27:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:18,828 INFO L93 Difference]: Finished difference Result 799 states and 1236 transitions. [2022-11-02 20:27:18,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:18,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) Word has length 118 [2022-11-02 20:27:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:18,831 INFO L225 Difference]: With dead ends: 799 [2022-11-02 20:27:18,831 INFO L226 Difference]: Without dead ends: 455 [2022-11-02 20:27:18,831 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:27:18,832 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 74 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:18,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 453 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:27:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-11-02 20:27:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 405. [2022-11-02 20:27:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 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:27:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 627 transitions. [2022-11-02 20:27:18,850 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 627 transitions. Word has length 118 [2022-11-02 20:27:18,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:18,850 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 627 transitions. [2022-11-02 20:27:18,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:27:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 627 transitions. [2022-11-02 20:27:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-02 20:27:18,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:18,853 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:18,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:27:18,853 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:18,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:18,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1932921351, now seen corresponding path program 1 times [2022-11-02 20:27:18,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:18,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809515868] [2022-11-02 20:27:18,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:18,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-02 20:27:19,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:19,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809515868] [2022-11-02 20:27:19,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809515868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:19,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:19,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:19,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160167907] [2022-11-02 20:27:19,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:19,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:19,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:19,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:19,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:19,236 INFO L87 Difference]: Start difference. First operand 405 states and 627 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:27:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:20,226 INFO L93 Difference]: Finished difference Result 834 states and 1293 transitions. [2022-11-02 20:27:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:20,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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) Word has length 118 [2022-11-02 20:27:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:20,229 INFO L225 Difference]: With dead ends: 834 [2022-11-02 20:27:20,230 INFO L226 Difference]: Without dead ends: 450 [2022-11-02 20:27:20,230 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:27:20,231 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 33 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:20,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 573 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:27:20,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-11-02 20:27:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 429. [2022-11-02 20:27:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 1.5467289719626167) internal successors, (662), 428 states have internal predecessors, (662), 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:27:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 662 transitions. [2022-11-02 20:27:20,258 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 662 transitions. Word has length 118 [2022-11-02 20:27:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:20,259 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 662 transitions. [2022-11-02 20:27:20,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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:27:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 662 transitions. [2022-11-02 20:27:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-02 20:27:20,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:20,261 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:20,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:27:20,261 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2071638908, now seen corresponding path program 1 times [2022-11-02 20:27:20,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:20,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253650690] [2022-11-02 20:27:20,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:27:20,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:20,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253650690] [2022-11-02 20:27:20,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253650690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:20,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:20,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:20,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187162744] [2022-11-02 20:27:20,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:20,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:20,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:20,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:20,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:20,690 INFO L87 Difference]: Start difference. First operand 429 states and 662 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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:27:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:21,946 INFO L93 Difference]: Finished difference Result 951 states and 1466 transitions. [2022-11-02 20:27:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:21,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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) Word has length 126 [2022-11-02 20:27:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:21,949 INFO L225 Difference]: With dead ends: 951 [2022-11-02 20:27:21,949 INFO L226 Difference]: Without dead ends: 543 [2022-11-02 20:27:21,950 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:27:21,950 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 107 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:21,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 323 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:27:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-11-02 20:27:21,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 472. [2022-11-02 20:27:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.5520169851380043) internal successors, (731), 471 states have internal predecessors, (731), 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:27:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 731 transitions. [2022-11-02 20:27:21,968 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 731 transitions. Word has length 126 [2022-11-02 20:27:21,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:21,968 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 731 transitions. [2022-11-02 20:27:21,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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:27:21,969 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 731 transitions. [2022-11-02 20:27:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-02 20:27:21,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:21,971 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:21,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:27:21,971 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:21,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:21,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1967179869, now seen corresponding path program 1 times [2022-11-02 20:27:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:21,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317833665] [2022-11-02 20:27:21,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:21,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:27:22,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:22,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317833665] [2022-11-02 20:27:22,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317833665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:22,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:22,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:22,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032147632] [2022-11-02 20:27:22,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:22,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:22,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:22,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:22,444 INFO L87 Difference]: Start difference. First operand 472 states and 731 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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:27:24,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:27:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:24,504 INFO L93 Difference]: Finished difference Result 997 states and 1540 transitions. [2022-11-02 20:27:24,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:24,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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) Word has length 127 [2022-11-02 20:27:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:24,507 INFO L225 Difference]: With dead ends: 997 [2022-11-02 20:27:24,507 INFO L226 Difference]: Without dead ends: 544 [2022-11-02 20:27:24,508 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:27:24,508 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 108 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:24,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 322 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-02 20:27:24,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-11-02 20:27:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 474. [2022-11-02 20:27:24,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.5517970401691332) internal successors, (734), 473 states have internal predecessors, (734), 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:27:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 734 transitions. [2022-11-02 20:27:24,525 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 734 transitions. Word has length 127 [2022-11-02 20:27:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:24,526 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 734 transitions. [2022-11-02 20:27:24,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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:27:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 734 transitions. [2022-11-02 20:27:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-02 20:27:24,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:24,528 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:24,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:27:24,529 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:24,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:24,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1678544663, now seen corresponding path program 1 times [2022-11-02 20:27:24,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:24,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328707867] [2022-11-02 20:27:24,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-02 20:27:25,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:25,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328707867] [2022-11-02 20:27:25,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328707867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:25,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:25,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:27:25,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395063017] [2022-11-02 20:27:25,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:25,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:27:25,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:25,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:27:25,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:27:25,051 INFO L87 Difference]: Start difference. First operand 474 states and 734 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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:27:26,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:27:27,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:27:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:27,955 INFO L93 Difference]: Finished difference Result 937 states and 1456 transitions. [2022-11-02 20:27:27,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:27:27,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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) Word has length 132 [2022-11-02 20:27:27,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:27,956 INFO L225 Difference]: With dead ends: 937 [2022-11-02 20:27:27,957 INFO L226 Difference]: Without dead ends: 484 [2022-11-02 20:27:27,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:27:27,958 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 146 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:27,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 344 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-02 20:27:27,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-11-02 20:27:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 483. [2022-11-02 20:27:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.545643153526971) internal successors, (745), 482 states have internal predecessors, (745), 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:27:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 745 transitions. [2022-11-02 20:27:27,975 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 745 transitions. Word has length 132 [2022-11-02 20:27:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:27,976 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 745 transitions. [2022-11-02 20:27:27,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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:27:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 745 transitions. [2022-11-02 20:27:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-02 20:27:27,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:27,979 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:27,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:27:27,979 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1081930242, now seen corresponding path program 1 times [2022-11-02 20:27:27,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:27,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381377199] [2022-11-02 20:27:27,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:27:28,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:28,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381377199] [2022-11-02 20:27:28,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381377199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:28,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:28,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:28,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908106762] [2022-11-02 20:27:28,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:28,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:28,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:28,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:28,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:28,429 INFO L87 Difference]: Start difference. First operand 483 states and 745 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:27:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:29,267 INFO L93 Difference]: Finished difference Result 1005 states and 1548 transitions. [2022-11-02 20:27:29,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:29,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) Word has length 133 [2022-11-02 20:27:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:29,270 INFO L225 Difference]: With dead ends: 1005 [2022-11-02 20:27:29,270 INFO L226 Difference]: Without dead ends: 543 [2022-11-02 20:27:29,271 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:27:29,272 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 130 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:29,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 364 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:27:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-11-02 20:27:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 483. [2022-11-02 20:27:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.5269709543568464) internal successors, (736), 482 states have internal predecessors, (736), 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:27:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 736 transitions. [2022-11-02 20:27:29,293 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 736 transitions. Word has length 133 [2022-11-02 20:27:29,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:29,293 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 736 transitions. [2022-11-02 20:27:29,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:27:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 736 transitions. [2022-11-02 20:27:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-02 20:27:29,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:29,295 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:27:29,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:27:29,296 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:29,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:29,296 INFO L85 PathProgramCache]: Analyzing trace with hash 923128465, now seen corresponding path program 1 times [2022-11-02 20:27:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:29,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557742624] [2022-11-02 20:27:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:27:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:29,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557742624] [2022-11-02 20:27:29,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557742624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:29,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:29,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:29,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686973488] [2022-11-02 20:27:29,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:29,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:29,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:29,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:29,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:29,682 INFO L87 Difference]: Start difference. First operand 483 states and 736 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:27:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:30,978 INFO L93 Difference]: Finished difference Result 979 states and 1493 transitions. [2022-11-02 20:27:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:30,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) Word has length 139 [2022-11-02 20:27:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:30,981 INFO L225 Difference]: With dead ends: 979 [2022-11-02 20:27:30,982 INFO L226 Difference]: Without dead ends: 517 [2022-11-02 20:27:30,983 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:27:30,983 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 64 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:30,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 473 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:27:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-11-02 20:27:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 483. [2022-11-02 20:27:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.5248962655601659) internal successors, (735), 482 states have internal predecessors, (735), 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:27:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 735 transitions. [2022-11-02 20:27:31,003 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 735 transitions. Word has length 139 [2022-11-02 20:27:31,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:31,004 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 735 transitions. [2022-11-02 20:27:31,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:27:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 735 transitions. [2022-11-02 20:27:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-02 20:27:31,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:31,006 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:31,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:27:31,006 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:31,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:31,007 INFO L85 PathProgramCache]: Analyzing trace with hash 178755555, now seen corresponding path program 1 times [2022-11-02 20:27:31,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:31,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490955387] [2022-11-02 20:27:31,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:31,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:27:31,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:31,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490955387] [2022-11-02 20:27:31,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490955387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:31,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:31,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:31,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560344798] [2022-11-02 20:27:31,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:31,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:31,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:31,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:31,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:31,474 INFO L87 Difference]: Start difference. First operand 483 states and 735 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:27:32,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:32,329 INFO L93 Difference]: Finished difference Result 1005 states and 1528 transitions. [2022-11-02 20:27:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:32,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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) Word has length 140 [2022-11-02 20:27:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:32,332 INFO L225 Difference]: With dead ends: 1005 [2022-11-02 20:27:32,332 INFO L226 Difference]: Without dead ends: 543 [2022-11-02 20:27:32,333 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:27:32,333 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 117 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:32,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 374 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:27:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-11-02 20:27:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 483. [2022-11-02 20:27:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.5103734439834025) internal successors, (728), 482 states have internal predecessors, (728), 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:27:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 728 transitions. [2022-11-02 20:27:32,354 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 728 transitions. Word has length 140 [2022-11-02 20:27:32,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:32,355 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 728 transitions. [2022-11-02 20:27:32,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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:27:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 728 transitions. [2022-11-02 20:27:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-02 20:27:32,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:32,357 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:27:32,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:27:32,357 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:32,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1310833163, now seen corresponding path program 1 times [2022-11-02 20:27:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:32,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871016875] [2022-11-02 20:27:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:32,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:27:32,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:32,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871016875] [2022-11-02 20:27:32,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871016875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:32,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:32,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:32,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023132054] [2022-11-02 20:27:32,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:32,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:32,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:32,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:32,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:32,785 INFO L87 Difference]: Start difference. First operand 483 states and 728 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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:27:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:33,532 INFO L93 Difference]: Finished difference Result 977 states and 1475 transitions. [2022-11-02 20:27:33,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:33,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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) Word has length 140 [2022-11-02 20:27:33,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:33,535 INFO L225 Difference]: With dead ends: 977 [2022-11-02 20:27:33,535 INFO L226 Difference]: Without dead ends: 515 [2022-11-02 20:27:33,536 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:27:33,537 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 60 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:33,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 485 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:27:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-11-02 20:27:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 483. [2022-11-02 20:27:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.508298755186722) internal successors, (727), 482 states have internal predecessors, (727), 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:27:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 727 transitions. [2022-11-02 20:27:33,556 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 727 transitions. Word has length 140 [2022-11-02 20:27:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:33,557 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 727 transitions. [2022-11-02 20:27:33,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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:27:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 727 transitions. [2022-11-02 20:27:33,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-02 20:27:33,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:33,559 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:33,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:27:33,559 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:33,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:33,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1779826661, now seen corresponding path program 1 times [2022-11-02 20:27:33,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:33,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945723679] [2022-11-02 20:27:33,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:33,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-02 20:27:33,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:33,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945723679] [2022-11-02 20:27:33,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945723679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:33,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:33,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:33,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107795478] [2022-11-02 20:27:33,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:33,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:33,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:33,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:33,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:33,895 INFO L87 Difference]: Start difference. First operand 483 states and 727 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:27:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:34,637 INFO L93 Difference]: Finished difference Result 984 states and 1485 transitions. [2022-11-02 20:27:34,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:34,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) Word has length 140 [2022-11-02 20:27:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:34,638 INFO L225 Difference]: With dead ends: 984 [2022-11-02 20:27:34,639 INFO L226 Difference]: Without dead ends: 522 [2022-11-02 20:27:34,639 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:27:34,640 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 27 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:34,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 561 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:27:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-02 20:27:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 509. [2022-11-02 20:27:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.5039370078740157) internal successors, (764), 508 states have internal predecessors, (764), 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:27:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 764 transitions. [2022-11-02 20:27:34,660 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 764 transitions. Word has length 140 [2022-11-02 20:27:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:34,661 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 764 transitions. [2022-11-02 20:27:34,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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:27:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 764 transitions. [2022-11-02 20:27:34,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-02 20:27:34,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:34,663 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:27:34,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:27:34,663 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:34,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:34,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2138352260, now seen corresponding path program 1 times [2022-11-02 20:27:34,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:34,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18492469] [2022-11-02 20:27:34,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:34,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:27:35,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:35,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18492469] [2022-11-02 20:27:35,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18492469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:35,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:35,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:35,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555389267] [2022-11-02 20:27:35,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:35,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:35,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:35,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:35,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:35,118 INFO L87 Difference]: Start difference. First operand 509 states and 764 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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:27:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:36,487 INFO L93 Difference]: Finished difference Result 1099 states and 1651 transitions. [2022-11-02 20:27:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:36,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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) Word has length 142 [2022-11-02 20:27:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:36,490 INFO L225 Difference]: With dead ends: 1099 [2022-11-02 20:27:36,490 INFO L226 Difference]: Without dead ends: 611 [2022-11-02 20:27:36,491 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:27:36,492 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 113 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:36,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 364 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:27:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-11-02 20:27:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 537. [2022-11-02 20:27:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4906716417910448) internal successors, (799), 536 states have internal predecessors, (799), 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:27:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 799 transitions. [2022-11-02 20:27:36,518 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 799 transitions. Word has length 142 [2022-11-02 20:27:36,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:36,518 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 799 transitions. [2022-11-02 20:27:36,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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:27:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 799 transitions. [2022-11-02 20:27:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-02 20:27:36,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:36,520 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:36,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:27:36,521 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:36,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:36,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1346533418, now seen corresponding path program 1 times [2022-11-02 20:27:36,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:36,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837721579] [2022-11-02 20:27:36,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:36,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:27:36,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:36,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837721579] [2022-11-02 20:27:36,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837721579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:36,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:36,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:36,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917855610] [2022-11-02 20:27:36,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:36,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:36,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:36,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:36,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:36,953 INFO L87 Difference]: Start difference. First operand 537 states and 799 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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:27:38,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:27:38,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:38,826 INFO L93 Difference]: Finished difference Result 1077 states and 1604 transitions. [2022-11-02 20:27:38,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:38,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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) Word has length 143 [2022-11-02 20:27:38,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:38,829 INFO L225 Difference]: With dead ends: 1077 [2022-11-02 20:27:38,829 INFO L226 Difference]: Without dead ends: 561 [2022-11-02 20:27:38,830 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:27:38,830 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 51 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:38,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 503 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 20:27:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-11-02 20:27:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 537. [2022-11-02 20:27:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4888059701492538) internal successors, (798), 536 states have internal predecessors, (798), 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:27:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 798 transitions. [2022-11-02 20:27:38,874 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 798 transitions. Word has length 143 [2022-11-02 20:27:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:38,875 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 798 transitions. [2022-11-02 20:27:38,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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:27:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 798 transitions. [2022-11-02 20:27:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-02 20:27:38,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:38,878 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:38,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:27:38,878 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:38,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:38,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1625865976, now seen corresponding path program 1 times [2022-11-02 20:27:38,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:38,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023051901] [2022-11-02 20:27:38,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:38,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:27:39,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:39,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023051901] [2022-11-02 20:27:39,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023051901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:39,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:39,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:39,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057460919] [2022-11-02 20:27:39,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:39,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:39,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:39,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:39,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:39,296 INFO L87 Difference]: Start difference. First operand 537 states and 798 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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:27:41,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:27:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:41,421 INFO L93 Difference]: Finished difference Result 1077 states and 1602 transitions. [2022-11-02 20:27:41,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:41,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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) Word has length 146 [2022-11-02 20:27:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:41,426 INFO L225 Difference]: With dead ends: 1077 [2022-11-02 20:27:41,426 INFO L226 Difference]: Without dead ends: 561 [2022-11-02 20:27:41,429 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:27:41,430 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 53 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:41,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 503 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:27:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-11-02 20:27:41,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 537. [2022-11-02 20:27:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4869402985074627) internal successors, (797), 536 states have internal predecessors, (797), 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:27:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 797 transitions. [2022-11-02 20:27:41,457 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 797 transitions. Word has length 146 [2022-11-02 20:27:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:41,457 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 797 transitions. [2022-11-02 20:27:41,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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:27:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 797 transitions. [2022-11-02 20:27:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-02 20:27:41,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:41,461 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:41,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:27:41,462 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:41,462 INFO L85 PathProgramCache]: Analyzing trace with hash -610410242, now seen corresponding path program 1 times [2022-11-02 20:27:41,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:41,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242456918] [2022-11-02 20:27:41,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:41,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:27:41,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:41,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242456918] [2022-11-02 20:27:41,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242456918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:41,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:41,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:41,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818859019] [2022-11-02 20:27:41,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:41,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:41,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:41,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:41,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:41,891 INFO L87 Difference]: Start difference. First operand 537 states and 797 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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:27:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:42,773 INFO L93 Difference]: Finished difference Result 1113 states and 1652 transitions. [2022-11-02 20:27:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:42,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) Word has length 147 [2022-11-02 20:27:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:42,776 INFO L225 Difference]: With dead ends: 1113 [2022-11-02 20:27:42,777 INFO L226 Difference]: Without dead ends: 597 [2022-11-02 20:27:42,778 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:27:42,779 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 114 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:42,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 344 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:27:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-11-02 20:27:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 537. [2022-11-02 20:27:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4720149253731343) internal successors, (789), 536 states have internal predecessors, (789), 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:27:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 789 transitions. [2022-11-02 20:27:42,807 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 789 transitions. Word has length 147 [2022-11-02 20:27:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:42,807 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 789 transitions. [2022-11-02 20:27:42,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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:27:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 789 transitions. [2022-11-02 20:27:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-02 20:27:42,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:42,810 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:42,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:27:42,810 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:42,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:42,811 INFO L85 PathProgramCache]: Analyzing trace with hash 975125816, now seen corresponding path program 1 times [2022-11-02 20:27:42,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:42,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225272947] [2022-11-02 20:27:42,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:43,276 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-02 20:27:43,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:43,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225272947] [2022-11-02 20:27:43,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225272947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:43,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:43,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:43,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970553907] [2022-11-02 20:27:43,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:43,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:43,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:43,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:43,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:43,280 INFO L87 Difference]: Start difference. First operand 537 states and 789 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:27:44,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:27:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:45,219 INFO L93 Difference]: Finished difference Result 1075 states and 1581 transitions. [2022-11-02 20:27:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:45,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) Word has length 149 [2022-11-02 20:27:45,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:45,221 INFO L225 Difference]: With dead ends: 1075 [2022-11-02 20:27:45,221 INFO L226 Difference]: Without dead ends: 559 [2022-11-02 20:27:45,222 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:27:45,223 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 41 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:45,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 509 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-02 20:27:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-11-02 20:27:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 537. [2022-11-02 20:27:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4701492537313432) internal successors, (788), 536 states have internal predecessors, (788), 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:27:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 788 transitions. [2022-11-02 20:27:45,249 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 788 transitions. Word has length 149 [2022-11-02 20:27:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:45,249 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 788 transitions. [2022-11-02 20:27:45,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:27:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 788 transitions. [2022-11-02 20:27:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-02 20:27:45,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:45,251 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:45,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:27:45,252 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:45,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:45,253 INFO L85 PathProgramCache]: Analyzing trace with hash -6678238, now seen corresponding path program 1 times [2022-11-02 20:27:45,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:45,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693762907] [2022-11-02 20:27:45,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:45,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:27:45,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:45,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693762907] [2022-11-02 20:27:45,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693762907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:45,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:45,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:45,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579806549] [2022-11-02 20:27:45,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:45,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:45,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:45,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:45,731 INFO L87 Difference]: Start difference. First operand 537 states and 788 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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:27:47,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:27:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:48,254 INFO L93 Difference]: Finished difference Result 1155 states and 1698 transitions. [2022-11-02 20:27:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:48,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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) Word has length 149 [2022-11-02 20:27:48,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:48,256 INFO L225 Difference]: With dead ends: 1155 [2022-11-02 20:27:48,256 INFO L226 Difference]: Without dead ends: 639 [2022-11-02 20:27:48,257 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:27:48,258 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 107 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:48,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 344 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 242 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:27:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-11-02 20:27:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 570. [2022-11-02 20:27:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.4639718804920914) internal successors, (833), 569 states have internal predecessors, (833), 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:27:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 833 transitions. [2022-11-02 20:27:48,285 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 833 transitions. Word has length 149 [2022-11-02 20:27:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:48,286 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 833 transitions. [2022-11-02 20:27:48,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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:27:48,286 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 833 transitions. [2022-11-02 20:27:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-11-02 20:27:48,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:48,288 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:48,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:27:48,288 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:48,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:48,289 INFO L85 PathProgramCache]: Analyzing trace with hash 672787457, now seen corresponding path program 1 times [2022-11-02 20:27:48,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:48,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741799716] [2022-11-02 20:27:48,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:48,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:27:48,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:48,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741799716] [2022-11-02 20:27:48,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741799716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:48,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:48,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:48,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827582969] [2022-11-02 20:27:48,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:48,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:48,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:48,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:48,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:48,662 INFO L87 Difference]: Start difference. First operand 570 states and 833 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:27:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:50,068 INFO L93 Difference]: Finished difference Result 1179 states and 1724 transitions. [2022-11-02 20:27:50,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:50,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) Word has length 150 [2022-11-02 20:27:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:50,072 INFO L225 Difference]: With dead ends: 1179 [2022-11-02 20:27:50,072 INFO L226 Difference]: Without dead ends: 630 [2022-11-02 20:27:50,073 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:27:50,073 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 106 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:50,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 344 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:27:50,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-11-02 20:27:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 570. [2022-11-02 20:27:50,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.4551845342706502) internal successors, (828), 569 states have internal predecessors, (828), 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:27:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 828 transitions. [2022-11-02 20:27:50,121 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 828 transitions. Word has length 150 [2022-11-02 20:27:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:50,121 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 828 transitions. [2022-11-02 20:27:50,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:27:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 828 transitions. [2022-11-02 20:27:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-11-02 20:27:50,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:50,124 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:50,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:27:50,124 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:50,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:50,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1350973257, now seen corresponding path program 1 times [2022-11-02 20:27:50,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:50,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939068159] [2022-11-02 20:27:50,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:50,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-02 20:27:50,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:50,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939068159] [2022-11-02 20:27:50,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939068159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:50,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:50,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:50,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782530394] [2022-11-02 20:27:50,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:50,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:50,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:50,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:50,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:50,518 INFO L87 Difference]: Start difference. First operand 570 states and 828 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:27:51,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:27:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:52,094 INFO L93 Difference]: Finished difference Result 1179 states and 1714 transitions. [2022-11-02 20:27:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:52,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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) Word has length 150 [2022-11-02 20:27:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:52,097 INFO L225 Difference]: With dead ends: 1179 [2022-11-02 20:27:52,098 INFO L226 Difference]: Without dead ends: 630 [2022-11-02 20:27:52,099 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:27:52,099 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 103 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:52,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 344 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:27:52,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-11-02 20:27:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 570. [2022-11-02 20:27:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.4463971880492092) internal successors, (823), 569 states have internal predecessors, (823), 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:27:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 823 transitions. [2022-11-02 20:27:52,129 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 823 transitions. Word has length 150 [2022-11-02 20:27:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:52,130 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 823 transitions. [2022-11-02 20:27:52,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:27:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 823 transitions. [2022-11-02 20:27:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-02 20:27:52,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:52,133 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:27:52,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:27:52,133 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:52,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:52,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1658435944, now seen corresponding path program 1 times [2022-11-02 20:27:52,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:52,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601622615] [2022-11-02 20:27:52,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:52,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 20:27:52,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:52,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601622615] [2022-11-02 20:27:52,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601622615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:52,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:52,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:52,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535621074] [2022-11-02 20:27:52,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:52,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:52,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:52,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:52,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:52,535 INFO L87 Difference]: Start difference. First operand 570 states and 823 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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:27:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:53,244 INFO L93 Difference]: Finished difference Result 1179 states and 1704 transitions. [2022-11-02 20:27:53,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:53,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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) Word has length 159 [2022-11-02 20:27:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:53,247 INFO L225 Difference]: With dead ends: 1179 [2022-11-02 20:27:53,247 INFO L226 Difference]: Without dead ends: 630 [2022-11-02 20:27:53,248 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:27:53,248 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 99 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:53,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 344 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:27:53,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-11-02 20:27:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 567. [2022-11-02 20:27:53,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 1.4434628975265018) internal successors, (817), 566 states have internal predecessors, (817), 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:27:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 817 transitions. [2022-11-02 20:27:53,276 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 817 transitions. Word has length 159 [2022-11-02 20:27:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:53,277 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 817 transitions. [2022-11-02 20:27:53,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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:27:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 817 transitions. [2022-11-02 20:27:53,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-02 20:27:53,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:53,279 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:27:53,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:27:53,280 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:53,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash 153715343, now seen corresponding path program 1 times [2022-11-02 20:27:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:53,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057202180] [2022-11-02 20:27:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-02 20:27:53,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:53,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057202180] [2022-11-02 20:27:53,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057202180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:53,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:53,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:27:53,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279884410] [2022-11-02 20:27:53,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:53,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:53,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:53,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:53,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:53,479 INFO L87 Difference]: Start difference. First operand 567 states and 817 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:27:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:53,554 INFO L93 Difference]: Finished difference Result 1652 states and 2393 transitions. [2022-11-02 20:27:53,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:53,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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) Word has length 167 [2022-11-02 20:27:53,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:53,558 INFO L225 Difference]: With dead ends: 1652 [2022-11-02 20:27:53,558 INFO L226 Difference]: Without dead ends: 1106 [2022-11-02 20:27:53,559 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:27:53,560 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 139 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:53,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 559 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:27:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2022-11-02 20:27:53,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2022-11-02 20:27:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1105 states have (on average 1.4425339366515837) internal successors, (1594), 1105 states have internal predecessors, (1594), 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:27:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1594 transitions. [2022-11-02 20:27:53,610 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1594 transitions. Word has length 167 [2022-11-02 20:27:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:53,610 INFO L495 AbstractCegarLoop]: Abstraction has 1106 states and 1594 transitions. [2022-11-02 20:27:53,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:27:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1594 transitions. [2022-11-02 20:27:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-02 20:27:53,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:53,613 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:27:53,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:27:53,613 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:53,614 INFO L85 PathProgramCache]: Analyzing trace with hash 493144206, now seen corresponding path program 1 times [2022-11-02 20:27:53,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:53,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031577896] [2022-11-02 20:27:53,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:53,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 20:27:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:53,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031577896] [2022-11-02 20:27:53,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031577896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:53,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:53,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:27:53,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783067745] [2022-11-02 20:27:53,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:53,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:53,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:53,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:53,787 INFO L87 Difference]: Start difference. First operand 1106 states and 1594 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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:27:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:53,877 INFO L93 Difference]: Finished difference Result 2698 states and 3899 transitions. [2022-11-02 20:27:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:53,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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) Word has length 168 [2022-11-02 20:27:53,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:53,883 INFO L225 Difference]: With dead ends: 2698 [2022-11-02 20:27:53,883 INFO L226 Difference]: Without dead ends: 1613 [2022-11-02 20:27:53,884 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:27:53,885 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 136 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:53,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 492 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:27:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2022-11-02 20:27:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1613. [2022-11-02 20:27:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1612 states have (on average 1.4410669975186103) internal successors, (2323), 1612 states have internal predecessors, (2323), 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:27:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2323 transitions. [2022-11-02 20:27:53,954 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2323 transitions. Word has length 168 [2022-11-02 20:27:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:53,954 INFO L495 AbstractCegarLoop]: Abstraction has 1613 states and 2323 transitions. [2022-11-02 20:27:53,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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:27:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2323 transitions. [2022-11-02 20:27:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-02 20:27:53,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:53,958 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:27:53,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:27:53,958 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:53,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:53,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1716174966, now seen corresponding path program 1 times [2022-11-02 20:27:53,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:53,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068372885] [2022-11-02 20:27:53,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:53,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:27:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:54,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068372885] [2022-11-02 20:27:54,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068372885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:54,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:54,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:27:54,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76116503] [2022-11-02 20:27:54,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:54,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:54,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:54,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:54,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:54,101 INFO L87 Difference]: Start difference. First operand 1613 states and 2323 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:27:54,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:54,214 INFO L93 Difference]: Finished difference Result 3703 states and 5347 transitions. [2022-11-02 20:27:54,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:54,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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) Word has length 169 [2022-11-02 20:27:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:54,221 INFO L225 Difference]: With dead ends: 3703 [2022-11-02 20:27:54,222 INFO L226 Difference]: Without dead ends: 2111 [2022-11-02 20:27:54,223 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:27:54,224 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 138 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:54,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 508 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:27:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2022-11-02 20:27:54,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2111. [2022-11-02 20:27:54,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 2110 states have (on average 1.4417061611374407) internal successors, (3042), 2110 states have internal predecessors, (3042), 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:27:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3042 transitions. [2022-11-02 20:27:54,344 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3042 transitions. Word has length 169 [2022-11-02 20:27:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:54,345 INFO L495 AbstractCegarLoop]: Abstraction has 2111 states and 3042 transitions. [2022-11-02 20:27:54,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:27:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3042 transitions. [2022-11-02 20:27:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-02 20:27:54,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:54,349 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:27:54,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:27:54,350 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:54,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:54,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1994020680, now seen corresponding path program 1 times [2022-11-02 20:27:54,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:54,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108108461] [2022-11-02 20:27:54,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:54,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-02 20:27:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:54,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108108461] [2022-11-02 20:27:54,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108108461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:54,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:54,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:27:54,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112734148] [2022-11-02 20:27:54,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:54,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:54,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:54,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:54,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:54,496 INFO L87 Difference]: Start difference. First operand 2111 states and 3042 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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:27:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:54,606 INFO L93 Difference]: Finished difference Result 4228 states and 6096 transitions. [2022-11-02 20:27:54,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:54,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) Word has length 169 [2022-11-02 20:27:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:54,613 INFO L225 Difference]: With dead ends: 4228 [2022-11-02 20:27:54,613 INFO L226 Difference]: Without dead ends: 2138 [2022-11-02 20:27:54,615 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:27:54,616 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:54,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 406 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:27:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2022-11-02 20:27:54,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2138. [2022-11-02 20:27:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 2137 states have (on average 1.439868975198877) internal successors, (3077), 2137 states have internal predecessors, (3077), 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:27:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3077 transitions. [2022-11-02 20:27:54,710 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3077 transitions. Word has length 169 [2022-11-02 20:27:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:54,711 INFO L495 AbstractCegarLoop]: Abstraction has 2138 states and 3077 transitions. [2022-11-02 20:27:54,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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:27:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3077 transitions. [2022-11-02 20:27:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-02 20:27:54,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:54,715 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 20:27:54,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:27:54,715 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1729373190, now seen corresponding path program 1 times [2022-11-02 20:27:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:54,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368928467] [2022-11-02 20:27:54,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:54,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-11-02 20:27:54,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:54,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368928467] [2022-11-02 20:27:54,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368928467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:54,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:54,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:27:54,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737963120] [2022-11-02 20:27:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:54,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:54,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:54,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:54,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:54,857 INFO L87 Difference]: Start difference. First operand 2138 states and 3077 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:27:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:54,986 INFO L93 Difference]: Finished difference Result 4257 states and 6132 transitions. [2022-11-02 20:27:54,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:54,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) Word has length 169 [2022-11-02 20:27:54,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:55,006 INFO L225 Difference]: With dead ends: 4257 [2022-11-02 20:27:55,012 INFO L226 Difference]: Without dead ends: 2140 [2022-11-02 20:27:55,014 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:27:55,015 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:55,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 385 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:27:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2022-11-02 20:27:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2022-11-02 20:27:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.439457690509584) internal successors, (3079), 2139 states have internal predecessors, (3079), 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:27:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 3079 transitions. [2022-11-02 20:27:55,149 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 3079 transitions. Word has length 169 [2022-11-02 20:27:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:55,151 INFO L495 AbstractCegarLoop]: Abstraction has 2140 states and 3079 transitions. [2022-11-02 20:27:55,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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:27:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3079 transitions. [2022-11-02 20:27:55,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-11-02 20:27:55,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:55,158 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:27:55,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:27:55,158 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:55,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:55,159 INFO L85 PathProgramCache]: Analyzing trace with hash 534257747, now seen corresponding path program 1 times [2022-11-02 20:27:55,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:55,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991174956] [2022-11-02 20:27:55,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:55,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-11-02 20:27:55,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:55,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991174956] [2022-11-02 20:27:55,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991174956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:55,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:55,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336280647] [2022-11-02 20:27:55,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:55,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:55,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:55,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:55,631 INFO L87 Difference]: Start difference. First operand 2140 states and 3079 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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:27:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:56,771 INFO L93 Difference]: Finished difference Result 4530 states and 6506 transitions. [2022-11-02 20:27:56,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:56,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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) Word has length 262 [2022-11-02 20:27:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:56,776 INFO L225 Difference]: With dead ends: 4530 [2022-11-02 20:27:56,776 INFO L226 Difference]: Without dead ends: 2413 [2022-11-02 20:27:56,778 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:27:56,778 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 55 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:56,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 583 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:27:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2022-11-02 20:27:56,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2260. [2022-11-02 20:27:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2259 states have (on average 1.4391323594510845) internal successors, (3251), 2259 states have internal predecessors, (3251), 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:27:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3251 transitions. [2022-11-02 20:27:56,880 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3251 transitions. Word has length 262 [2022-11-02 20:27:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:56,880 INFO L495 AbstractCegarLoop]: Abstraction has 2260 states and 3251 transitions. [2022-11-02 20:27:56,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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:27:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3251 transitions. [2022-11-02 20:27:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-11-02 20:27:56,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:56,886 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:27:56,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 20:27:56,886 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:56,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:56,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2140742793, now seen corresponding path program 1 times [2022-11-02 20:27:56,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:56,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81634789] [2022-11-02 20:27:56,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:56,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-11-02 20:27:57,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:57,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81634789] [2022-11-02 20:27:57,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81634789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:57,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:57,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:57,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736706157] [2022-11-02 20:27:57,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:57,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:57,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:57,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:57,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:57,406 INFO L87 Difference]: Start difference. First operand 2260 states and 3251 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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:27:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:58,247 INFO L93 Difference]: Finished difference Result 4642 states and 6666 transitions. [2022-11-02 20:27:58,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:58,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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) Word has length 263 [2022-11-02 20:27:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:58,253 INFO L225 Difference]: With dead ends: 4642 [2022-11-02 20:27:58,253 INFO L226 Difference]: Without dead ends: 2405 [2022-11-02 20:27:58,255 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:27:58,256 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 52 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:58,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 579 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:27:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2022-11-02 20:27:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2264. [2022-11-02 20:27:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 2263 states have (on average 1.4383561643835616) internal successors, (3255), 2263 states have internal predecessors, (3255), 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:27:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 3255 transitions. [2022-11-02 20:27:58,355 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 3255 transitions. Word has length 263 [2022-11-02 20:27:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:58,356 INFO L495 AbstractCegarLoop]: Abstraction has 2264 states and 3255 transitions. [2022-11-02 20:27:58,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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:27:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 3255 transitions. [2022-11-02 20:27:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2022-11-02 20:27:58,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:58,362 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:27:58,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 20:27:58,362 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:58,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash -942402324, now seen corresponding path program 1 times [2022-11-02 20:27:58,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:58,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299616050] [2022-11-02 20:27:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 389 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-11-02 20:27:58,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:58,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299616050] [2022-11-02 20:27:58,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299616050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:58,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:58,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:58,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345255061] [2022-11-02 20:27:58,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:58,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:58,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:58,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:58,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:58,911 INFO L87 Difference]: Start difference. First operand 2264 states and 3255 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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:28:00,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:28:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:00,843 INFO L93 Difference]: Finished difference Result 4614 states and 6614 transitions. [2022-11-02 20:28:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:28:00,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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) Word has length 266 [2022-11-02 20:28:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:00,847 INFO L225 Difference]: With dead ends: 4614 [2022-11-02 20:28:00,847 INFO L226 Difference]: Without dead ends: 2373 [2022-11-02 20:28:00,848 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:28:00,849 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 44 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:00,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 569 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 20:28:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2022-11-02 20:28:00,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2264. [2022-11-02 20:28:00,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 2263 states have (on average 1.4365885992045957) internal successors, (3251), 2263 states have internal predecessors, (3251), 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:28:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 3251 transitions. [2022-11-02 20:28:00,930 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 3251 transitions. Word has length 266 [2022-11-02 20:28:00,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:00,931 INFO L495 AbstractCegarLoop]: Abstraction has 2264 states and 3251 transitions. [2022-11-02 20:28:00,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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:28:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 3251 transitions. [2022-11-02 20:28:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-11-02 20:28:00,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:00,937 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2022-11-02 20:28:00,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 20:28:00,937 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1669644410, now seen corresponding path program 1 times [2022-11-02 20:28:00,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:00,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955147667] [2022-11-02 20:28:00,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:00,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-11-02 20:28:01,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:01,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955147667] [2022-11-02 20:28:01,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955147667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:01,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:01,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:28:01,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491420735] [2022-11-02 20:28:01,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:01,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:01,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:01,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:01,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:28:01,506 INFO L87 Difference]: Start difference. First operand 2264 states and 3251 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:28:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:02,646 INFO L93 Difference]: Finished difference Result 4606 states and 6598 transitions. [2022-11-02 20:28:02,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:28:02,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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) Word has length 272 [2022-11-02 20:28:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:02,650 INFO L225 Difference]: With dead ends: 4606 [2022-11-02 20:28:02,650 INFO L226 Difference]: Without dead ends: 2365 [2022-11-02 20:28:02,651 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:28:02,652 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 36 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:02,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 565 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:28:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2022-11-02 20:28:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2244. [2022-11-02 20:28:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2244 states, 2243 states have (on average 1.4404814979937584) internal successors, (3231), 2243 states have internal predecessors, (3231), 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:28:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3231 transitions. [2022-11-02 20:28:02,752 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3231 transitions. Word has length 272 [2022-11-02 20:28:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:02,753 INFO L495 AbstractCegarLoop]: Abstraction has 2244 states and 3231 transitions. [2022-11-02 20:28:02,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:28:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3231 transitions. [2022-11-02 20:28:02,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2022-11-02 20:28:02,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:02,758 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:28:02,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 20:28:02,759 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:02,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1221317824, now seen corresponding path program 1 times [2022-11-02 20:28:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:02,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130074978] [2022-11-02 20:28:02,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2022-11-02 20:28:03,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:03,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130074978] [2022-11-02 20:28:03,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130074978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:03,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:03,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:28:03,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221741361] [2022-11-02 20:28:03,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:03,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:03,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:03,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:28:03,163 INFO L87 Difference]: Start difference. First operand 2244 states and 3231 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:28:05,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:28:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:05,463 INFO L93 Difference]: Finished difference Result 4550 states and 6554 transitions. [2022-11-02 20:28:05,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:28:05,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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) Word has length 290 [2022-11-02 20:28:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:05,469 INFO L225 Difference]: With dead ends: 4550 [2022-11-02 20:28:05,469 INFO L226 Difference]: Without dead ends: 2329 [2022-11-02 20:28:05,471 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:28:05,472 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 37 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:05,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 570 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-02 20:28:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2022-11-02 20:28:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2244. [2022-11-02 20:28:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2244 states, 2243 states have (on average 1.4386981720909495) internal successors, (3227), 2243 states have internal predecessors, (3227), 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:28:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3227 transitions. [2022-11-02 20:28:05,571 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3227 transitions. Word has length 290 [2022-11-02 20:28:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:05,572 INFO L495 AbstractCegarLoop]: Abstraction has 2244 states and 3227 transitions. [2022-11-02 20:28:05,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:28:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3227 transitions. [2022-11-02 20:28:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-02 20:28:05,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:05,577 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:05,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-02 20:28:05,577 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:05,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1549103668, now seen corresponding path program 1 times [2022-11-02 20:28:05,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:05,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119009408] [2022-11-02 20:28:05,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:05,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 474 proven. 106 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-11-02 20:28:06,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:06,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119009408] [2022-11-02 20:28:06,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119009408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:28:06,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915263726] [2022-11-02 20:28:06,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:06,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:06,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:06,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:28:06,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:28:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:07,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 1510 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:28:07,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:28:07,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:28:07,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:28:07,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:28:07,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:28:07,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:28:07,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:28:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 477 proven. 64 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-02 20:28:07,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:28:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2022-11-02 20:28:08,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915263726] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:28:08,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:28:08,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 9 [2022-11-02 20:28:08,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932603755] [2022-11-02 20:28:08,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:08,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:08,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:08,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:08,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:28:08,044 INFO L87 Difference]: Start difference. First operand 2244 states and 3227 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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:28:09,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:28:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:10,151 INFO L93 Difference]: Finished difference Result 4755 states and 6797 transitions. [2022-11-02 20:28:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:28:10,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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) Word has length 292 [2022-11-02 20:28:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:10,156 INFO L225 Difference]: With dead ends: 4755 [2022-11-02 20:28:10,157 INFO L226 Difference]: Without dead ends: 2534 [2022-11-02 20:28:10,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:28:10,160 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 96 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:10,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 402 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-02 20:28:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2022-11-02 20:28:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2304. [2022-11-02 20:28:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2304 states, 2303 states have (on average 1.4259661311333043) internal successors, (3284), 2303 states have internal predecessors, (3284), 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:28:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3284 transitions. [2022-11-02 20:28:10,294 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3284 transitions. Word has length 292 [2022-11-02 20:28:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:10,295 INFO L495 AbstractCegarLoop]: Abstraction has 2304 states and 3284 transitions. [2022-11-02 20:28:10,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 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:28:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3284 transitions. [2022-11-02 20:28:10,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-02 20:28:10,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:10,300 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:10,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:28:10,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-02 20:28:10,516 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1978761974, now seen corresponding path program 1 times [2022-11-02 20:28:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:10,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089857747] [2022-11-02 20:28:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-11-02 20:28:11,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:11,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089857747] [2022-11-02 20:28:11,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089857747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:11,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:11,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:28:11,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313175470] [2022-11-02 20:28:11,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:11,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:28:11,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:11,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:28:11,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:28:11,829 INFO L87 Difference]: Start difference. First operand 2304 states and 3284 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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:28:13,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:28:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:16,353 INFO L93 Difference]: Finished difference Result 6752 states and 9645 transitions. [2022-11-02 20:28:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:28:16,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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) Word has length 292 [2022-11-02 20:28:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:16,365 INFO L225 Difference]: With dead ends: 6752 [2022-11-02 20:28:16,365 INFO L226 Difference]: Without dead ends: 4471 [2022-11-02 20:28:16,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:28:16,369 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 194 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:16,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1230 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-02 20:28:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4471 states. [2022-11-02 20:28:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4471 to 4152. [2022-11-02 20:28:16,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 4151 states have (on average 1.4459166465911828) internal successors, (6002), 4151 states have internal predecessors, (6002), 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:28:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 6002 transitions. [2022-11-02 20:28:16,572 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 6002 transitions. Word has length 292 [2022-11-02 20:28:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:16,573 INFO L495 AbstractCegarLoop]: Abstraction has 4152 states and 6002 transitions. [2022-11-02 20:28:16,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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:28:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 6002 transitions. [2022-11-02 20:28:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-11-02 20:28:16,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:16,581 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:28:16,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-02 20:28:16,582 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:16,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:16,582 INFO L85 PathProgramCache]: Analyzing trace with hash -789789195, now seen corresponding path program 1 times [2022-11-02 20:28:16,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:16,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141956482] [2022-11-02 20:28:16,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:16,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-11-02 20:28:17,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:17,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141956482] [2022-11-02 20:28:17,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141956482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:17,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:17,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:28:17,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106320155] [2022-11-02 20:28:17,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:17,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:17,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:17,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:17,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:28:17,265 INFO L87 Difference]: Start difference. First operand 4152 states and 6002 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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:28:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:18,723 INFO L93 Difference]: Finished difference Result 8403 states and 12119 transitions. [2022-11-02 20:28:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:28:18,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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) Word has length 293 [2022-11-02 20:28:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:18,732 INFO L225 Difference]: With dead ends: 8403 [2022-11-02 20:28:18,732 INFO L226 Difference]: Without dead ends: 4274 [2022-11-02 20:28:18,736 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:28:18,737 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 42 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:18,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 561 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:28:18,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2022-11-02 20:28:18,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 4148. [2022-11-02 20:28:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4148 states, 4147 states have (on average 1.444417651314203) internal successors, (5990), 4147 states have internal predecessors, (5990), 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:28:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4148 states to 4148 states and 5990 transitions. [2022-11-02 20:28:18,951 INFO L78 Accepts]: Start accepts. Automaton has 4148 states and 5990 transitions. Word has length 293 [2022-11-02 20:28:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:18,952 INFO L495 AbstractCegarLoop]: Abstraction has 4148 states and 5990 transitions. [2022-11-02 20:28:18,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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:28:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 4148 states and 5990 transitions. [2022-11-02 20:28:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-11-02 20:28:18,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:18,960 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:18,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-02 20:28:18,961 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:18,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1786575207, now seen corresponding path program 1 times [2022-11-02 20:28:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:18,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702946433] [2022-11-02 20:28:18,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:18,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2022-11-02 20:28:19,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:19,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702946433] [2022-11-02 20:28:19,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702946433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:19,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:19,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:28:19,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708766760] [2022-11-02 20:28:19,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:19,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:19,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:19,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:19,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:28:19,693 INFO L87 Difference]: Start difference. First operand 4148 states and 5990 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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:28:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:21,084 INFO L93 Difference]: Finished difference Result 8391 states and 12091 transitions. [2022-11-02 20:28:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:28:21,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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) Word has length 293 [2022-11-02 20:28:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:21,093 INFO L225 Difference]: With dead ends: 8391 [2022-11-02 20:28:21,093 INFO L226 Difference]: Without dead ends: 4198 [2022-11-02 20:28:21,097 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:28:21,098 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 26 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:21,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 559 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:28:21,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2022-11-02 20:28:21,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 4108. [2022-11-02 20:28:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4108 states, 4107 states have (on average 1.4467981495008522) internal successors, (5942), 4107 states have internal predecessors, (5942), 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:28:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 5942 transitions. [2022-11-02 20:28:21,290 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 5942 transitions. Word has length 293 [2022-11-02 20:28:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:21,290 INFO L495 AbstractCegarLoop]: Abstraction has 4108 states and 5942 transitions. [2022-11-02 20:28:21,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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:28:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 5942 transitions. [2022-11-02 20:28:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2022-11-02 20:28:21,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:21,297 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:21,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-02 20:28:21,298 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:21,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:21,298 INFO L85 PathProgramCache]: Analyzing trace with hash 765728480, now seen corresponding path program 1 times [2022-11-02 20:28:21,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:21,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039016891] [2022-11-02 20:28:21,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:21,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:21,960 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2022-11-02 20:28:21,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:21,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039016891] [2022-11-02 20:28:21,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039016891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:21,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:21,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:28:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643341039] [2022-11-02 20:28:21,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:21,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:21,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:21,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:21,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:28:21,963 INFO L87 Difference]: Start difference. First operand 4108 states and 5942 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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:28:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:23,050 INFO L93 Difference]: Finished difference Result 8283 states and 11967 transitions. [2022-11-02 20:28:23,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:28:23,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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) Word has length 314 [2022-11-02 20:28:23,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:23,058 INFO L225 Difference]: With dead ends: 8283 [2022-11-02 20:28:23,058 INFO L226 Difference]: Without dead ends: 4198 [2022-11-02 20:28:23,062 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:28:23,063 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 27 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:23,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 557 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:28:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2022-11-02 20:28:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 4108. [2022-11-02 20:28:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4108 states, 4107 states have (on average 1.4448502556610665) internal successors, (5934), 4107 states have internal predecessors, (5934), 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:28:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 5934 transitions. [2022-11-02 20:28:23,272 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 5934 transitions. Word has length 314 [2022-11-02 20:28:23,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:23,272 INFO L495 AbstractCegarLoop]: Abstraction has 4108 states and 5934 transitions. [2022-11-02 20:28:23,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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:28:23,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 5934 transitions. [2022-11-02 20:28:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-11-02 20:28:23,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:23,279 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:23,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-02 20:28:23,280 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:23,280 INFO L85 PathProgramCache]: Analyzing trace with hash 109235862, now seen corresponding path program 1 times [2022-11-02 20:28:23,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:23,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218785894] [2022-11-02 20:28:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:23,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 553 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2022-11-02 20:28:23,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:23,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218785894] [2022-11-02 20:28:23,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218785894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:23,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:23,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:28:23,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455311026] [2022-11-02 20:28:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:23,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:23,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:23,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:28:23,941 INFO L87 Difference]: Start difference. First operand 4108 states and 5934 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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:28:25,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:28:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:26,425 INFO L93 Difference]: Finished difference Result 8251 states and 11909 transitions. [2022-11-02 20:28:26,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:28:26,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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) Word has length 315 [2022-11-02 20:28:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:26,434 INFO L225 Difference]: With dead ends: 8251 [2022-11-02 20:28:26,434 INFO L226 Difference]: Without dead ends: 4166 [2022-11-02 20:28:26,438 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:28:26,439 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 21 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:26,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 549 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:28:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2022-11-02 20:28:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4108. [2022-11-02 20:28:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4108 states, 4107 states have (on average 1.4429023618212808) internal successors, (5926), 4107 states have internal predecessors, (5926), 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:28:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 5926 transitions. [2022-11-02 20:28:26,722 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 5926 transitions. Word has length 315 [2022-11-02 20:28:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:26,722 INFO L495 AbstractCegarLoop]: Abstraction has 4108 states and 5926 transitions. [2022-11-02 20:28:26,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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:28:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 5926 transitions. [2022-11-02 20:28:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2022-11-02 20:28:26,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:26,729 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:28:26,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-02 20:28:26,730 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:26,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1142940541, now seen corresponding path program 1 times [2022-11-02 20:28:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:26,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715917116] [2022-11-02 20:28:26,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:26,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 597 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2022-11-02 20:28:27,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:27,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715917116] [2022-11-02 20:28:27,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715917116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:27,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:27,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:28:27,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346439563] [2022-11-02 20:28:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:27,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:27,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:27,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:27,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:28:27,343 INFO L87 Difference]: Start difference. First operand 4108 states and 5926 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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:28:28,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:28:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:29,113 INFO L93 Difference]: Finished difference Result 8219 states and 11853 transitions. [2022-11-02 20:28:29,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:28:29,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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) Word has length 316 [2022-11-02 20:28:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:29,119 INFO L225 Difference]: With dead ends: 8219 [2022-11-02 20:28:29,119 INFO L226 Difference]: Without dead ends: 4102 [2022-11-02 20:28:29,123 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:28:29,123 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 15 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:29,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 541 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:28:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2022-11-02 20:28:29,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 4076. [2022-11-02 20:28:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4076 states, 4075 states have (on average 1.4444171779141104) internal successors, (5886), 4075 states have internal predecessors, (5886), 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:28:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 5886 transitions. [2022-11-02 20:28:29,431 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 5886 transitions. Word has length 316 [2022-11-02 20:28:29,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:29,432 INFO L495 AbstractCegarLoop]: Abstraction has 4076 states and 5886 transitions. [2022-11-02 20:28:29,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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:28:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 5886 transitions. [2022-11-02 20:28:29,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-11-02 20:28:29,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:29,441 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:29,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-02 20:28:29,441 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:29,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:29,442 INFO L85 PathProgramCache]: Analyzing trace with hash -848179772, now seen corresponding path program 1 times [2022-11-02 20:28:29,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:29,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843950370] [2022-11-02 20:28:29,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:29,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 905 trivial. 0 not checked. [2022-11-02 20:28:32,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:32,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843950370] [2022-11-02 20:28:32,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843950370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:32,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:32,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:28:32,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233071114] [2022-11-02 20:28:32,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:32,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:28:32,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:32,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:28:32,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:28:32,676 INFO L87 Difference]: Start difference. First operand 4076 states and 5886 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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:28:34,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:28:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:36,052 INFO L93 Difference]: Finished difference Result 8149 states and 11768 transitions. [2022-11-02 20:28:36,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:28:36,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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) Word has length 321 [2022-11-02 20:28:36,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:36,058 INFO L225 Difference]: With dead ends: 8149 [2022-11-02 20:28:36,058 INFO L226 Difference]: Without dead ends: 4076 [2022-11-02 20:28:36,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:28:36,066 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 7 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:36,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 655 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-11-02 20:28:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2022-11-02 20:28:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 4076. [2022-11-02 20:28:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4076 states, 4075 states have (on average 1.4441717791411044) internal successors, (5885), 4075 states have internal predecessors, (5885), 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:28:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 5885 transitions. [2022-11-02 20:28:36,298 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 5885 transitions. Word has length 321 [2022-11-02 20:28:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:36,298 INFO L495 AbstractCegarLoop]: Abstraction has 4076 states and 5885 transitions. [2022-11-02 20:28:36,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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:28:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 5885 transitions. [2022-11-02 20:28:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-11-02 20:28:36,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:36,307 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:36,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-02 20:28:36,308 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:36,309 INFO L85 PathProgramCache]: Analyzing trace with hash -746809786, now seen corresponding path program 1 times [2022-11-02 20:28:36,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:36,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711845835] [2022-11-02 20:28:36,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:36,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 375 proven. 491 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 20:28:46,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:46,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711845835] [2022-11-02 20:28:46,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711845835] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:28:46,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007843337] [2022-11-02 20:28:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:46,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:46,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:46,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:28:46,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:28:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:47,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 1631 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-02 20:28:47,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:28:47,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:28:48,028 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:28:48,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 10 [2022-11-02 20:28:48,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-02 20:28:48,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:28:48,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2022-11-02 20:28:48,206 INFO L356 Elim1Store]: treesize reduction 66, result has 42.1 percent of original size [2022-11-02 20:28:48,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 60 [2022-11-02 20:28:48,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 72 [2022-11-02 20:28:49,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-11-02 20:28:49,337 INFO L356 Elim1Store]: treesize reduction 119, result has 15.0 percent of original size [2022-11-02 20:28:49,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2022-11-02 20:28:49,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-02 20:28:49,473 INFO L356 Elim1Store]: treesize reduction 71, result has 37.7 percent of original size [2022-11-02 20:28:49,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 68 [2022-11-02 20:28:49,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 67 [2022-11-02 20:28:49,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 67 [2022-11-02 20:28:50,587 INFO L356 Elim1Store]: treesize reduction 52, result has 49.5 percent of original size [2022-11-02 20:28:50,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 155 [2022-11-02 20:28:50,662 INFO L356 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2022-11-02 20:28:50,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 132 [2022-11-02 20:28:50,746 INFO L356 Elim1Store]: treesize reduction 43, result has 53.8 percent of original size [2022-11-02 20:28:50,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 73 [2022-11-02 20:28:51,934 INFO L356 Elim1Store]: treesize reduction 136, result has 32.0 percent of original size [2022-11-02 20:28:51,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 281 treesize of output 318 [2022-11-02 20:28:51,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 267 [2022-11-02 20:28:51,968 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:28:51,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 267 [2022-11-02 20:28:58,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 224 [2022-11-02 20:28:58,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 224 [2022-11-02 20:28:58,634 INFO L356 Elim1Store]: treesize reduction 71, result has 37.7 percent of original size [2022-11-02 20:28:58,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 276 treesize of output 288 [2022-11-02 20:28:59,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 117 [2022-11-02 20:28:59,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 71 [2022-11-02 20:28:59,067 INFO L356 Elim1Store]: treesize reduction 77, result has 28.0 percent of original size [2022-11-02 20:28:59,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 71 [2022-11-02 20:28:59,152 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:28:59,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2022-11-02 20:28:59,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:28:59,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 11 [2022-11-02 20:28:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 456 proven. 328 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-02 20:28:59,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:29:04,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 198 [2022-11-02 20:29:04,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 142 [2022-11-02 20:29:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 581 proven. 141 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-11-02 20:29:08,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007843337] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:29:08,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:29:08,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 14] total 43 [2022-11-02 20:29:08,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810321965] [2022-11-02 20:29:08,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:29:08,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-02 20:29:08,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:08,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-02 20:29:08,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1534, Unknown=0, NotChecked=0, Total=1806 [2022-11-02 20:29:08,777 INFO L87 Difference]: Start difference. First operand 4076 states and 5885 transitions. Second operand has 43 states, 43 states have (on average 12.790697674418604) internal successors, (550), 43 states have internal predecessors, (550), 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:29:10,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:29:12,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:29:13,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:29:16,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:29:19,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:29:54,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:54,479 INFO L93 Difference]: Finished difference Result 19535 states and 27321 transitions. [2022-11-02 20:29:54,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2022-11-02 20:29:54,480 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 12.790697674418604) internal successors, (550), 43 states have internal predecessors, (550), 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) Word has length 321 [2022-11-02 20:29:54,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:54,492 INFO L225 Difference]: With dead ends: 19535 [2022-11-02 20:29:54,492 INFO L226 Difference]: Without dead ends: 15482 [2022-11-02 20:29:54,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 728 SyntacticMatches, 11 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19391 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=5161, Invalid=45239, Unknown=0, NotChecked=0, Total=50400 [2022-11-02 20:29:54,499 INFO L413 NwaCegarLoop]: 664 mSDtfsCounter, 3190 mSDsluCounter, 11732 mSDsCounter, 0 mSdLazyCounter, 12178 mSolverCounterSat, 627 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3190 SdHoareTripleChecker+Valid, 12396 SdHoareTripleChecker+Invalid, 15208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 12178 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 2401 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:54,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3190 Valid, 12396 Invalid, 15208 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [627 Valid, 12178 Invalid, 2 Unknown, 2401 Unchecked, 29.1s Time] [2022-11-02 20:29:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15482 states. [2022-11-02 20:29:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15482 to 7242. [2022-11-02 20:29:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7242 states, 7241 states have (on average 1.42411269161718) internal successors, (10312), 7241 states have internal predecessors, (10312), 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:29:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 10312 transitions. [2022-11-02 20:29:54,917 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 10312 transitions. Word has length 321 [2022-11-02 20:29:54,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:54,917 INFO L495 AbstractCegarLoop]: Abstraction has 7242 states and 10312 transitions. [2022-11-02 20:29:54,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 12.790697674418604) internal successors, (550), 43 states have internal predecessors, (550), 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:29:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 10312 transitions. [2022-11-02 20:29:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-11-02 20:29:54,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:54,927 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:54,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:29:55,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_407629ac-6c6f-4336-ab09-a1f135eee526/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-11-02 20:29:55,140 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:55,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:55,141 INFO L85 PathProgramCache]: Analyzing trace with hash -279033548, now seen corresponding path program 1 times [2022-11-02 20:29:55,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:55,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222744607] [2022-11-02 20:29:55,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:55,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat