./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl-simplified/s3_clnt_1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/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_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl-simplified/s3_clnt_1.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/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_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/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 9d22078cc0ed1f6555ed02c6ceb2e5694208de3c10c4e0f5a14ad82c4e25bb79 --- 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:29:46,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:29:46,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:29:46,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:29:46,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:29:46,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:29:46,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:29:46,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:29:46,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:29:46,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:29:46,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:29:46,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:29:46,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:29:46,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:29:46,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:29:46,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:29:46,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:29:46,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:29:46,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:29:46,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:29:46,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:29:46,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:29:46,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:29:46,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:29:46,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:29:46,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:29:46,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:29:46,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:29:46,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:29:46,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:29:46,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:29:46,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:29:46,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:29:46,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:29:46,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:29:46,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:29:46,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:29:46,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:29:46,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:29:46,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:29:46,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:29:46,954 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:29:46,990 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:29:46,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:29:46,991 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:29:46,991 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:29:46,992 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:29:46,992 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:29:46,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:29:46,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:29:46,993 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:29:46,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:29:46,994 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:29:46,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:29:46,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:29:46,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:29:46,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:29:46,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:29:46,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:29:46,995 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:29:46,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:29:46,996 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:29:46,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:29:46,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:29:46,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:29:46,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:29:46,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:29:46,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:29:46,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:29:46,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:29:46,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:29:46,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:29:46,999 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:29:46,999 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:29:47,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:29:47,000 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_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/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_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/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 -> 9d22078cc0ed1f6555ed02c6ceb2e5694208de3c10c4e0f5a14ad82c4e25bb79 [2022-11-02 20:29:47,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:29:47,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:29:47,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:29:47,331 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:29:47,332 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:29:47,333 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl-simplified/s3_clnt_1.cil-1.c [2022-11-02 20:29:47,411 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/data/a76f66dd0/687189fff9f84906bd43142bc2e34749/FLAGc1099ef48 [2022-11-02 20:29:47,899 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:29:47,905 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/sv-benchmarks/c/openssl-simplified/s3_clnt_1.cil-1.c [2022-11-02 20:29:47,922 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/data/a76f66dd0/687189fff9f84906bd43142bc2e34749/FLAGc1099ef48 [2022-11-02 20:29:48,241 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/data/a76f66dd0/687189fff9f84906bd43142bc2e34749 [2022-11-02 20:29:48,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:29:48,247 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:29:48,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:29:48,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:29:48,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:29:48,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:29:48" (1/1) ... [2022-11-02 20:29:48,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa8f015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:48, skipping insertion in model container [2022-11-02 20:29:48,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:29:48" (1/1) ... [2022-11-02 20:29:48,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:29:48,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:29:48,555 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_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/sv-benchmarks/c/openssl-simplified/s3_clnt_1.cil-1.c[35497,35510] [2022-11-02 20:29:48,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:29:48,570 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:29:48,618 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_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/sv-benchmarks/c/openssl-simplified/s3_clnt_1.cil-1.c[35497,35510] [2022-11-02 20:29:48,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:29:48,634 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:29:48,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:48 WrapperNode [2022-11-02 20:29:48,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:29:48,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:29:48,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:29:48,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:29:48,648 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:29:48" (1/1) ... [2022-11-02 20:29:48,676 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:29:48" (1/1) ... [2022-11-02 20:29:48,707 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 506 [2022-11-02 20:29:48,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:29:48,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:29:48,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:29:48,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:29:48,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:48" (1/1) ... [2022-11-02 20:29:48,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:48" (1/1) ... [2022-11-02 20:29:48,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:48" (1/1) ... [2022-11-02 20:29:48,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:48" (1/1) ... [2022-11-02 20:29:48,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:48" (1/1) ... [2022-11-02 20:29:48,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:48" (1/1) ... [2022-11-02 20:29:48,734 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:48" (1/1) ... [2022-11-02 20:29:48,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:48" (1/1) ... [2022-11-02 20:29:48,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:29:48,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:29:48,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:29:48,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:29:48,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:48" (1/1) ... [2022-11-02 20:29:48,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:29:48,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:29:48,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:29:48,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:29:48,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:29:48,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:29:48,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:29:48,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:29:48,920 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:29:48,923 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:29:48,940 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:29:49,536 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-11-02 20:29:49,536 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-11-02 20:29:49,536 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:29:49,544 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:29:49,547 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:29:49,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:29:49 BoogieIcfgContainer [2022-11-02 20:29:49,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:29:49,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:29:49,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:29:49,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:29:49,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:29:48" (1/3) ... [2022-11-02 20:29:49,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10467892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:29:49, skipping insertion in model container [2022-11-02 20:29:49,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:29:48" (2/3) ... [2022-11-02 20:29:49,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10467892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:29:49, skipping insertion in model container [2022-11-02 20:29:49,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:29:49" (3/3) ... [2022-11-02 20:29:49,559 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2022-11-02 20:29:49,578 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:29:49,578 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:29:49,637 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:29:49,643 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;@3d90e9e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:29:49,643 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:29:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 125 states have (on average 1.72) internal successors, (215), 126 states have internal predecessors, (215), 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:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:29:49,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:49,656 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] [2022-11-02 20:29:49,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:49,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:49,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1457700990, now seen corresponding path program 1 times [2022-11-02 20:29:49,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:49,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412045639] [2022-11-02 20:29:49,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:49,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:50,140 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:29:50,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:50,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412045639] [2022-11-02 20:29:50,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412045639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:50,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:50,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:50,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973235041] [2022-11-02 20:29:50,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:50,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:50,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:50,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:50,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:50,191 INFO L87 Difference]: Start difference. First operand has 127 states, 125 states have (on average 1.72) internal successors, (215), 126 states have internal predecessors, (215), 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 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:50,324 INFO L93 Difference]: Finished difference Result 363 states and 617 transitions. [2022-11-02 20:29:50,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:50,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-11-02 20:29:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:50,357 INFO L225 Difference]: With dead ends: 363 [2022-11-02 20:29:50,357 INFO L226 Difference]: Without dead ends: 211 [2022-11-02 20:29:50,361 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:29:50,365 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 178 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:50,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 396 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-02 20:29:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-11-02 20:29:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.5) internal successors, (315), 210 states have internal predecessors, (315), 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:50,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 315 transitions. [2022-11-02 20:29:50,447 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 315 transitions. Word has length 24 [2022-11-02 20:29:50,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:50,447 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 315 transitions. [2022-11-02 20:29:50,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 315 transitions. [2022-11-02 20:29:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:29:50,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:50,450 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] [2022-11-02 20:29:50,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:29:50,450 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:50,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash 152202379, now seen corresponding path program 1 times [2022-11-02 20:29:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:50,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752994713] [2022-11-02 20:29:50,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:50,585 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:29:50,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:50,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752994713] [2022-11-02 20:29:50,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752994713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:50,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:50,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:50,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953861845] [2022-11-02 20:29:50,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:50,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:50,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:50,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:50,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:50,590 INFO L87 Difference]: Start difference. First operand 211 states and 315 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:50,726 INFO L93 Difference]: Finished difference Result 340 states and 513 transitions. [2022-11-02 20:29:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2022-11-02 20:29:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:50,728 INFO L225 Difference]: With dead ends: 340 [2022-11-02 20:29:50,729 INFO L226 Difference]: Without dead ends: 236 [2022-11-02 20:29:50,729 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:29:50,731 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 14 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:50,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 258 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-02 20:29:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 228. [2022-11-02 20:29:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.4845814977973568) internal successors, (337), 227 states have internal predecessors, (337), 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:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 337 transitions. [2022-11-02 20:29:50,744 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 337 transitions. Word has length 38 [2022-11-02 20:29:50,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:50,745 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 337 transitions. [2022-11-02 20:29:50,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 337 transitions. [2022-11-02 20:29:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-02 20:29:50,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:50,747 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:29:50,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:29:50,748 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:50,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1281794544, now seen corresponding path program 1 times [2022-11-02 20:29:50,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:50,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498511329] [2022-11-02 20:29:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:50,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:29:50,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:50,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498511329] [2022-11-02 20:29:50,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498511329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:50,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:50,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254773733] [2022-11-02 20:29:50,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:50,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:50,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:50,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:50,886 INFO L87 Difference]: Start difference. First operand 228 states and 337 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:51,106 INFO L93 Difference]: Finished difference Result 551 states and 841 transitions. [2022-11-02 20:29:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:51,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 55 [2022-11-02 20:29:51,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:51,108 INFO L225 Difference]: With dead ends: 551 [2022-11-02 20:29:51,109 INFO L226 Difference]: Without dead ends: 328 [2022-11-02 20:29:51,112 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:29:51,119 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:51,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 222 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:29:51,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-02 20:29:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 310. [2022-11-02 20:29:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4142394822006472) internal successors, (437), 309 states have internal predecessors, (437), 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:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2022-11-02 20:29:51,153 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 55 [2022-11-02 20:29:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:51,154 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2022-11-02 20:29:51,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:51,154 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2022-11-02 20:29:51,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-02 20:29:51,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:51,157 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-11-02 20:29:51,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:29:51,157 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:51,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1258017753, now seen corresponding path program 1 times [2022-11-02 20:29:51,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:51,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630172855] [2022-11-02 20:29:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:51,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:29:51,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:51,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630172855] [2022-11-02 20:29:51,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630172855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:51,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:51,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:51,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778876163] [2022-11-02 20:29:51,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:51,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:51,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:51,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:51,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:51,236 INFO L87 Difference]: Start difference. First operand 310 states and 437 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:51,374 INFO L93 Difference]: Finished difference Result 659 states and 942 transitions. [2022-11-02 20:29:51,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:51,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 68 [2022-11-02 20:29:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:51,377 INFO L225 Difference]: With dead ends: 659 [2022-11-02 20:29:51,377 INFO L226 Difference]: Without dead ends: 356 [2022-11-02 20:29:51,378 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:29:51,381 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 14 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:51,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 261 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:51,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-11-02 20:29:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 348. [2022-11-02 20:29:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.3976945244956773) internal successors, (485), 347 states have internal predecessors, (485), 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:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 485 transitions. [2022-11-02 20:29:51,402 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 485 transitions. Word has length 68 [2022-11-02 20:29:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:51,403 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 485 transitions. [2022-11-02 20:29:51,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 485 transitions. [2022-11-02 20:29:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-02 20:29:51,406 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:51,407 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2022-11-02 20:29:51,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:29:51,407 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:51,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash 181274982, now seen corresponding path program 1 times [2022-11-02 20:29:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:51,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131098506] [2022-11-02 20:29:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:29:51,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:51,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131098506] [2022-11-02 20:29:51,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131098506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:51,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:51,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:51,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953820020] [2022-11-02 20:29:51,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:51,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:51,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:51,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:51,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:51,477 INFO L87 Difference]: Start difference. First operand 348 states and 485 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:51,660 INFO L93 Difference]: Finished difference Result 828 states and 1180 transitions. [2022-11-02 20:29:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:51,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 81 [2022-11-02 20:29:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:51,663 INFO L225 Difference]: With dead ends: 828 [2022-11-02 20:29:51,663 INFO L226 Difference]: Without dead ends: 485 [2022-11-02 20:29:51,664 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:29:51,665 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 126 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:51,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 172 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:29:51,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-11-02 20:29:51,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 459. [2022-11-02 20:29:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.4323144104803494) internal successors, (656), 458 states have internal predecessors, (656), 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:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 656 transitions. [2022-11-02 20:29:51,679 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 656 transitions. Word has length 81 [2022-11-02 20:29:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:51,684 INFO L495 AbstractCegarLoop]: Abstraction has 459 states and 656 transitions. [2022-11-02 20:29:51,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 656 transitions. [2022-11-02 20:29:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-02 20:29:51,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:51,686 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:29:51,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:29:51,686 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:51,693 INFO L85 PathProgramCache]: Analyzing trace with hash -901961809, now seen corresponding path program 1 times [2022-11-02 20:29:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:51,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248083369] [2022-11-02 20:29:51,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:51,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-02 20:29:51,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:51,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248083369] [2022-11-02 20:29:51,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248083369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:51,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:51,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:51,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586001484] [2022-11-02 20:29:51,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:51,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:51,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:51,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:51,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:51,777 INFO L87 Difference]: Start difference. First operand 459 states and 656 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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:29:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:51,909 INFO L93 Difference]: Finished difference Result 926 states and 1341 transitions. [2022-11-02 20:29:51,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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 84 [2022-11-02 20:29:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:51,912 INFO L225 Difference]: With dead ends: 926 [2022-11-02 20:29:51,912 INFO L226 Difference]: Without dead ends: 507 [2022-11-02 20:29:51,913 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:29:51,913 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:51,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 260 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-11-02 20:29:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 501. [2022-11-02 20:29:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.416) internal successors, (708), 500 states have internal predecessors, (708), 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:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 708 transitions. [2022-11-02 20:29:51,928 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 708 transitions. Word has length 84 [2022-11-02 20:29:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:51,929 INFO L495 AbstractCegarLoop]: Abstraction has 501 states and 708 transitions. [2022-11-02 20:29:51,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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:29:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 708 transitions. [2022-11-02 20:29:51,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 20:29:51,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:51,931 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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:29:51,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:29:51,932 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1810291289, now seen corresponding path program 1 times [2022-11-02 20:29:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:51,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376927604] [2022-11-02 20:29:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:29:52,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:52,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376927604] [2022-11-02 20:29:52,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376927604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:52,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:52,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:52,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142245572] [2022-11-02 20:29:52,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:52,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:52,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:52,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:52,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:52,101 INFO L87 Difference]: Start difference. First operand 501 states and 708 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:29:52,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:52,140 INFO L93 Difference]: Finished difference Result 980 states and 1398 transitions. [2022-11-02 20:29:52,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:52,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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 104 [2022-11-02 20:29:52,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:52,145 INFO L225 Difference]: With dead ends: 980 [2022-11-02 20:29:52,146 INFO L226 Difference]: Without dead ends: 739 [2022-11-02 20:29:52,147 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:29:52,148 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 125 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:52,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 464 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:29:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-11-02 20:29:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2022-11-02 20:29:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.4173441734417345) internal successors, (1046), 738 states have internal predecessors, (1046), 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:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1046 transitions. [2022-11-02 20:29:52,168 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1046 transitions. Word has length 104 [2022-11-02 20:29:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:52,169 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 1046 transitions. [2022-11-02 20:29:52,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:29:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1046 transitions. [2022-11-02 20:29:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-02 20:29:52,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:52,171 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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:29:52,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:29:52,172 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:52,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash 151283369, now seen corresponding path program 1 times [2022-11-02 20:29:52,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:52,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225613608] [2022-11-02 20:29:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:52,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-02 20:29:52,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:52,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225613608] [2022-11-02 20:29:52,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225613608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:52,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:52,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:52,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392640614] [2022-11-02 20:29:52,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:52,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:52,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:52,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:52,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:52,224 INFO L87 Difference]: Start difference. First operand 739 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:52,258 INFO L93 Difference]: Finished difference Result 1239 states and 1758 transitions. [2022-11-02 20:29:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:52,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 104 [2022-11-02 20:29:52,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:52,262 INFO L225 Difference]: With dead ends: 1239 [2022-11-02 20:29:52,262 INFO L226 Difference]: Without dead ends: 760 [2022-11-02 20:29:52,263 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:29:52,263 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 11 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:52,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 345 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:29:52,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-11-02 20:29:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2022-11-02 20:29:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 1.4137022397891963) internal successors, (1073), 759 states have internal predecessors, (1073), 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:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1073 transitions. [2022-11-02 20:29:52,284 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1073 transitions. Word has length 104 [2022-11-02 20:29:52,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:52,285 INFO L495 AbstractCegarLoop]: Abstraction has 760 states and 1073 transitions. [2022-11-02 20:29:52,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1073 transitions. [2022-11-02 20:29:52,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 20:29:52,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:52,287 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1] [2022-11-02 20:29:52,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:29:52,288 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:52,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:52,288 INFO L85 PathProgramCache]: Analyzing trace with hash -492994255, now seen corresponding path program 1 times [2022-11-02 20:29:52,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:52,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958957913] [2022-11-02 20:29:52,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:52,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-02 20:29:52,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:52,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958957913] [2022-11-02 20:29:52,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958957913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:52,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:52,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:52,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309329317] [2022-11-02 20:29:52,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:52,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:52,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:52,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:52,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:52,368 INFO L87 Difference]: Start difference. First operand 760 states and 1073 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:52,429 INFO L93 Difference]: Finished difference Result 1001 states and 1419 transitions. [2022-11-02 20:29:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 106 [2022-11-02 20:29:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:52,433 INFO L225 Difference]: With dead ends: 1001 [2022-11-02 20:29:52,433 INFO L226 Difference]: Without dead ends: 999 [2022-11-02 20:29:52,434 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:29:52,436 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 138 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:52,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 303 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:29:52,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-11-02 20:29:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 999. [2022-11-02 20:29:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 998 states have (on average 1.4198396793587174) internal successors, (1417), 998 states have internal predecessors, (1417), 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:52,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1417 transitions. [2022-11-02 20:29:52,471 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1417 transitions. Word has length 106 [2022-11-02 20:29:52,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:52,471 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 1417 transitions. [2022-11-02 20:29:52,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:52,471 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1417 transitions. [2022-11-02 20:29:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-02 20:29:52,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:52,474 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:52,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:29:52,474 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:52,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1913560025, now seen corresponding path program 1 times [2022-11-02 20:29:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:52,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311133460] [2022-11-02 20:29:52,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:52,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-02 20:29:52,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:52,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311133460] [2022-11-02 20:29:52,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311133460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:52,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:52,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:52,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35935402] [2022-11-02 20:29:52,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:52,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:52,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:52,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:52,553 INFO L87 Difference]: Start difference. First operand 999 states and 1417 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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:52,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:52,685 INFO L93 Difference]: Finished difference Result 2064 states and 2956 transitions. [2022-11-02 20:29:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:52,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 131 [2022-11-02 20:29:52,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:52,690 INFO L225 Difference]: With dead ends: 2064 [2022-11-02 20:29:52,690 INFO L226 Difference]: Without dead ends: 1105 [2022-11-02 20:29:52,691 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:29:52,692 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:52,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 259 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2022-11-02 20:29:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1091. [2022-11-02 20:29:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1090 states have (on average 1.4027522935779817) internal successors, (1529), 1090 states have internal predecessors, (1529), 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:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1529 transitions. [2022-11-02 20:29:52,723 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1529 transitions. Word has length 131 [2022-11-02 20:29:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:52,723 INFO L495 AbstractCegarLoop]: Abstraction has 1091 states and 1529 transitions. [2022-11-02 20:29:52,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1529 transitions. [2022-11-02 20:29:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-11-02 20:29:52,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:52,726 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:52,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:29:52,727 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:52,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:52,728 INFO L85 PathProgramCache]: Analyzing trace with hash 296450083, now seen corresponding path program 1 times [2022-11-02 20:29:52,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:52,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750753445] [2022-11-02 20:29:52,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:52,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-11-02 20:29:52,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:52,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750753445] [2022-11-02 20:29:52,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750753445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:52,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:52,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:52,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083019688] [2022-11-02 20:29:52,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:52,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:52,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:52,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:52,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:52,825 INFO L87 Difference]: Start difference. First operand 1091 states and 1529 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:29:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:52,987 INFO L93 Difference]: Finished difference Result 2346 states and 3350 transitions. [2022-11-02 20:29:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:52,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 152 [2022-11-02 20:29:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:52,992 INFO L225 Difference]: With dead ends: 2346 [2022-11-02 20:29:52,992 INFO L226 Difference]: Without dead ends: 1287 [2022-11-02 20:29:52,993 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:29:52,994 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 66 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:52,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 211 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:52,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2022-11-02 20:29:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1247. [2022-11-02 20:29:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 1246 states have (on average 1.4069020866773676) internal successors, (1753), 1246 states have internal predecessors, (1753), 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:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1753 transitions. [2022-11-02 20:29:53,028 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1753 transitions. Word has length 152 [2022-11-02 20:29:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:53,028 INFO L495 AbstractCegarLoop]: Abstraction has 1247 states and 1753 transitions. [2022-11-02 20:29:53,028 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:29:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1753 transitions. [2022-11-02 20:29:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-11-02 20:29:53,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:53,032 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:53,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:29:53,032 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:53,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:53,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2080513012, now seen corresponding path program 1 times [2022-11-02 20:29:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:53,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963918497] [2022-11-02 20:29:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-11-02 20:29:53,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:53,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963918497] [2022-11-02 20:29:53,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963918497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:53,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:53,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:53,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032272468] [2022-11-02 20:29:53,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:53,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:53,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:53,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:53,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:53,129 INFO L87 Difference]: Start difference. First operand 1247 states and 1753 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:53,253 INFO L93 Difference]: Finished difference Result 2574 states and 3602 transitions. [2022-11-02 20:29:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:53,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 188 [2022-11-02 20:29:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:53,258 INFO L225 Difference]: With dead ends: 2574 [2022-11-02 20:29:53,258 INFO L226 Difference]: Without dead ends: 1367 [2022-11-02 20:29:53,262 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:29:53,263 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:53,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 260 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:53,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-11-02 20:29:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1359. [2022-11-02 20:29:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1358 states have (on average 1.3880706921944035) internal successors, (1885), 1358 states have internal predecessors, (1885), 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:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1885 transitions. [2022-11-02 20:29:53,323 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1885 transitions. Word has length 188 [2022-11-02 20:29:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:53,324 INFO L495 AbstractCegarLoop]: Abstraction has 1359 states and 1885 transitions. [2022-11-02 20:29:53,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1885 transitions. [2022-11-02 20:29:53,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-11-02 20:29:53,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:53,329 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:53,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:29:53,330 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:53,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:53,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1653754506, now seen corresponding path program 1 times [2022-11-02 20:29:53,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:53,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195330656] [2022-11-02 20:29:53,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:53,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-11-02 20:29:53,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:53,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195330656] [2022-11-02 20:29:53,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195330656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:53,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:53,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:53,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905588323] [2022-11-02 20:29:53,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:53,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:53,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:53,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:53,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:53,426 INFO L87 Difference]: Start difference. First operand 1359 states and 1885 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:53,569 INFO L93 Difference]: Finished difference Result 2814 states and 3902 transitions. [2022-11-02 20:29:53,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:53,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 188 [2022-11-02 20:29:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:53,574 INFO L225 Difference]: With dead ends: 2814 [2022-11-02 20:29:53,574 INFO L226 Difference]: Without dead ends: 1495 [2022-11-02 20:29:53,576 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:29:53,577 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:53,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 261 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:53,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-11-02 20:29:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1483. [2022-11-02 20:29:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1482 states have (on average 1.3690958164642375) internal successors, (2029), 1482 states have internal predecessors, (2029), 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:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 2029 transitions. [2022-11-02 20:29:53,624 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 2029 transitions. Word has length 188 [2022-11-02 20:29:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:53,625 INFO L495 AbstractCegarLoop]: Abstraction has 1483 states and 2029 transitions. [2022-11-02 20:29:53,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2029 transitions. [2022-11-02 20:29:53,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-11-02 20:29:53,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:53,629 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:53,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:29:53,630 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1229348372, now seen corresponding path program 1 times [2022-11-02 20:29:53,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:53,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567283560] [2022-11-02 20:29:53,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:53,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-11-02 20:29:53,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:53,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567283560] [2022-11-02 20:29:53,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567283560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:53,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:53,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:53,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558225920] [2022-11-02 20:29:53,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:53,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:53,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:53,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:53,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:53,751 INFO L87 Difference]: Start difference. First operand 1483 states and 2029 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:53,822 INFO L93 Difference]: Finished difference Result 4365 states and 5987 transitions. [2022-11-02 20:29:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:53,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 218 [2022-11-02 20:29:53,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:53,851 INFO L225 Difference]: With dead ends: 4365 [2022-11-02 20:29:53,852 INFO L226 Difference]: Without dead ends: 2922 [2022-11-02 20:29:53,853 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:29:53,854 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 126 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:53,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 482 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:29:53,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-11-02 20:29:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2920. [2022-11-02 20:29:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2919 states have (on average 1.3706748886605002) internal successors, (4001), 2919 states have internal predecessors, (4001), 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:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4001 transitions. [2022-11-02 20:29:53,943 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4001 transitions. Word has length 218 [2022-11-02 20:29:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:53,944 INFO L495 AbstractCegarLoop]: Abstraction has 2920 states and 4001 transitions. [2022-11-02 20:29:53,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4001 transitions. [2022-11-02 20:29:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-11-02 20:29:53,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:53,951 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:53,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:29:53,951 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:53,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:53,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1790048150, now seen corresponding path program 1 times [2022-11-02 20:29:53,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:53,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90422993] [2022-11-02 20:29:53,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:53,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-11-02 20:29:54,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:54,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90422993] [2022-11-02 20:29:54,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90422993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:54,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:54,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:54,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473975503] [2022-11-02 20:29:54,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:54,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:54,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:54,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:54,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:54,048 INFO L87 Difference]: Start difference. First operand 2920 states and 4001 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:54,218 INFO L93 Difference]: Finished difference Result 6100 states and 8366 transitions. [2022-11-02 20:29:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:54,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 218 [2022-11-02 20:29:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:54,228 INFO L225 Difference]: With dead ends: 6100 [2022-11-02 20:29:54,229 INFO L226 Difference]: Without dead ends: 3220 [2022-11-02 20:29:54,232 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:29:54,233 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:54,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 261 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2022-11-02 20:29:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 3204. [2022-11-02 20:29:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 3203 states have (on average 1.3502965969403684) internal successors, (4325), 3203 states have internal predecessors, (4325), 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,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 4325 transitions. [2022-11-02 20:29:54,346 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 4325 transitions. Word has length 218 [2022-11-02 20:29:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:54,346 INFO L495 AbstractCegarLoop]: Abstraction has 3204 states and 4325 transitions. [2022-11-02 20:29:54,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 4325 transitions. [2022-11-02 20:29:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-11-02 20:29:54,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:54,354 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:54,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:29:54,355 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:54,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:54,355 INFO L85 PathProgramCache]: Analyzing trace with hash 678419774, now seen corresponding path program 1 times [2022-11-02 20:29:54,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:54,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882883340] [2022-11-02 20:29:54,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:54,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2022-11-02 20:29:54,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:54,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882883340] [2022-11-02 20:29:54,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882883340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:54,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:54,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:54,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307610682] [2022-11-02 20:29:54,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:54,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:54,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:54,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:54,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:54,443 INFO L87 Difference]: Start difference. First operand 3204 states and 4325 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:54,610 INFO L93 Difference]: Finished difference Result 6516 states and 8798 transitions. [2022-11-02 20:29:54,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:54,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 242 [2022-11-02 20:29:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:54,621 INFO L225 Difference]: With dead ends: 6516 [2022-11-02 20:29:54,621 INFO L226 Difference]: Without dead ends: 3352 [2022-11-02 20:29:54,625 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:29:54,626 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:54,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 260 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2022-11-02 20:29:54,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 3336. [2022-11-02 20:29:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3335 states have (on average 1.3424287856071964) internal successors, (4477), 3335 states have internal predecessors, (4477), 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,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4477 transitions. [2022-11-02 20:29:54,755 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4477 transitions. Word has length 242 [2022-11-02 20:29:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:54,756 INFO L495 AbstractCegarLoop]: Abstraction has 3336 states and 4477 transitions. [2022-11-02 20:29:54,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4477 transitions. [2022-11-02 20:29:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-11-02 20:29:54,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:54,764 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:54,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:29:54,764 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:54,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:54,764 INFO L85 PathProgramCache]: Analyzing trace with hash -101941725, now seen corresponding path program 1 times [2022-11-02 20:29:54,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:54,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493703537] [2022-11-02 20:29:54,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:54,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:29:54,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:54,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493703537] [2022-11-02 20:29:54,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493703537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:54,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:54,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:54,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171005418] [2022-11-02 20:29:54,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:54,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:54,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:54,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:54,901 INFO L87 Difference]: Start difference. First operand 3336 states and 4477 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:55,099 INFO L93 Difference]: Finished difference Result 7032 states and 9578 transitions. [2022-11-02 20:29:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:55,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 253 [2022-11-02 20:29:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:55,111 INFO L225 Difference]: With dead ends: 7032 [2022-11-02 20:29:55,111 INFO L226 Difference]: Without dead ends: 3736 [2022-11-02 20:29:55,115 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:29:55,116 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:55,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 253 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2022-11-02 20:29:55,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3648. [2022-11-02 20:29:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3648 states, 3647 states have (on average 1.3284891691801481) internal successors, (4845), 3647 states have internal predecessors, (4845), 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:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 4845 transitions. [2022-11-02 20:29:55,285 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 4845 transitions. Word has length 253 [2022-11-02 20:29:55,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:55,285 INFO L495 AbstractCegarLoop]: Abstraction has 3648 states and 4845 transitions. [2022-11-02 20:29:55,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 4845 transitions. [2022-11-02 20:29:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-11-02 20:29:55,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:55,296 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:55,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:29:55,296 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:55,297 INFO L85 PathProgramCache]: Analyzing trace with hash 324455461, now seen corresponding path program 1 times [2022-11-02 20:29:55,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:55,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777642913] [2022-11-02 20:29:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:29:55,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:55,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777642913] [2022-11-02 20:29:55,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777642913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:55,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:55,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:55,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434990636] [2022-11-02 20:29:55,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:55,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:55,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:55,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:55,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:55,426 INFO L87 Difference]: Start difference. First operand 3648 states and 4845 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:55,649 INFO L93 Difference]: Finished difference Result 7664 states and 10122 transitions. [2022-11-02 20:29:55,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:55,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 267 [2022-11-02 20:29:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:55,676 INFO L225 Difference]: With dead ends: 7664 [2022-11-02 20:29:55,683 INFO L226 Difference]: Without dead ends: 4056 [2022-11-02 20:29:55,687 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:29:55,688 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 135 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:55,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 139 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2022-11-02 20:29:55,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 3768. [2022-11-02 20:29:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3768 states, 3767 states have (on average 1.3243960711441465) internal successors, (4989), 3767 states have internal predecessors, (4989), 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:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 4989 transitions. [2022-11-02 20:29:55,851 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 4989 transitions. Word has length 267 [2022-11-02 20:29:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:55,852 INFO L495 AbstractCegarLoop]: Abstraction has 3768 states and 4989 transitions. [2022-11-02 20:29:55,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 4989 transitions. [2022-11-02 20:29:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-11-02 20:29:55,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:55,861 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:55,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:29:55,862 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash 842255411, now seen corresponding path program 1 times [2022-11-02 20:29:55,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:55,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328179834] [2022-11-02 20:29:55,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2022-11-02 20:29:55,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:55,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328179834] [2022-11-02 20:29:55,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328179834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:55,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:55,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:55,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284192329] [2022-11-02 20:29:55,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:55,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:55,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:55,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:55,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:55,982 INFO L87 Difference]: Start difference. First operand 3768 states and 4989 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 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:29:56,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:56,121 INFO L93 Difference]: Finished difference Result 10720 states and 14279 transitions. [2022-11-02 20:29:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:56,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 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 268 [2022-11-02 20:29:56,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:56,137 INFO L225 Difference]: With dead ends: 10720 [2022-11-02 20:29:56,137 INFO L226 Difference]: Without dead ends: 6992 [2022-11-02 20:29:56,142 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:29:56,143 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 83 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:56,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 469 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:29:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6992 states. [2022-11-02 20:29:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6992 to 6990. [2022-11-02 20:29:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6990 states, 6989 states have (on average 1.3325225354127914) internal successors, (9313), 6989 states have internal predecessors, (9313), 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:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6990 states to 6990 states and 9313 transitions. [2022-11-02 20:29:56,393 INFO L78 Accepts]: Start accepts. Automaton has 6990 states and 9313 transitions. Word has length 268 [2022-11-02 20:29:56,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:56,394 INFO L495 AbstractCegarLoop]: Abstraction has 6990 states and 9313 transitions. [2022-11-02 20:29:56,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 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:29:56,395 INFO L276 IsEmpty]: Start isEmpty. Operand 6990 states and 9313 transitions. [2022-11-02 20:29:56,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-11-02 20:29:56,406 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:56,406 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:56,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:29:56,407 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:56,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:56,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1556363552, now seen corresponding path program 1 times [2022-11-02 20:29:56,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:56,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376401024] [2022-11-02 20:29:56,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:56,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2022-11-02 20:29:56,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:56,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376401024] [2022-11-02 20:29:56,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376401024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:56,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:56,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:29:56,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961339180] [2022-11-02 20:29:56,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:56,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:56,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:56,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:56,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:29:56,515 INFO L87 Difference]: Start difference. First operand 6990 states and 9313 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 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:29:56,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:56,841 INFO L93 Difference]: Finished difference Result 13948 states and 18570 transitions. [2022-11-02 20:29:56,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:29:56,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 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 269 [2022-11-02 20:29:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:56,857 INFO L225 Difference]: With dead ends: 13948 [2022-11-02 20:29:56,858 INFO L226 Difference]: Without dead ends: 6998 [2022-11-02 20:29:56,865 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:29:56,866 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:56,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 256 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:29:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6998 states. [2022-11-02 20:29:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6998 to 6966. [2022-11-02 20:29:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6966 states, 6965 states have (on average 1.3061019382627423) internal successors, (9097), 6965 states have internal predecessors, (9097), 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:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 9097 transitions. [2022-11-02 20:29:57,161 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 9097 transitions. Word has length 269 [2022-11-02 20:29:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:57,162 INFO L495 AbstractCegarLoop]: Abstraction has 6966 states and 9097 transitions. [2022-11-02 20:29:57,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 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:29:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 9097 transitions. [2022-11-02 20:29:57,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-02 20:29:57,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:57,178 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 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:57,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:29:57,179 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:57,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1277617296, now seen corresponding path program 1 times [2022-11-02 20:29:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:57,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811969892] [2022-11-02 20:29:57,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:57,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:29:57,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:57,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811969892] [2022-11-02 20:29:57,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811969892] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:29:57,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027745380] [2022-11-02 20:29:57,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:57,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:29:57,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:29:57,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:29:57,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:29:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:57,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:29:57,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:29:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:29:57,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:29:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:29:57,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027745380] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:29:57,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:29:57,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:29:57,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964004698] [2022-11-02 20:29:57,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:29:57,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:29:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:57,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:29:57,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:29:57,909 INFO L87 Difference]: Start difference. First operand 6966 states and 9097 transitions. Second operand has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 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:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:58,811 INFO L93 Difference]: Finished difference Result 18432 states and 24463 transitions. [2022-11-02 20:29:58,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:29:58,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 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:29:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:58,835 INFO L225 Difference]: With dead ends: 18432 [2022-11-02 20:29:58,835 INFO L226 Difference]: Without dead ends: 11450 [2022-11-02 20:29:58,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:29:58,844 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 217 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:58,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 898 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:29:58,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2022-11-02 20:29:59,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 9800. [2022-11-02 20:29:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9800 states, 9799 states have (on average 1.3263598326359833) internal successors, (12997), 9799 states have internal predecessors, (12997), 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:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9800 states to 9800 states and 12997 transitions. [2022-11-02 20:29:59,166 INFO L78 Accepts]: Start accepts. Automaton has 9800 states and 12997 transitions. Word has length 292 [2022-11-02 20:29:59,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:59,167 INFO L495 AbstractCegarLoop]: Abstraction has 9800 states and 12997 transitions. [2022-11-02 20:29:59,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 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:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 9800 states and 12997 transitions. [2022-11-02 20:29:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-11-02 20:29:59,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:59,185 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:59,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:29:59,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:29:59,407 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:59,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1037661491, now seen corresponding path program 2 times [2022-11-02 20:29:59,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:59,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40671054] [2022-11-02 20:29:59,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:59,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 407 proven. 5 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-11-02 20:29:59,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:59,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40671054] [2022-11-02 20:29:59,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40671054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:29:59,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381852746] [2022-11-02 20:29:59,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:29:59,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:29:59,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:29:59,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:29:59,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:29:59,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:29:59,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:29:59,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:29:59,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:29:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2022-11-02 20:29:59,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:29:59,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381852746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:59,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:29:59,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-02 20:29:59,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988056476] [2022-11-02 20:29:59,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:59,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:29:59,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:59,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:29:59,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:29:59,801 INFO L87 Difference]: Start difference. First operand 9800 states and 12997 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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:30:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:00,133 INFO L93 Difference]: Finished difference Result 19604 states and 25974 transitions. [2022-11-02 20:30:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:00,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 305 [2022-11-02 20:30:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:00,153 INFO L225 Difference]: With dead ends: 19604 [2022-11-02 20:30:00,153 INFO L226 Difference]: Without dead ends: 9844 [2022-11-02 20:30:00,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:30:00,165 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 53 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:00,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 236 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:30:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9844 states. [2022-11-02 20:30:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9844 to 8988. [2022-11-02 20:30:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8988 states, 8987 states have (on average 1.2837431845999778) internal successors, (11537), 8987 states have internal predecessors, (11537), 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:30:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8988 states to 8988 states and 11537 transitions. [2022-11-02 20:30:00,482 INFO L78 Accepts]: Start accepts. Automaton has 8988 states and 11537 transitions. Word has length 305 [2022-11-02 20:30:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:00,482 INFO L495 AbstractCegarLoop]: Abstraction has 8988 states and 11537 transitions. [2022-11-02 20:30:00,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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:30:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 8988 states and 11537 transitions. [2022-11-02 20:30:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2022-11-02 20:30:00,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:00,502 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:00,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:30:00,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:30:00,727 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:30:00,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:00,727 INFO L85 PathProgramCache]: Analyzing trace with hash 650041975, now seen corresponding path program 1 times [2022-11-02 20:30:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:00,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23595215] [2022-11-02 20:30:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:00,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-11-02 20:30:00,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:00,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23595215] [2022-11-02 20:30:00,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23595215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:00,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413401034] [2022-11-02 20:30:00,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:00,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:00,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:00,884 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:30:00,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:30:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:01,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:30:01,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:30:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2022-11-02 20:30:01,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:30:01,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413401034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:01,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:30:01,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-02 20:30:01,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896500394] [2022-11-02 20:30:01,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:01,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:01,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:01,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:01,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:30:01,531 INFO L87 Difference]: Start difference. First operand 8988 states and 11537 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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:30:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:01,869 INFO L93 Difference]: Finished difference Result 22010 states and 28224 transitions. [2022-11-02 20:30:01,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:01,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 372 [2022-11-02 20:30:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:01,903 INFO L225 Difference]: With dead ends: 22010 [2022-11-02 20:30:01,903 INFO L226 Difference]: Without dead ends: 13062 [2022-11-02 20:30:01,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:30:01,918 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 61 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:01,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 472 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:30:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13062 states. [2022-11-02 20:30:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13062 to 13062. [2022-11-02 20:30:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13062 states, 13061 states have (on average 1.2796110558150218) internal successors, (16713), 13061 states have internal predecessors, (16713), 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:30:02,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13062 states to 13062 states and 16713 transitions. [2022-11-02 20:30:02,449 INFO L78 Accepts]: Start accepts. Automaton has 13062 states and 16713 transitions. Word has length 372 [2022-11-02 20:30:02,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:02,450 INFO L495 AbstractCegarLoop]: Abstraction has 13062 states and 16713 transitions. [2022-11-02 20:30:02,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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:30:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 13062 states and 16713 transitions. [2022-11-02 20:30:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-11-02 20:30:02,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:02,480 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:02,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:30:02,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:02,703 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:30:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:02,703 INFO L85 PathProgramCache]: Analyzing trace with hash -590181313, now seen corresponding path program 1 times [2022-11-02 20:30:02,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:02,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454087283] [2022-11-02 20:30:02,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:02,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-11-02 20:30:02,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:02,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454087283] [2022-11-02 20:30:02,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454087283] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:02,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216343347] [2022-11-02 20:30:02,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:02,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:02,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:02,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:30:02,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:30:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:03,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:30:03,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:30:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-11-02 20:30:03,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:30:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-11-02 20:30:03,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216343347] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:30:03,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:30:03,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:30:03,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698086746] [2022-11-02 20:30:03,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:30:03,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:30:03,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:03,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:30:03,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:30:03,281 INFO L87 Difference]: Start difference. First operand 13062 states and 16713 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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:30:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:03,890 INFO L93 Difference]: Finished difference Result 29734 states and 37874 transitions. [2022-11-02 20:30:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:30:03,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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 374 [2022-11-02 20:30:03,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:03,930 INFO L225 Difference]: With dead ends: 29734 [2022-11-02 20:30:03,931 INFO L226 Difference]: Without dead ends: 16700 [2022-11-02 20:30:03,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:30:03,948 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 218 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:03,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 607 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:30:03,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16700 states. [2022-11-02 20:30:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16700 to 14417. [2022-11-02 20:30:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14417 states, 14416 states have (on average 1.278718091009989) internal successors, (18434), 14416 states have internal predecessors, (18434), 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:30:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14417 states to 14417 states and 18434 transitions. [2022-11-02 20:30:04,529 INFO L78 Accepts]: Start accepts. Automaton has 14417 states and 18434 transitions. Word has length 374 [2022-11-02 20:30:04,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:04,529 INFO L495 AbstractCegarLoop]: Abstraction has 14417 states and 18434 transitions. [2022-11-02 20:30:04,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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:30:04,530 INFO L276 IsEmpty]: Start isEmpty. Operand 14417 states and 18434 transitions. [2022-11-02 20:30:04,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2022-11-02 20:30:04,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:04,562 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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:30:04,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:30:04,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:04,779 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:30:04,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:04,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1273645298, now seen corresponding path program 1 times [2022-11-02 20:30:04,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:04,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73887224] [2022-11-02 20:30:04,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:04,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-11-02 20:30:04,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:04,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73887224] [2022-11-02 20:30:04,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73887224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:04,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:04,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:30:04,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095036183] [2022-11-02 20:30:04,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:04,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:04,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:04,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:04,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:04,959 INFO L87 Difference]: Start difference. First operand 14417 states and 18434 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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:30:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:05,290 INFO L93 Difference]: Finished difference Result 25708 states and 32305 transitions. [2022-11-02 20:30:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:05,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 413 [2022-11-02 20:30:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:05,304 INFO L225 Difference]: With dead ends: 25708 [2022-11-02 20:30:05,304 INFO L226 Difference]: Without dead ends: 5877 [2022-11-02 20:30:05,315 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:30:05,316 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:05,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 262 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:30:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5877 states. [2022-11-02 20:30:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5877 to 5476. [2022-11-02 20:30:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5476 states, 5475 states have (on average 1.2622831050228311) internal successors, (6911), 5475 states have internal predecessors, (6911), 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:30:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 6911 transitions. [2022-11-02 20:30:05,469 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 6911 transitions. Word has length 413 [2022-11-02 20:30:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:05,470 INFO L495 AbstractCegarLoop]: Abstraction has 5476 states and 6911 transitions. [2022-11-02 20:30:05,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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:30:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 6911 transitions. [2022-11-02 20:30:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2022-11-02 20:30:05,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:30:05,484 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:05,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:30:05,485 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:30:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:05,485 INFO L85 PathProgramCache]: Analyzing trace with hash 381067605, now seen corresponding path program 1 times [2022-11-02 20:30:05,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:05,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134465177] [2022-11-02 20:30:05,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:05,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2022-11-02 20:30:05,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:05,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134465177] [2022-11-02 20:30:05,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134465177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:30:05,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050220939] [2022-11-02 20:30:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:05,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:30:05,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:05,666 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:30:05,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:30:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:05,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:30:05,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:30:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2022-11-02 20:30:05,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:30:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2022-11-02 20:30:06,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050220939] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:30:06,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:30:06,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-02 20:30:06,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894655303] [2022-11-02 20:30:06,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:30:06,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:30:06,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:06,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:30:06,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:30:06,051 INFO L87 Difference]: Start difference. First operand 5476 states and 6911 transitions. Second operand has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 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:30:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:30:06,491 INFO L93 Difference]: Finished difference Result 6913 states and 8716 transitions. [2022-11-02 20:30:06,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:30:06,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 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 442 [2022-11-02 20:30:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:30:06,492 INFO L225 Difference]: With dead ends: 6913 [2022-11-02 20:30:06,492 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:30:06,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 882 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:30:06,496 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 101 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:30:06,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 862 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:30:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:30:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:30:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:30:06,499 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 442 [2022-11-02 20:30:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:30:06,499 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:30:06,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 39.625) internal successors, (317), 8 states have internal predecessors, (317), 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:30:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:30:06,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:30:06,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:30:06,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:30:06,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 20:30:06,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:30:19,901 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 371) no Hoare annotation was computed. [2022-11-02 20:30:19,901 INFO L899 garLoopResultBuilder]: For program point L366-2(lines 366 371) no Hoare annotation was computed. [2022-11-02 20:30:19,901 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 237) no Hoare annotation was computed. [2022-11-02 20:30:19,901 INFO L899 garLoopResultBuilder]: For program point L201(lines 201 495) no Hoare annotation was computed. [2022-11-02 20:30:19,901 INFO L899 garLoopResultBuilder]: For program point L168(lines 168 506) no Hoare annotation was computed. [2022-11-02 20:30:19,901 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 517) no Hoare annotation was computed. [2022-11-02 20:30:19,901 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 106) no Hoare annotation was computed. [2022-11-02 20:30:19,902 INFO L899 garLoopResultBuilder]: For program point L466-1(lines 466 468) no Hoare annotation was computed. [2022-11-02 20:30:19,902 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 270) no Hoare annotation was computed. [2022-11-02 20:30:19,902 INFO L895 garLoopResultBuilder]: At program point L202(lines 198 496) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse3 (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 12292)) (.cse4 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse5 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse4 .cse5 .cse3 .cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse4 .cse0 .cse3 .cse2) (and .cse4 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse5 .cse1 .cse2))) [2022-11-02 20:30:19,902 INFO L895 garLoopResultBuilder]: At program point L136(lines 132 518) the Hoare annotation is: (let ((.cse0 (not (<= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (.cse1 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse0 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1) .cse1))) [2022-11-02 20:30:19,902 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 105) no Hoare annotation was computed. [2022-11-02 20:30:19,902 INFO L902 garLoopResultBuilder]: At program point L566(lines 558 568) the Hoare annotation is: true [2022-11-02 20:30:19,902 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 337) no Hoare annotation was computed. [2022-11-02 20:30:19,903 INFO L899 garLoopResultBuilder]: For program point L335-2(lines 211 490) no Hoare annotation was computed. [2022-11-02 20:30:19,903 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 405) no Hoare annotation was computed. [2022-11-02 20:30:19,903 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 494) no Hoare annotation was computed. [2022-11-02 20:30:19,903 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 505) no Hoare annotation was computed. [2022-11-02 20:30:19,903 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 516) no Hoare annotation was computed. [2022-11-02 20:30:19,903 INFO L899 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2022-11-02 20:30:19,904 INFO L899 garLoopResultBuilder]: For program point L238(lines 238 241) no Hoare annotation was computed. [2022-11-02 20:30:19,904 INFO L895 garLoopResultBuilder]: At program point L205(lines 204 494) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse2 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse5 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|))) (or (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse1 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse3 .cse4 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse1 .cse2 .cse5) (and .cse3 .cse4 .cse0 .cse1 .cse2 .cse5))) [2022-11-02 20:30:19,904 INFO L895 garLoopResultBuilder]: At program point L172(lines 162 508) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse2 (<= 4464 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 .cse2) (and .cse0 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse1 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)))) [2022-11-02 20:30:19,906 INFO L899 garLoopResultBuilder]: For program point L437(lines 437 439) no Hoare annotation was computed. [2022-11-02 20:30:19,906 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 493) no Hoare annotation was computed. [2022-11-02 20:30:19,906 INFO L899 garLoopResultBuilder]: For program point L174(lines 174 504) no Hoare annotation was computed. [2022-11-02 20:30:19,906 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 515) no Hoare annotation was computed. [2022-11-02 20:30:19,907 INFO L895 garLoopResultBuilder]: At program point L108-1(lines 86 556) the Hoare annotation is: (let ((.cse0 (= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse8 (= 4528 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse9 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse15 (= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse14 (= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse7 (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse5 (< 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse16 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse10 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse6 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse12 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse13 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse11 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3 .cse5) (and (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (and .cse1 .cse6 .cse7) (and .cse0 .cse1 .cse6) (and .cse1 .cse2 .cse8) (and .cse6 .cse8) (and .cse6 .cse4 .cse9) (and .cse10 .cse2 .cse7) (and .cse1 .cse10 .cse2 .cse4 .cse9 .cse11) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse6 .cse12 .cse13) (and .cse1 .cse2 (= 4480 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (and .cse1 .cse14 .cse2) (and .cse10 .cse6 .cse7) (and .cse1 .cse2 (= 4464 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (and .cse1 .cse10 .cse2 .cse3 .cse15) (and .cse1 .cse6 .cse15) (and .cse1 .cse2 .cse16 .cse3) (and .cse1 .cse10 .cse2 .cse12 .cse13 .cse11) (and .cse1 (= 4496 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2) (and .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse6 .cse4 .cse5) (and .cse1 .cse6 .cse16) (and .cse1 .cse10 .cse6 .cse12 .cse13 .cse11) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0))) [2022-11-02 20:30:19,907 INFO L899 garLoopResultBuilder]: For program point L472(lines 472 474) no Hoare annotation was computed. [2022-11-02 20:30:19,907 INFO L899 garLoopResultBuilder]: For program point L472-2(lines 472 474) no Hoare annotation was computed. [2022-11-02 20:30:19,907 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 309) no Hoare annotation was computed. [2022-11-02 20:30:19,907 INFO L899 garLoopResultBuilder]: For program point L307-2(lines 211 490) no Hoare annotation was computed. [2022-11-02 20:30:19,908 INFO L902 garLoopResultBuilder]: At program point L208(lines 207 493) the Hoare annotation is: true [2022-11-02 20:30:19,908 INFO L895 garLoopResultBuilder]: At program point L142(lines 138 516) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse2 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 .cse2))) [2022-11-02 20:30:19,908 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-11-02 20:30:19,908 INFO L899 garLoopResultBuilder]: For program point L440(lines 440 444) no Hoare annotation was computed. [2022-11-02 20:30:19,908 INFO L899 garLoopResultBuilder]: For program point L440-2(lines 440 444) no Hoare annotation was computed. [2022-11-02 20:30:19,908 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2022-11-02 20:30:19,909 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 277) no Hoare annotation was computed. [2022-11-02 20:30:19,909 INFO L899 garLoopResultBuilder]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2022-11-02 20:30:19,909 INFO L899 garLoopResultBuilder]: For program point L275-2(lines 211 490) no Hoare annotation was computed. [2022-11-02 20:30:19,909 INFO L902 garLoopResultBuilder]: At program point L210(lines 209 493) the Hoare annotation is: true [2022-11-02 20:30:19,909 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 503) no Hoare annotation was computed. [2022-11-02 20:30:19,909 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 514) no Hoare annotation was computed. [2022-11-02 20:30:19,910 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 525) no Hoare annotation was computed. [2022-11-02 20:30:19,910 INFO L895 garLoopResultBuilder]: At program point L178(lines 174 504) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse2 (<= 4464 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 .cse2) (and .cse0 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse1 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)))) [2022-11-02 20:30:19,910 INFO L895 garLoopResultBuilder]: At program point L112(lines 111 525) the Hoare annotation is: (and (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-11-02 20:30:19,910 INFO L899 garLoopResultBuilder]: For program point L410(lines 410 412) no Hoare annotation was computed. [2022-11-02 20:30:19,910 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 379) no Hoare annotation was computed. [2022-11-02 20:30:19,910 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 502) no Hoare annotation was computed. [2022-11-02 20:30:19,911 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 513) no Hoare annotation was computed. [2022-11-02 20:30:19,911 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 524) no Hoare annotation was computed. [2022-11-02 20:30:19,911 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 480) no Hoare annotation was computed. [2022-11-02 20:30:19,911 INFO L899 garLoopResultBuilder]: For program point L478-2(lines 478 480) no Hoare annotation was computed. [2022-11-02 20:30:19,911 INFO L895 garLoopResultBuilder]: At program point L148(lines 144 514) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse1 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse2 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1))) [2022-11-02 20:30:19,912 INFO L902 garLoopResultBuilder]: At program point L545(lines 107 546) the Hoare annotation is: true [2022-11-02 20:30:19,912 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2022-11-02 20:30:19,912 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 251) no Hoare annotation was computed. [2022-11-02 20:30:19,912 INFO L899 garLoopResultBuilder]: For program point L281-2(lines 281 285) no Hoare annotation was computed. [2022-11-02 20:30:19,912 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 318) no Hoare annotation was computed. [2022-11-02 20:30:19,912 INFO L895 garLoopResultBuilder]: At program point L216(lines 114 524) the Hoare annotation is: (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0) [2022-11-02 20:30:19,913 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 501) no Hoare annotation was computed. [2022-11-02 20:30:19,913 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 512) no Hoare annotation was computed. [2022-11-02 20:30:19,913 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 523) no Hoare annotation was computed. [2022-11-02 20:30:19,913 INFO L895 garLoopResultBuilder]: At program point L184(lines 180 502) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse2 (<= 4464 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1 .cse2) (and .cse0 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse1 .cse2) (and .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)))) [2022-11-02 20:30:19,913 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:30:19,913 INFO L899 garLoopResultBuilder]: For program point L483(lines 483 485) no Hoare annotation was computed. [2022-11-02 20:30:19,914 INFO L899 garLoopResultBuilder]: For program point L450(lines 450 461) no Hoare annotation was computed. [2022-11-02 20:30:19,914 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 431) no Hoare annotation was computed. [2022-11-02 20:30:19,914 INFO L899 garLoopResultBuilder]: For program point L417-1(lines 417 431) no Hoare annotation was computed. [2022-11-02 20:30:19,914 INFO L899 garLoopResultBuilder]: For program point L450-2(lines 450 461) no Hoare annotation was computed. [2022-11-02 20:30:19,914 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 500) no Hoare annotation was computed. [2022-11-02 20:30:19,914 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 511) no Hoare annotation was computed. [2022-11-02 20:30:19,914 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 522) no Hoare annotation was computed. [2022-11-02 20:30:19,915 INFO L899 garLoopResultBuilder]: For program point L550(lines 550 552) no Hoare annotation was computed. [2022-11-02 20:30:19,915 INFO L899 garLoopResultBuilder]: For program point L550-2(lines 550 552) no Hoare annotation was computed. [2022-11-02 20:30:19,915 INFO L895 garLoopResultBuilder]: At program point L154(lines 150 512) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse1 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse2 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1))) [2022-11-02 20:30:19,915 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 355) no Hoare annotation was computed. [2022-11-02 20:30:19,915 INFO L899 garLoopResultBuilder]: For program point L221(lines 221 223) no Hoare annotation was computed. [2022-11-02 20:30:19,915 INFO L899 garLoopResultBuilder]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2022-11-02 20:30:19,916 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 389) no Hoare annotation was computed. [2022-11-02 20:30:19,916 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 499) no Hoare annotation was computed. [2022-11-02 20:30:19,916 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 510) no Hoare annotation was computed. [2022-11-02 20:30:19,916 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 521) no Hoare annotation was computed. [2022-11-02 20:30:19,916 INFO L899 garLoopResultBuilder]: For program point L421(lines 421 427) no Hoare annotation was computed. [2022-11-02 20:30:19,916 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:30:19,916 INFO L895 garLoopResultBuilder]: At program point L190(lines 186 500) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse1 (<= 4464 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse0 .cse1) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)))) [2022-11-02 20:30:19,917 INFO L899 garLoopResultBuilder]: For program point L455(lines 455 458) no Hoare annotation was computed. [2022-11-02 20:30:19,917 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 325) no Hoare annotation was computed. [2022-11-02 20:30:19,917 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 290 300) no Hoare annotation was computed. [2022-11-02 20:30:19,917 INFO L902 garLoopResultBuilder]: At program point L555(lines 22 557) the Hoare annotation is: true [2022-11-02 20:30:19,917 INFO L895 garLoopResultBuilder]: At program point L324(lines 86 556) the Hoare annotation is: false [2022-11-02 20:30:19,917 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 498) no Hoare annotation was computed. [2022-11-02 20:30:19,918 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 509) no Hoare annotation was computed. [2022-11-02 20:30:19,918 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 520) no Hoare annotation was computed. [2022-11-02 20:30:19,918 INFO L899 garLoopResultBuilder]: For program point L226(lines 226 229) no Hoare annotation was computed. [2022-11-02 20:30:19,918 INFO L895 garLoopResultBuilder]: At program point L160(lines 156 510) the Hoare annotation is: (let ((.cse1 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|)) (.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse3 (< 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4) .cse3) (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse1 .cse2 .cse3) (and .cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0) .cse3) (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse2 .cse3))) [2022-11-02 20:30:19,918 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 100) no Hoare annotation was computed. [2022-11-02 20:30:19,918 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:30:19,919 INFO L895 garLoopResultBuilder]: At program point L491(lines 108 544) the Hoare annotation is: (let ((.cse0 (= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse8 (= 4528 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse9 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse15 (= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse14 (= 4512 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse7 (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse5 (< 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse16 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse10 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse6 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse12 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse13 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse11 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3 .cse5) (and (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (and .cse1 .cse6 .cse7) (and .cse0 .cse1 .cse6) (and .cse1 .cse2 .cse8) (and .cse6 .cse8) (and .cse6 .cse4 .cse9) (and .cse10 .cse2 .cse7) (and .cse1 .cse10 .cse2 .cse4 .cse9 .cse11) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse6 .cse12 .cse13) (and .cse1 .cse2 (= 4480 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (and .cse1 .cse14 .cse2) (and .cse10 .cse6 .cse7) (and .cse1 .cse2 (= 4464 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (and .cse1 .cse10 .cse2 .cse3 .cse15) (and .cse1 .cse6 .cse15) (and .cse1 .cse2 .cse16 .cse3) (and .cse1 .cse10 .cse2 .cse12 .cse13 .cse11) (and .cse1 (= 4496 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2) (and .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse6 .cse4 .cse5) (and .cse1 .cse6 .cse16) (and .cse1 .cse10 .cse6 .cse12 .cse13 .cse11) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0))) [2022-11-02 20:30:19,919 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 328) no Hoare annotation was computed. [2022-11-02 20:30:19,919 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 262) no Hoare annotation was computed. [2022-11-02 20:30:19,919 INFO L899 garLoopResultBuilder]: For program point L260-2(lines 211 490) no Hoare annotation was computed. [2022-11-02 20:30:19,919 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 397) no Hoare annotation was computed. [2022-11-02 20:30:19,920 INFO L899 garLoopResultBuilder]: For program point L393-2(lines 211 490) no Hoare annotation was computed. [2022-11-02 20:30:19,920 INFO L899 garLoopResultBuilder]: For program point L294(lines 294 296) no Hoare annotation was computed. [2022-11-02 20:30:19,920 INFO L899 garLoopResultBuilder]: For program point L294-2(lines 292 300) no Hoare annotation was computed. [2022-11-02 20:30:19,920 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 497) no Hoare annotation was computed. [2022-11-02 20:30:19,920 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 508) no Hoare annotation was computed. [2022-11-02 20:30:19,920 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 519) no Hoare annotation was computed. [2022-11-02 20:30:19,921 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 542) no Hoare annotation was computed. [2022-11-02 20:30:19,921 INFO L895 garLoopResultBuilder]: At program point L196(lines 192 498) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse1 (<= 4464 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (= 256 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0#1|) .cse0 .cse1) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)))) [2022-11-02 20:30:19,921 INFO L895 garLoopResultBuilder]: At program point L130(lines 126 520) the Hoare annotation is: (and (not (<= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-11-02 20:30:19,921 INFO L899 garLoopResultBuilder]: For program point L97(lines 97 99) no Hoare annotation was computed. [2022-11-02 20:30:19,921 INFO L899 garLoopResultBuilder]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2022-11-02 20:30:19,921 INFO L899 garLoopResultBuilder]: For program point L527(lines 527 541) no Hoare annotation was computed. [2022-11-02 20:30:19,922 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 364) no Hoare annotation was computed. [2022-11-02 20:30:19,922 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:30:19,922 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 554) no Hoare annotation was computed. [2022-11-02 20:30:19,922 INFO L899 garLoopResultBuilder]: For program point L528(lines 528 533) no Hoare annotation was computed. [2022-11-02 20:30:19,922 INFO L899 garLoopResultBuilder]: For program point L528-2(lines 527 541) no Hoare annotation was computed. [2022-11-02 20:30:19,922 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 496) no Hoare annotation was computed. [2022-11-02 20:30:19,923 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 507) no Hoare annotation was computed. [2022-11-02 20:30:19,923 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 518) no Hoare annotation was computed. [2022-11-02 20:30:19,923 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 243) no Hoare annotation was computed. [2022-11-02 20:30:19,923 INFO L899 garLoopResultBuilder]: For program point L232-2(lines 211 490) no Hoare annotation was computed. [2022-11-02 20:30:19,923 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 532) no Hoare annotation was computed. [2022-11-02 20:30:19,926 INFO L444 BasicCegarLoop]: Path program histogram: [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:30:19,928 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:30:19,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:30:19 BoogieIcfgContainer [2022-11-02 20:30:19,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:30:19,954 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:30:19,954 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:30:19,954 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:30:19,955 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:29:49" (3/4) ... [2022-11-02 20:30:19,957 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:30:19,975 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-02 20:30:19,975 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:30:19,976 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:30:19,978 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:30:20,071 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:30:20,071 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:30:20,071 INFO L158 Benchmark]: Toolchain (without parser) took 31824.33ms. Allocated memory was 127.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 91.9MB in the beginning and 762.0MB in the end (delta: -670.1MB). Peak memory consumption was 501.9MB. Max. memory is 16.1GB. [2022-11-02 20:30:20,072 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 127.9MB. Free memory was 99.5MB in the beginning and 99.5MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:30:20,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.79ms. Allocated memory is still 127.9MB. Free memory was 91.6MB in the beginning and 97.7MB in the end (delta: -6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:30:20,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.13ms. Allocated memory is still 127.9MB. Free memory was 97.7MB in the beginning and 94.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:30:20,073 INFO L158 Benchmark]: Boogie Preprocessor took 31.70ms. Allocated memory is still 127.9MB. Free memory was 94.8MB in the beginning and 92.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:30:20,073 INFO L158 Benchmark]: RCFGBuilder took 809.75ms. Allocated memory is still 127.9MB. Free memory was 92.7MB in the beginning and 59.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-02 20:30:20,076 INFO L158 Benchmark]: TraceAbstraction took 30401.18ms. Allocated memory was 127.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 58.5MB in the beginning and 769.4MB in the end (delta: -710.9MB). Peak memory consumption was 817.6MB. Max. memory is 16.1GB. [2022-11-02 20:30:20,076 INFO L158 Benchmark]: Witness Printer took 117.32ms. Allocated memory is still 1.3GB. Free memory was 769.4MB in the beginning and 762.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:30:20,083 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 127.9MB. Free memory was 99.5MB in the beginning and 99.5MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.79ms. Allocated memory is still 127.9MB. Free memory was 91.6MB in the beginning and 97.7MB in the end (delta: -6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.13ms. Allocated memory is still 127.9MB. Free memory was 97.7MB in the beginning and 94.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.70ms. Allocated memory is still 127.9MB. Free memory was 94.8MB in the beginning and 92.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 809.75ms. Allocated memory is still 127.9MB. Free memory was 92.7MB in the beginning and 59.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30401.18ms. Allocated memory was 127.9MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 58.5MB in the beginning and 769.4MB in the end (delta: -710.9MB). Peak memory consumption was 817.6MB. Max. memory is 16.1GB. * Witness Printer took 117.32ms. Allocated memory is still 1.3GB. Free memory was 769.4MB in the beginning and 762.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 554]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 26, TraceHistogramMax: 18, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1880 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1880 mSDsluCounter, 9129 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3880 mSDsCounter, 506 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3339 IncrementalHoareTripleChecker+Invalid, 3845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 506 mSolverCounterUnsat, 5249 mSDtfsCounter, 3339 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2978 GetRequests, 2932 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14417occurred in iteration=24, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 5774 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 600 NumberOfFragments, 1134 HoareAnnotationTreeSize, 23 FomulaSimplifications, 20340 FormulaSimplificationTreeSizeReduction, 7.2s HoareSimplificationTime, 23 FomulaSimplificationsInter, 17388 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 7041 NumberOfCodeBlocks, 7041 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8115 ConstructedInterpolants, 0 QuantifiedInterpolants, 11052 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3280 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 34 InterpolantComputations, 23 PerfectInterpolantSequences, 27797/27918 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && s__state <= 4560) && 4560 <= s__state) || ((s__state < 12292 && 4560 <= s__state) && blastFlag == 0)) || ((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state < 12292) && 4560 <= s__state) && blastFlag <= 4)) || (((s__hit == 0 && 2 == blastFlag) && s__state < 12292) && 4560 <= s__state)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4560 <= s__state) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: 4560 <= s__state && blastFlag == 0 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((4432 == s__state && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && blastFlag <= 4) || ((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && blastFlag <= 4) && 4432 < s__state)) || (4384 == s__state && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 3 == s__state)) || ((4432 == s__state && s__hit == 0) && 2 == blastFlag)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && 4528 == s__state)) || (2 == blastFlag && 4528 == s__state)) || ((2 == blastFlag && s__state <= 4560) && 4560 <= s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && 256 == s__s3__tmp__new_cipher__algorithms) && 3 == s__state)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && 4352 <= s__state)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && 4480 == s__state)) || ((s__hit == 0 && 4512 == s__state) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((s__s3__tmp__next_state___0 <= 4560 && 2 == blastFlag) && 3 == s__state)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 == s__state)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && blastFlag <= 4) && 4400 == s__state)) || ((s__hit == 0 && 2 == blastFlag) && 4400 == s__state)) || (((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && 4416 == s__state) && blastFlag <= 4)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || ((s__hit == 0 && 4496 == s__state) && 256 == s__s3__tmp__new_cipher__algorithms)) || (4512 == s__state && 2 == blastFlag)) || (((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && blastFlag <= 4) && 3 == s__state)) || (((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4432 < s__state)) || ((s__hit == 0 && 2 == blastFlag) && 4416 == s__state)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 2 == blastFlag) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || blastFlag == 0 - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: blastFlag == 0 - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && blastFlag <= 4) && 4432 < s__state) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4432 < s__state)) || ((s__state <= 4560 && blastFlag == 0) && 4432 < s__state)) || (((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4432 < s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && 4352 <= s__state) && blastFlag == 0) || ((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4352 <= s__state) && blastFlag <= 4)) || (((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4352 <= s__state) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4464 <= s__state) || (((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4464 <= s__state)) || ((s__state <= 4560 && 4464 <= s__state) && blastFlag == 0) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && 4352 <= s__state) || ((s__state <= 4352 && 4352 <= s__state) && blastFlag == 0)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 2 == blastFlag) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (!(4400 <= s__state) && 4352 <= s__state) && blastFlag == 0 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 558]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4464 <= s__state) || ((2 == blastFlag && s__state <= 4560) && 4464 <= s__state)) || ((s__state <= 4560 && 4464 <= s__state) && blastFlag == 0) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4464 <= s__state) || (((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4464 <= s__state)) || ((s__state <= 4560 && 4464 <= s__state) && blastFlag == 0) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && 4352 <= s__state) && blastFlag == 0) || ((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4352 <= s__state) && blastFlag <= 4)) || (((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4352 <= s__state) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4464 <= s__state) || ((2 == blastFlag && s__state <= 4560) && 4464 <= s__state)) || ((s__state <= 4560 && 4464 <= s__state) && blastFlag == 0) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((4432 == s__state && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && blastFlag <= 4) || ((((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && blastFlag <= 4) && 4432 < s__state)) || (4384 == s__state && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 3 == s__state)) || ((4432 == s__state && s__hit == 0) && 2 == blastFlag)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && 4528 == s__state)) || (2 == blastFlag && 4528 == s__state)) || ((2 == blastFlag && s__state <= 4560) && 4560 <= s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && 256 == s__s3__tmp__new_cipher__algorithms) && 3 == s__state)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && 4352 <= s__state)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && 4480 == s__state)) || ((s__hit == 0 && 4512 == s__state) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((s__s3__tmp__next_state___0 <= 4560 && 2 == blastFlag) && 3 == s__state)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 == s__state)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && blastFlag <= 4) && 4400 == s__state)) || ((s__hit == 0 && 2 == blastFlag) && 4400 == s__state)) || (((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && 4416 == s__state) && blastFlag <= 4)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || ((s__hit == 0 && 4496 == s__state) && 256 == s__s3__tmp__new_cipher__algorithms)) || (4512 == s__state && 2 == blastFlag)) || (((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && blastFlag <= 4) && 3 == s__state)) || (((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4432 < s__state)) || ((s__hit == 0 && 2 == blastFlag) && 4416 == s__state)) || (((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 2 == blastFlag) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || blastFlag == 0 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((!(4400 <= s__state) && 4352 <= s__state) && blastFlag == 0) || ((!(4400 <= s__state) && blastFlag == 1) && 4352 <= s__state) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4352 <= s__state) && blastFlag <= 4) || ((s__state <= 4560 && 4352 <= s__state) && blastFlag == 0)) || (((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4352 <= s__state) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && 2 == blastFlag) && s__state <= 4560) && 4464 <= s__state) || (((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state <= 4560) && 4464 <= s__state)) || ((s__state <= 4560 && 4464 <= s__state) && blastFlag == 0) RESULT: Ultimate proved your program to be correct! [2022-11-02 20:30:20,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7cc4fae-57bc-4a64-a521-d4a7a07b14f0/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE