./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/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_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/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_a3e808c8-97a3-424b-b297-b5653d61af2a/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 a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 --- 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 21:03:35,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:03:35,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:03:35,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:03:35,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:03:35,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:03:35,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:03:35,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:03:35,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:03:35,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:03:35,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:03:35,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:03:35,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:03:35,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:03:35,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:03:35,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:03:35,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:03:35,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:03:35,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:03:35,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:03:35,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:03:35,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:03:35,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:03:35,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:03:35,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:03:35,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:03:35,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:03:35,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:03:35,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:03:35,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:03:35,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:03:36,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:03:36,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:03:36,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:03:36,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:03:36,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:03:36,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:03:36,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:03:36,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:03:36,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:03:36,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:03:36,009 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:03:36,047 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:03:36,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:03:36,048 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:03:36,048 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:03:36,049 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:03:36,049 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:03:36,050 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:03:36,050 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:03:36,050 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:03:36,050 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:03:36,051 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:03:36,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:03:36,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:03:36,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:03:36,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:03:36,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:03:36,052 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:03:36,053 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:03:36,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:03:36,053 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:03:36,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:03:36,053 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:03:36,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:03:36,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:03:36,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:03:36,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:03:36,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:03:36,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:03:36,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:03:36,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:03:36,055 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:03:36,056 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:03:36,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:03:36,056 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_a3e808c8-97a3-424b-b297-b5653d61af2a/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_a3e808c8-97a3-424b-b297-b5653d61af2a/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 -> a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 [2022-11-02 21:03:36,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:03:36,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:03:36,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:03:36,403 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:03:36,405 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:03:36,406 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-11-02 21:03:36,486 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/data/f53c45abc/26f43d0680ce44ecac40f8b010dbb59a/FLAGc8c147f32 [2022-11-02 21:03:37,115 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:03:37,116 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-11-02 21:03:37,142 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/data/f53c45abc/26f43d0680ce44ecac40f8b010dbb59a/FLAGc8c147f32 [2022-11-02 21:03:37,329 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/data/f53c45abc/26f43d0680ce44ecac40f8b010dbb59a [2022-11-02 21:03:37,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:03:37,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:03:37,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:03:37,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:03:37,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:03:37,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:03:37" (1/1) ... [2022-11-02 21:03:37,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74cf6abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:37, skipping insertion in model container [2022-11-02 21:03:37,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:03:37" (1/1) ... [2022-11-02 21:03:37,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:03:37,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:03:37,886 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_a3e808c8-97a3-424b-b297-b5653d61af2a/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-11-02 21:03:37,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:03:37,918 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:03:38,061 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_a3e808c8-97a3-424b-b297-b5653d61af2a/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-11-02 21:03:38,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:03:38,083 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:03:38,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:38 WrapperNode [2022-11-02 21:03:38,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:03:38,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:03:38,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:03:38,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:03:38,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:38" (1/1) ... [2022-11-02 21:03:38,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:38" (1/1) ... [2022-11-02 21:03:38,187 INFO L138 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 788 [2022-11-02 21:03:38,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:03:38,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:03:38,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:03:38,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:03:38,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:38" (1/1) ... [2022-11-02 21:03:38,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:38" (1/1) ... [2022-11-02 21:03:38,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:38" (1/1) ... [2022-11-02 21:03:38,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:38" (1/1) ... [2022-11-02 21:03:38,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:38" (1/1) ... [2022-11-02 21:03:38,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:38" (1/1) ... [2022-11-02 21:03:38,319 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:38" (1/1) ... [2022-11-02 21:03:38,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:38" (1/1) ... [2022-11-02 21:03:38,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:03:38,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:03:38,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:03:38,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:03:38,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:38" (1/1) ... [2022-11-02 21:03:38,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:03:38,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:03:38,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:03:38,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:03:38,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:03:38,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:03:38,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:03:38,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:03:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:03:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:03:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:03:38,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:03:38,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:03:38,573 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:03:38,575 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:03:38,593 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:03:41,580 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-11-02 21:03:41,580 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-11-02 21:03:41,580 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:03:41,592 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:03:41,592 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 21:03:41,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:03:41 BoogieIcfgContainer [2022-11-02 21:03:41,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:03:41,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:03:41,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:03:41,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:03:41,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:03:37" (1/3) ... [2022-11-02 21:03:41,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d99e2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:03:41, skipping insertion in model container [2022-11-02 21:03:41,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:38" (2/3) ... [2022-11-02 21:03:41,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d99e2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:03:41, skipping insertion in model container [2022-11-02 21:03:41,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:03:41" (3/3) ... [2022-11-02 21:03:41,604 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-11-02 21:03:41,625 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:03:41,625 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:03:41,689 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:03:41,696 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;@7ca037cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:03:41,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:03:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 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 21:03:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 21:03:41,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:41,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:41,713 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:41,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:41,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1430116946, now seen corresponding path program 1 times [2022-11-02 21:03:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:41,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012505463] [2022-11-02 21:03:41,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:41,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:42,920 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 21:03:42,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:42,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012505463] [2022-11-02 21:03:42,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012505463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:42,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:42,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:42,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719663119] [2022-11-02 21:03:42,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:42,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:42,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:42,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:42,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:42,975 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 21:03:45,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:45,740 INFO L93 Difference]: Finished difference Result 412 states and 693 transitions. [2022-11-02 21:03:45,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:03:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-11-02 21:03:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:45,766 INFO L225 Difference]: With dead ends: 412 [2022-11-02 21:03:45,766 INFO L226 Difference]: Without dead ends: 250 [2022-11-02 21:03:45,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:45,777 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 144 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:45,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 417 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-11-02 21:03:45,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-02 21:03:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 177. [2022-11-02 21:03:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.6079545454545454) internal successors, (283), 176 states have internal predecessors, (283), 0 states have call successors, (0), 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 21:03:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 283 transitions. [2022-11-02 21:03:45,852 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 283 transitions. Word has length 47 [2022-11-02 21:03:45,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:45,853 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 283 transitions. [2022-11-02 21:03:45,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 21:03:45,853 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 283 transitions. [2022-11-02 21:03:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 21:03:45,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:45,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:45,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:03:45,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:45,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1376827281, now seen corresponding path program 1 times [2022-11-02 21:03:45,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:45,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016464241] [2022-11-02 21:03:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:46,369 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 21:03:46,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:46,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016464241] [2022-11-02 21:03:46,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016464241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:46,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:46,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:46,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616918238] [2022-11-02 21:03:46,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:46,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:46,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:46,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:46,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:46,378 INFO L87 Difference]: Start difference. First operand 177 states and 283 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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 21:03:48,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:48,810 INFO L93 Difference]: Finished difference Result 372 states and 593 transitions. [2022-11-02 21:03:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:03:48,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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 48 [2022-11-02 21:03:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:48,813 INFO L225 Difference]: With dead ends: 372 [2022-11-02 21:03:48,813 INFO L226 Difference]: Without dead ends: 205 [2022-11-02 21:03:48,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:48,815 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 22 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:48,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 448 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:03:48,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-02 21:03:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2022-11-02 21:03:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.6149732620320856) internal successors, (302), 187 states have internal predecessors, (302), 0 states have call successors, (0), 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 21:03:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 302 transitions. [2022-11-02 21:03:48,828 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 302 transitions. Word has length 48 [2022-11-02 21:03:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:48,829 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 302 transitions. [2022-11-02 21:03:48,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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 21:03:48,829 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 302 transitions. [2022-11-02 21:03:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 21:03:48,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:48,832 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:48,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:03:48,832 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:48,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:48,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1326962752, now seen corresponding path program 1 times [2022-11-02 21:03:48,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:48,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924087535] [2022-11-02 21:03:48,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:48,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:49,375 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 21:03:49,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:49,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924087535] [2022-11-02 21:03:49,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924087535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:49,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:49,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:49,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175199936] [2022-11-02 21:03:49,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:49,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:49,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:49,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:49,379 INFO L87 Difference]: Start difference. First operand 188 states and 302 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:51,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:51,975 INFO L93 Difference]: Finished difference Result 514 states and 830 transitions. [2022-11-02 21:03:51,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:03:51,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-11-02 21:03:51,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:51,979 INFO L225 Difference]: With dead ends: 514 [2022-11-02 21:03:51,979 INFO L226 Difference]: Without dead ends: 347 [2022-11-02 21:03:51,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:51,981 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:51,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 311 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 262 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 21:03:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-02 21:03:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 220. [2022-11-02 21:03:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6118721461187215) internal successors, (353), 219 states have internal predecessors, (353), 0 states have call successors, (0), 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 21:03:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 353 transitions. [2022-11-02 21:03:52,007 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 353 transitions. Word has length 61 [2022-11-02 21:03:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:52,008 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 353 transitions. [2022-11-02 21:03:52,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 353 transitions. [2022-11-02 21:03:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 21:03:52,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:52,010 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:52,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:03:52,011 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1254725184, now seen corresponding path program 1 times [2022-11-02 21:03:52,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:52,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443847756] [2022-11-02 21:03:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:52,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:52,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:52,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443847756] [2022-11-02 21:03:52,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443847756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:52,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:52,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62968128] [2022-11-02 21:03:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:52,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:52,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:52,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:52,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:52,409 INFO L87 Difference]: Start difference. First operand 220 states and 353 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:54,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:54,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:54,813 INFO L93 Difference]: Finished difference Result 435 states and 694 transitions. [2022-11-02 21:03:54,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:03:54,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-02 21:03:54,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:54,815 INFO L225 Difference]: With dead ends: 435 [2022-11-02 21:03:54,815 INFO L226 Difference]: Without dead ends: 236 [2022-11-02 21:03:54,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:54,817 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 21 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:54,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 452 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:03:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-02 21:03:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2022-11-02 21:03:54,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6073059360730593) internal successors, (352), 219 states have internal predecessors, (352), 0 states have call successors, (0), 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 21:03:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 352 transitions. [2022-11-02 21:03:54,832 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 352 transitions. Word has length 62 [2022-11-02 21:03:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:54,832 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 352 transitions. [2022-11-02 21:03:54,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 352 transitions. [2022-11-02 21:03:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 21:03:54,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:54,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:54,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:03:54,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:54,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1693511684, now seen corresponding path program 1 times [2022-11-02 21:03:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:54,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036487833] [2022-11-02 21:03:54,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:55,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:55,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:55,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036487833] [2022-11-02 21:03:55,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036487833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:55,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:55,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:55,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839034413] [2022-11-02 21:03:55,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:55,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:55,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:55,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:55,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:55,327 INFO L87 Difference]: Start difference. First operand 220 states and 352 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:57,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:57,954 INFO L93 Difference]: Finished difference Result 519 states and 825 transitions. [2022-11-02 21:03:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:03:57,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-02 21:03:57,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:57,957 INFO L225 Difference]: With dead ends: 519 [2022-11-02 21:03:57,957 INFO L226 Difference]: Without dead ends: 320 [2022-11-02 21:03:57,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:57,958 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 139 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:57,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 311 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 21:03:57,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-02 21:03:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 221. [2022-11-02 21:03:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5954545454545455) internal successors, (351), 220 states have internal predecessors, (351), 0 states have call successors, (0), 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 21:03:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 351 transitions. [2022-11-02 21:03:57,969 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 351 transitions. Word has length 62 [2022-11-02 21:03:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:57,970 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 351 transitions. [2022-11-02 21:03:57,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 351 transitions. [2022-11-02 21:03:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:03:57,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:57,971 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:57,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:03:57,972 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:57,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1066809839, now seen corresponding path program 1 times [2022-11-02 21:03:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:57,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280640098] [2022-11-02 21:03:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:58,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:58,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280640098] [2022-11-02 21:03:58,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280640098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:58,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:58,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:58,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181465044] [2022-11-02 21:03:58,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:58,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:58,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:58,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:58,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:58,395 INFO L87 Difference]: Start difference. First operand 221 states and 351 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:04:00,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:01,020 INFO L93 Difference]: Finished difference Result 519 states and 821 transitions. [2022-11-02 21:04:01,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:01,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-11-02 21:04:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:01,024 INFO L225 Difference]: With dead ends: 519 [2022-11-02 21:04:01,024 INFO L226 Difference]: Without dead ends: 319 [2022-11-02 21:04:01,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:01,025 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 144 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:01,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 313 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 21:04:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-02 21:04:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2022-11-02 21:04:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5772727272727274) internal successors, (347), 220 states have internal predecessors, (347), 0 states have call successors, (0), 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 21:04:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2022-11-02 21:04:01,037 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 63 [2022-11-02 21:04:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:01,037 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2022-11-02 21:04:01,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:04:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2022-11-02 21:04:01,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 21:04:01,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:01,039 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:01,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:04:01,039 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:01,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1102657701, now seen corresponding path program 1 times [2022-11-02 21:04:01,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:01,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121768056] [2022-11-02 21:04:01,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:01,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:01,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121768056] [2022-11-02 21:04:01,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121768056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:01,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:01,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:01,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577204052] [2022-11-02 21:04:01,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:01,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:01,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:01,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:01,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:01,448 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:04:03,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:03,887 INFO L93 Difference]: Finished difference Result 434 states and 682 transitions. [2022-11-02 21:04:03,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:03,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-11-02 21:04:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:03,889 INFO L225 Difference]: With dead ends: 434 [2022-11-02 21:04:03,889 INFO L226 Difference]: Without dead ends: 234 [2022-11-02 21:04:03,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:03,891 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:03,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:04:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-02 21:04:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 221. [2022-11-02 21:04:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5727272727272728) internal successors, (346), 220 states have internal predecessors, (346), 0 states have call successors, (0), 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 21:04:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 346 transitions. [2022-11-02 21:04:03,900 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 346 transitions. Word has length 63 [2022-11-02 21:04:03,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:03,900 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 346 transitions. [2022-11-02 21:04:03,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 21:04:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 346 transitions. [2022-11-02 21:04:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 21:04:03,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:03,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:03,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:04:03,902 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:03,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash -195504471, now seen corresponding path program 1 times [2022-11-02 21:04:03,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:03,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133263364] [2022-11-02 21:04:03,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:04,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:04,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133263364] [2022-11-02 21:04:04,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133263364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:04,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:04,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:04,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053628024] [2022-11-02 21:04:04,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:04,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:04,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:04,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:04,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:04,322 INFO L87 Difference]: Start difference. First operand 221 states and 346 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 21:04:06,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:06,925 INFO L93 Difference]: Finished difference Result 519 states and 813 transitions. [2022-11-02 21:04:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:06,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 21:04:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:06,928 INFO L225 Difference]: With dead ends: 519 [2022-11-02 21:04:06,928 INFO L226 Difference]: Without dead ends: 319 [2022-11-02 21:04:06,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:06,929 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 141 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:06,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 313 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 21:04:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-02 21:04:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2022-11-02 21:04:06,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5545454545454545) internal successors, (342), 220 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 342 transitions. [2022-11-02 21:04:06,941 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 342 transitions. Word has length 64 [2022-11-02 21:04:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:06,941 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 342 transitions. [2022-11-02 21:04:06,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 21:04:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 342 transitions. [2022-11-02 21:04:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:04:06,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:06,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:06,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:04:06,943 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash 307896966, now seen corresponding path program 1 times [2022-11-02 21:04:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:06,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727549068] [2022-11-02 21:04:06,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:06,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:07,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:07,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727549068] [2022-11-02 21:04:07,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727549068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:07,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:07,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:07,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272912590] [2022-11-02 21:04:07,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:07,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:07,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:07,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:07,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:07,306 INFO L87 Difference]: Start difference. First operand 221 states and 342 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 21:04:09,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:09,891 INFO L93 Difference]: Finished difference Result 519 states and 806 transitions. [2022-11-02 21:04:09,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:09,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-11-02 21:04:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:09,894 INFO L225 Difference]: With dead ends: 519 [2022-11-02 21:04:09,895 INFO L226 Difference]: Without dead ends: 317 [2022-11-02 21:04:09,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:09,896 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 111 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:09,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 327 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:04:09,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-02 21:04:09,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 246. [2022-11-02 21:04:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.5959183673469388) internal successors, (391), 245 states have internal predecessors, (391), 0 states have call successors, (0), 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 21:04:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 391 transitions. [2022-11-02 21:04:09,906 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 391 transitions. Word has length 65 [2022-11-02 21:04:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:09,907 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 391 transitions. [2022-11-02 21:04:09,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 21:04:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 391 transitions. [2022-11-02 21:04:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 21:04:09,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:09,909 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:09,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:04:09,909 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1634406600, now seen corresponding path program 1 times [2022-11-02 21:04:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:09,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903626074] [2022-11-02 21:04:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:09,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:04:10,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:10,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903626074] [2022-11-02 21:04:10,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903626074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:10,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:10,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:10,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292722695] [2022-11-02 21:04:10,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:10,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:10,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:10,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:10,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:10,242 INFO L87 Difference]: Start difference. First operand 246 states and 391 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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 21:04:12,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:12,658 INFO L93 Difference]: Finished difference Result 511 states and 814 transitions. [2022-11-02 21:04:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:12,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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 94 [2022-11-02 21:04:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:12,661 INFO L225 Difference]: With dead ends: 511 [2022-11-02 21:04:12,661 INFO L226 Difference]: Without dead ends: 286 [2022-11-02 21:04:12,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:12,663 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 30 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:12,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 506 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:04:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-02 21:04:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 268. [2022-11-02 21:04:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.591760299625468) internal successors, (425), 267 states have internal predecessors, (425), 0 states have call successors, (0), 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 21:04:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2022-11-02 21:04:12,674 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 94 [2022-11-02 21:04:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:12,674 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2022-11-02 21:04:12,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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 21:04:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2022-11-02 21:04:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 21:04:12,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:12,676 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:12,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:04:12,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:12,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:12,678 INFO L85 PathProgramCache]: Analyzing trace with hash 217673300, now seen corresponding path program 1 times [2022-11-02 21:04:12,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:12,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242930397] [2022-11-02 21:04:12,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:12,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 21:04:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:13,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242930397] [2022-11-02 21:04:13,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242930397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:13,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:13,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:13,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414763903] [2022-11-02 21:04:13,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:13,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:13,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:13,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:13,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:13,267 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 21:04:15,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:15,644 INFO L93 Difference]: Finished difference Result 528 states and 840 transitions. [2022-11-02 21:04:15,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:15,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 94 [2022-11-02 21:04:15,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:15,646 INFO L225 Difference]: With dead ends: 528 [2022-11-02 21:04:15,646 INFO L226 Difference]: Without dead ends: 281 [2022-11-02 21:04:15,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:15,648 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 20 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:15,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:04:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-02 21:04:15,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 268. [2022-11-02 21:04:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5880149812734083) internal successors, (424), 267 states have internal predecessors, (424), 0 states have call successors, (0), 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 21:04:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 424 transitions. [2022-11-02 21:04:15,660 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 424 transitions. Word has length 94 [2022-11-02 21:04:15,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:15,660 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 424 transitions. [2022-11-02 21:04:15,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 21:04:15,661 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 424 transitions. [2022-11-02 21:04:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 21:04:15,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:15,663 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:15,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:04:15,663 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:15,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1724300080, now seen corresponding path program 1 times [2022-11-02 21:04:15,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:15,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114875009] [2022-11-02 21:04:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:15,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 21:04:16,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:16,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114875009] [2022-11-02 21:04:16,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114875009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:16,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:16,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154272712] [2022-11-02 21:04:16,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:16,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:16,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:16,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:16,132 INFO L87 Difference]: Start difference. First operand 268 states and 424 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 21:04:18,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:18,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:18,487 INFO L93 Difference]: Finished difference Result 518 states and 826 transitions. [2022-11-02 21:04:18,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:18,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-11-02 21:04:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:18,489 INFO L225 Difference]: With dead ends: 518 [2022-11-02 21:04:18,489 INFO L226 Difference]: Without dead ends: 271 [2022-11-02 21:04:18,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:18,491 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 11 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:18,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 472 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:04:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-02 21:04:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2022-11-02 21:04:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5842696629213484) internal successors, (423), 267 states have internal predecessors, (423), 0 states have call successors, (0), 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 21:04:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 423 transitions. [2022-11-02 21:04:18,503 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 423 transitions. Word has length 95 [2022-11-02 21:04:18,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:18,503 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 423 transitions. [2022-11-02 21:04:18,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 21:04:18,504 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 423 transitions. [2022-11-02 21:04:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 21:04:18,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:18,506 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:18,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:04:18,506 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:18,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:18,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1693697111, now seen corresponding path program 1 times [2022-11-02 21:04:18,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:18,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266408018] [2022-11-02 21:04:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:18,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 21:04:18,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:18,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266408018] [2022-11-02 21:04:18,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266408018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:18,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:18,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:18,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277760062] [2022-11-02 21:04:18,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:18,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:18,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:18,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:18,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:18,891 INFO L87 Difference]: Start difference. First operand 268 states and 423 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 21:04:20,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:21,269 INFO L93 Difference]: Finished difference Result 532 states and 844 transitions. [2022-11-02 21:04:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:21,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 108 [2022-11-02 21:04:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:21,272 INFO L225 Difference]: With dead ends: 532 [2022-11-02 21:04:21,272 INFO L226 Difference]: Without dead ends: 285 [2022-11-02 21:04:21,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:21,273 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:21,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 478 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:04:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-02 21:04:21,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 268. [2022-11-02 21:04:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5805243445692885) internal successors, (422), 267 states have internal predecessors, (422), 0 states have call successors, (0), 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 21:04:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 422 transitions. [2022-11-02 21:04:21,284 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 422 transitions. Word has length 108 [2022-11-02 21:04:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:21,285 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 422 transitions. [2022-11-02 21:04:21,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 21:04:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 422 transitions. [2022-11-02 21:04:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-02 21:04:21,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:21,287 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:21,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:04:21,288 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:21,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:21,288 INFO L85 PathProgramCache]: Analyzing trace with hash 778760430, now seen corresponding path program 1 times [2022-11-02 21:04:21,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:21,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279287414] [2022-11-02 21:04:21,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:21,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 21:04:21,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:21,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279287414] [2022-11-02 21:04:21,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279287414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:21,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:21,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223178232] [2022-11-02 21:04:21,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:21,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:21,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:21,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:21,711 INFO L87 Difference]: Start difference. First operand 268 states and 422 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 21:04:23,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:24,358 INFO L93 Difference]: Finished difference Result 586 states and 915 transitions. [2022-11-02 21:04:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:24,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 109 [2022-11-02 21:04:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:24,361 INFO L225 Difference]: With dead ends: 586 [2022-11-02 21:04:24,361 INFO L226 Difference]: Without dead ends: 339 [2022-11-02 21:04:24,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:24,363 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 140 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:24,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 21:04:24,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-11-02 21:04:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2022-11-02 21:04:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5655430711610487) internal successors, (418), 267 states have internal predecessors, (418), 0 states have call successors, (0), 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 21:04:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 418 transitions. [2022-11-02 21:04:24,375 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 418 transitions. Word has length 109 [2022-11-02 21:04:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:24,375 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 418 transitions. [2022-11-02 21:04:24,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 21:04:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 418 transitions. [2022-11-02 21:04:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-02 21:04:24,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:24,377 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:24,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:04:24,378 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:24,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:24,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1220545399, now seen corresponding path program 1 times [2022-11-02 21:04:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:24,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694781798] [2022-11-02 21:04:24,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:24,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 21:04:24,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:24,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694781798] [2022-11-02 21:04:24,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694781798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:24,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:24,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:24,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185039559] [2022-11-02 21:04:24,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:24,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:24,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:24,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:24,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:24,808 INFO L87 Difference]: Start difference. First operand 268 states and 418 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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 21:04:26,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:27,489 INFO L93 Difference]: Finished difference Result 586 states and 907 transitions. [2022-11-02 21:04:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:27,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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 111 [2022-11-02 21:04:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:27,492 INFO L225 Difference]: With dead ends: 586 [2022-11-02 21:04:27,492 INFO L226 Difference]: Without dead ends: 339 [2022-11-02 21:04:27,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:27,493 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 137 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:27,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 21:04:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-11-02 21:04:27,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2022-11-02 21:04:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.550561797752809) internal successors, (414), 267 states have internal predecessors, (414), 0 states have call successors, (0), 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 21:04:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 414 transitions. [2022-11-02 21:04:27,505 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 414 transitions. Word has length 111 [2022-11-02 21:04:27,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:27,506 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 414 transitions. [2022-11-02 21:04:27,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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 21:04:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 414 transitions. [2022-11-02 21:04:27,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 21:04:27,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:27,508 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:27,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:04:27,508 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:27,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:27,509 INFO L85 PathProgramCache]: Analyzing trace with hash 89193371, now seen corresponding path program 1 times [2022-11-02 21:04:27,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:27,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251320231] [2022-11-02 21:04:27,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:27,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 21:04:27,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:27,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251320231] [2022-11-02 21:04:27,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251320231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:27,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:27,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570834415] [2022-11-02 21:04:27,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:27,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:27,862 INFO L87 Difference]: Start difference. First operand 268 states and 414 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:29,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:30,235 INFO L93 Difference]: Finished difference Result 522 states and 813 transitions. [2022-11-02 21:04:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:30,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2022-11-02 21:04:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:30,238 INFO L225 Difference]: With dead ends: 522 [2022-11-02 21:04:30,238 INFO L226 Difference]: Without dead ends: 275 [2022-11-02 21:04:30,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:30,239 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 26 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:30,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 492 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:04:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-02 21:04:30,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2022-11-02 21:04:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.546816479400749) internal successors, (413), 267 states have internal predecessors, (413), 0 states have call successors, (0), 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 21:04:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 413 transitions. [2022-11-02 21:04:30,252 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 413 transitions. Word has length 112 [2022-11-02 21:04:30,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:30,253 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 413 transitions. [2022-11-02 21:04:30,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2022-11-02 21:04:30,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-02 21:04:30,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:30,255 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:04:30,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:04:30,256 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:30,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1884563494, now seen corresponding path program 1 times [2022-11-02 21:04:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:30,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548785859] [2022-11-02 21:04:30,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:30,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:04:30,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:30,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548785859] [2022-11-02 21:04:30,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548785859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:30,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:30,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:30,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934489961] [2022-11-02 21:04:30,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:30,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:30,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:30,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:30,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:30,798 INFO L87 Difference]: Start difference. First operand 268 states and 413 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:32,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:33,429 INFO L93 Difference]: Finished difference Result 624 states and 964 transitions. [2022-11-02 21:04:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:33,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-11-02 21:04:33,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:33,432 INFO L225 Difference]: With dead ends: 624 [2022-11-02 21:04:33,432 INFO L226 Difference]: Without dead ends: 377 [2022-11-02 21:04:33,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:33,434 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 116 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:33,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 325 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 252 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 21:04:33,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-02 21:04:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 300. [2022-11-02 21:04:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.5518394648829432) internal successors, (464), 299 states have internal predecessors, (464), 0 states have call successors, (0), 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 21:04:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 464 transitions. [2022-11-02 21:04:33,447 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 464 transitions. Word has length 116 [2022-11-02 21:04:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:33,447 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 464 transitions. [2022-11-02 21:04:33,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 464 transitions. [2022-11-02 21:04:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-02 21:04:33,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:33,450 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 21:04:33,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:04:33,450 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:33,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:33,451 INFO L85 PathProgramCache]: Analyzing trace with hash -220313936, now seen corresponding path program 1 times [2022-11-02 21:04:33,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:33,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300678153] [2022-11-02 21:04:33,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:33,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:04:33,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:33,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300678153] [2022-11-02 21:04:33,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300678153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:33,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:33,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:33,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642692068] [2022-11-02 21:04:33,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:33,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:33,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:33,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:33,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:33,961 INFO L87 Difference]: Start difference. First operand 300 states and 464 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:35,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:36,527 INFO L93 Difference]: Finished difference Result 694 states and 1072 transitions. [2022-11-02 21:04:36,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:36,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-11-02 21:04:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:36,530 INFO L225 Difference]: With dead ends: 694 [2022-11-02 21:04:36,531 INFO L226 Difference]: Without dead ends: 415 [2022-11-02 21:04:36,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:36,532 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 109 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:36,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 315 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 262 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:04:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-11-02 21:04:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 343. [2022-11-02 21:04:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.5614035087719298) internal successors, (534), 342 states have internal predecessors, (534), 0 states have call successors, (0), 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 21:04:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 534 transitions. [2022-11-02 21:04:36,548 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 534 transitions. Word has length 127 [2022-11-02 21:04:36,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:36,549 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 534 transitions. [2022-11-02 21:04:36,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 534 transitions. [2022-11-02 21:04:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-02 21:04:36,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:36,552 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 21:04:36,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:04:36,552 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:36,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:36,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1658817010, now seen corresponding path program 1 times [2022-11-02 21:04:36,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:36,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587709719] [2022-11-02 21:04:36,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 21:04:36,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:36,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587709719] [2022-11-02 21:04:36,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587709719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:36,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:36,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:36,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487101705] [2022-11-02 21:04:36,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:36,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:36,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:36,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:36,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:36,799 INFO L87 Difference]: Start difference. First operand 343 states and 534 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:36,848 INFO L93 Difference]: Finished difference Result 987 states and 1552 transitions. [2022-11-02 21:04:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:36,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-11-02 21:04:36,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:36,854 INFO L225 Difference]: With dead ends: 987 [2022-11-02 21:04:36,854 INFO L226 Difference]: Without dead ends: 665 [2022-11-02 21:04:36,855 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 21:04:36,857 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 143 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 558 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 21:04:36,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 558 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-11-02 21:04:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2022-11-02 21:04:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.566465256797583) internal successors, (1037), 662 states have internal predecessors, (1037), 0 states have call successors, (0), 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 21:04:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1037 transitions. [2022-11-02 21:04:36,883 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1037 transitions. Word has length 127 [2022-11-02 21:04:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:36,883 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 1037 transitions. [2022-11-02 21:04:36,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1037 transitions. [2022-11-02 21:04:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-02 21:04:36,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:36,886 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 21:04:36,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:04:36,887 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:36,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:36,888 INFO L85 PathProgramCache]: Analyzing trace with hash -390570832, now seen corresponding path program 1 times [2022-11-02 21:04:36,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:36,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113053665] [2022-11-02 21:04:36,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:36,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:04:37,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:37,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113053665] [2022-11-02 21:04:37,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113053665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:37,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:37,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:37,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373004138] [2022-11-02 21:04:37,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:37,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:37,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:37,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:37,099 INFO L87 Difference]: Start difference. First operand 663 states and 1037 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:37,150 INFO L93 Difference]: Finished difference Result 1580 states and 2483 transitions. [2022-11-02 21:04:37,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:37,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-11-02 21:04:37,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:37,155 INFO L225 Difference]: With dead ends: 1580 [2022-11-02 21:04:37,156 INFO L226 Difference]: Without dead ends: 938 [2022-11-02 21:04:37,159 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 21:04:37,161 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 138 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 431 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 21:04:37,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 431 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-11-02 21:04:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2022-11-02 21:04:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 1.5635005336179295) internal successors, (1465), 937 states have internal predecessors, (1465), 0 states have call successors, (0), 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 21:04:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1465 transitions. [2022-11-02 21:04:37,203 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1465 transitions. Word has length 127 [2022-11-02 21:04:37,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:37,204 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 1465 transitions. [2022-11-02 21:04:37,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1465 transitions. [2022-11-02 21:04:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-02 21:04:37,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:37,208 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 21:04:37,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:04:37,208 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:37,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:37,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1945821678, now seen corresponding path program 1 times [2022-11-02 21:04:37,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:37,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202191324] [2022-11-02 21:04:37,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:37,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-02 21:04:37,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:37,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202191324] [2022-11-02 21:04:37,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202191324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:37,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:37,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:37,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020750482] [2022-11-02 21:04:37,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:37,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:37,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:37,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:37,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:37,372 INFO L87 Difference]: Start difference. First operand 938 states and 1465 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 21:04:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:37,417 INFO L93 Difference]: Finished difference Result 1882 states and 2942 transitions. [2022-11-02 21:04:37,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:37,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-11-02 21:04:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:37,422 INFO L225 Difference]: With dead ends: 1882 [2022-11-02 21:04:37,422 INFO L226 Difference]: Without dead ends: 965 [2022-11-02 21:04:37,424 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 21:04:37,425 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 15 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:37,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 404 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-11-02 21:04:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2022-11-02 21:04:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.5560165975103735) internal successors, (1500), 964 states have internal predecessors, (1500), 0 states have call successors, (0), 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 21:04:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1500 transitions. [2022-11-02 21:04:37,463 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1500 transitions. Word has length 127 [2022-11-02 21:04:37,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:37,464 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1500 transitions. [2022-11-02 21:04:37,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 21:04:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1500 transitions. [2022-11-02 21:04:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-02 21:04:37,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:37,468 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 21:04:37,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:04:37,468 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:37,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:37,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1322540076, now seen corresponding path program 1 times [2022-11-02 21:04:37,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:37,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033162745] [2022-11-02 21:04:37,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:37,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-02 21:04:37,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:37,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033162745] [2022-11-02 21:04:37,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033162745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:37,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:37,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:37,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449676328] [2022-11-02 21:04:37,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:37,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:37,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:37,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:37,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:37,670 INFO L87 Difference]: Start difference. First operand 965 states and 1500 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 21:04:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:37,703 INFO L93 Difference]: Finished difference Result 1591 states and 2470 transitions. [2022-11-02 21:04:37,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:37,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-11-02 21:04:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:37,707 INFO L225 Difference]: With dead ends: 1591 [2022-11-02 21:04:37,707 INFO L226 Difference]: Without dead ends: 647 [2022-11-02 21:04:37,708 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 21:04:37,710 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:37,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:04:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-11-02 21:04:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-11-02 21:04:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.5386996904024768) internal successors, (994), 646 states have internal predecessors, (994), 0 states have call successors, (0), 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 21:04:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 994 transitions. [2022-11-02 21:04:37,736 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 994 transitions. Word has length 127 [2022-11-02 21:04:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:37,736 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 994 transitions. [2022-11-02 21:04:37,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 21:04:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 994 transitions. [2022-11-02 21:04:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-02 21:04:37,739 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:37,739 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:37,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:04:37,740 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:37,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:37,741 INFO L85 PathProgramCache]: Analyzing trace with hash -116280318, now seen corresponding path program 1 times [2022-11-02 21:04:37,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:37,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300023974] [2022-11-02 21:04:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-02 21:04:40,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:40,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300023974] [2022-11-02 21:04:40,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300023974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:40,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:40,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:04:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970888838] [2022-11-02 21:04:40,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:40,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:04:40,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:40,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:04:40,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:40,095 INFO L87 Difference]: Start difference. First operand 647 states and 994 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 21:04:42,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:44,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:44,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:44,661 INFO L93 Difference]: Finished difference Result 1291 states and 1984 transitions. [2022-11-02 21:04:44,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:04:44,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 128 [2022-11-02 21:04:44,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:44,665 INFO L225 Difference]: With dead ends: 1291 [2022-11-02 21:04:44,665 INFO L226 Difference]: Without dead ends: 647 [2022-11-02 21:04:44,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:44,667 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 7 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:44,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 635 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 21:04:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-11-02 21:04:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-11-02 21:04:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.5371517027863777) internal successors, (993), 646 states have internal predecessors, (993), 0 states have call successors, (0), 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 21:04:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 993 transitions. [2022-11-02 21:04:44,690 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 993 transitions. Word has length 128 [2022-11-02 21:04:44,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:44,691 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 993 transitions. [2022-11-02 21:04:44,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 21:04:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 993 transitions. [2022-11-02 21:04:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-02 21:04:44,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:44,693 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:44,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 21:04:44,694 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:44,694 INFO L85 PathProgramCache]: Analyzing trace with hash -545938624, now seen corresponding path program 1 times [2022-11-02 21:04:44,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:44,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854652050] [2022-11-02 21:04:44,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:44,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:04:45,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:04:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:04:45,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:04:45,926 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:04:45,928 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 21:04:45,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:04:45,934 INFO L444 BasicCegarLoop]: Path program 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 21:04:45,938 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:04:46,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:04:46 BoogieIcfgContainer [2022-11-02 21:04:46,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:04:46,092 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:04:46,092 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:04:46,093 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:04:46,093 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:03:41" (3/4) ... [2022-11-02 21:04:46,097 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 21:04:46,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:04:46,098 INFO L158 Benchmark]: Toolchain (without parser) took 68764.20ms. Allocated memory was 127.9MB in the beginning and 373.3MB in the end (delta: 245.4MB). Free memory was 91.3MB in the beginning and 274.0MB in the end (delta: -182.7MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2022-11-02 21:04:46,098 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 59.0MB in the end (delta: 31.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:04:46,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 747.82ms. Allocated memory is still 127.9MB. Free memory was 91.0MB in the beginning and 82.6MB in the end (delta: 8.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 21:04:46,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.01ms. Allocated memory is still 127.9MB. Free memory was 82.6MB in the beginning and 77.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 21:04:46,099 INFO L158 Benchmark]: Boogie Preprocessor took 140.19ms. Allocated memory is still 127.9MB. Free memory was 77.5MB in the beginning and 70.0MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 21:04:46,100 INFO L158 Benchmark]: RCFGBuilder took 3256.82ms. Allocated memory is still 127.9MB. Free memory was 70.0MB in the beginning and 86.3MB in the end (delta: -16.3MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2022-11-02 21:04:46,100 INFO L158 Benchmark]: TraceAbstraction took 64493.83ms. Allocated memory was 127.9MB in the beginning and 373.3MB in the end (delta: 245.4MB). Free memory was 85.5MB in the beginning and 274.0MB in the end (delta: -188.5MB). Peak memory consumption was 173.0MB. Max. memory is 16.1GB. [2022-11-02 21:04:46,100 INFO L158 Benchmark]: Witness Printer took 5.24ms. Allocated memory is still 373.3MB. Free memory is still 274.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:04:46,102 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.29ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 59.0MB in the end (delta: 31.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 747.82ms. Allocated memory is still 127.9MB. Free memory was 91.0MB in the beginning and 82.6MB in the end (delta: 8.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.01ms. Allocated memory is still 127.9MB. Free memory was 82.6MB in the beginning and 77.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.19ms. Allocated memory is still 127.9MB. Free memory was 77.5MB in the beginning and 70.0MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3256.82ms. Allocated memory is still 127.9MB. Free memory was 70.0MB in the beginning and 86.3MB in the end (delta: -16.3MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * TraceAbstraction took 64493.83ms. Allocated memory was 127.9MB in the beginning and 373.3MB in the end (delta: 245.4MB). Free memory was 85.5MB in the beginning and 274.0MB in the end (delta: -188.5MB). Peak memory consumption was 173.0MB. Max. memory is 16.1GB. * Witness Printer took 5.24ms. Allocated memory is still 373.3MB. Free memory is still 274.0MB. There was no memory consumed. 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 - UnprovableResult [Line: 1737]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1151. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->info_callback={0:5}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1160] EXPR s->cert VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=0, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->hit=7, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1383] s->init_num = 0 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967307, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1618] COND TRUE blastFlag == 5 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1737] reach_error() VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=1, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.3s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 50.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 20 mSolverCounterUnknown, 1815 SdHoareTripleChecker+Valid, 49.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1815 mSDsluCounter, 9467 SdHoareTripleChecker+Invalid, 47.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5584 mSDsCounter, 648 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3996 IncrementalHoareTripleChecker+Invalid, 4664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 648 mSolverCounterUnsat, 3883 mSDtfsCounter, 3996 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=965occurred in iteration=21, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 963 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 2265 NumberOfCodeBlocks, 2265 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2114 ConstructedInterpolants, 0 QuantifiedInterpolants, 5015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1192/1192 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 21:04:46,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/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_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/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 a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 --- 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 21:04:48,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:04:48,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:04:48,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:04:48,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:04:48,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:04:48,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:04:48,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:04:48,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:04:48,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:04:48,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:04:48,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:04:48,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:04:48,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:04:48,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:04:48,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:04:48,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:04:48,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:04:48,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:04:48,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:04:48,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:04:48,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:04:48,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:04:48,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:04:48,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:04:48,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:04:48,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:04:48,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:04:48,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:04:48,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:04:48,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:04:48,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:04:48,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:04:48,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:04:48,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:04:48,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:04:48,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:04:48,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:04:48,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:04:48,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:04:48,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:04:48,929 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-02 21:04:48,959 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:04:48,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:04:48,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:04:48,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:04:48,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:04:48,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:04:48,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:04:48,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:04:48,966 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:04:48,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:04:48,968 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:04:48,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:04:48,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:04:48,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:04:48,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:04:48,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:04:48,969 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 21:04:48,970 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 21:04:48,970 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 21:04:48,970 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:04:48,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:04:48,971 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:04:48,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:04:48,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:04:48,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:04:48,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:04:48,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:48,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:04:48,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:04:48,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:04:48,973 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 21:04:48,973 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 21:04:48,974 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:04:48,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:04:48,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:04:48,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 21:04:48,975 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_a3e808c8-97a3-424b-b297-b5653d61af2a/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_a3e808c8-97a3-424b-b297-b5653d61af2a/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 -> a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 [2022-11-02 21:04:49,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:04:49,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:04:49,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:04:49,440 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:04:49,441 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:04:49,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-11-02 21:04:49,532 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/data/5212309c2/5337092ffbe94be7b478ad99f30e3ec7/FLAGae879b9ca [2022-11-02 21:04:50,360 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:04:50,361 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-11-02 21:04:50,390 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/data/5212309c2/5337092ffbe94be7b478ad99f30e3ec7/FLAGae879b9ca [2022-11-02 21:04:50,541 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/data/5212309c2/5337092ffbe94be7b478ad99f30e3ec7 [2022-11-02 21:04:50,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:04:50,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:04:50,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:50,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:04:50,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:04:50,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:50" (1/1) ... [2022-11-02 21:04:50,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1999773f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:50, skipping insertion in model container [2022-11-02 21:04:50,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:50" (1/1) ... [2022-11-02 21:04:50,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:04:50,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:04:51,210 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_a3e808c8-97a3-424b-b297-b5653d61af2a/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-11-02 21:04:51,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:51,246 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-02 21:04:51,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:04:51,479 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_a3e808c8-97a3-424b-b297-b5653d61af2a/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-11-02 21:04:51,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:51,501 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:04:51,687 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_a3e808c8-97a3-424b-b297-b5653d61af2a/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-11-02 21:04:51,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:51,728 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:04:51,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:51 WrapperNode [2022-11-02 21:04:51,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:51,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:51,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:04:51,731 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:04:51,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:51" (1/1) ... [2022-11-02 21:04:51,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:51" (1/1) ... [2022-11-02 21:04:51,858 INFO L138 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 757 [2022-11-02 21:04:51,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:51,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:04:51,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:04:51,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:04:51,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:51" (1/1) ... [2022-11-02 21:04:51,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:51" (1/1) ... [2022-11-02 21:04:51,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:51" (1/1) ... [2022-11-02 21:04:51,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:51" (1/1) ... [2022-11-02 21:04:51,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:51" (1/1) ... [2022-11-02 21:04:51,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:51" (1/1) ... [2022-11-02 21:04:51,976 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:51" (1/1) ... [2022-11-02 21:04:51,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:51" (1/1) ... [2022-11-02 21:04:51,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:04:51,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:04:51,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:04:51,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:04:51,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:51" (1/1) ... [2022-11-02 21:04:52,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:52,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:52,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:04:52,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:04:52,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:04:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 21:04:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:04:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-02 21:04:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:04:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:04:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:04:52,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:04:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-02 21:04:52,360 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:04:52,363 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:04:52,386 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:05:01,869 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-11-02 21:05:01,869 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-11-02 21:05:01,869 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:05:01,878 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:05:01,878 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 21:05:01,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:01 BoogieIcfgContainer [2022-11-02 21:05:01,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:05:01,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:05:01,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:05:01,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:05:01,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:04:50" (1/3) ... [2022-11-02 21:05:01,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b074f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:01, skipping insertion in model container [2022-11-02 21:05:01,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:51" (2/3) ... [2022-11-02 21:05:01,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b074f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:01, skipping insertion in model container [2022-11-02 21:05:01,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:01" (3/3) ... [2022-11-02 21:05:01,890 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-11-02 21:05:01,909 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:05:01,909 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:05:01,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:05:01,969 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;@6fd31467, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:05:01,969 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:05:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 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 21:05:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 21:05:01,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:01,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:01,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:01,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:01,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1430116946, now seen corresponding path program 1 times [2022-11-02 21:05:02,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:05:02,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743498924] [2022-11-02 21:05:02,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:02,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:05:02,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:05:02,013 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:05:02,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 21:05:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:02,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:05:02,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:02,940 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 21:05:02,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:05:02,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:05:02,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743498924] [2022-11-02 21:05:02,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743498924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:02,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:02,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:05:02,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563725063] [2022-11-02 21:05:02,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:02,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:02,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:05:03,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:03,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:03,014 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 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 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 21:05:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:03,128 INFO L93 Difference]: Finished difference Result 418 states and 704 transitions. [2022-11-02 21:05:03,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:03,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-11-02 21:05:03,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:03,149 INFO L225 Difference]: With dead ends: 418 [2022-11-02 21:05:03,149 INFO L226 Difference]: Without dead ends: 255 [2022-11-02 21:05:03,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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 21:05:03,165 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 187 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 457 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 21:05:03,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 457 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:05:03,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-02 21:05:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-11-02 21:05:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.5118110236220472) internal successors, (384), 254 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 384 transitions. [2022-11-02 21:05:03,253 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 384 transitions. Word has length 47 [2022-11-02 21:05:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:03,254 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 384 transitions. [2022-11-02 21:05:03,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 21:05:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 384 transitions. [2022-11-02 21:05:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 21:05:03,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:03,258 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:03,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:03,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:05:03,461 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:03,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:03,462 INFO L85 PathProgramCache]: Analyzing trace with hash -682574659, now seen corresponding path program 1 times [2022-11-02 21:05:03,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:05:03,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101312413] [2022-11-02 21:05:03,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:03,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:05:03,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:05:03,465 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:05:03,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 21:05:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:04,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:05:04,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:04,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:05:04,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:05:04,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101312413] [2022-11-02 21:05:04,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101312413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:04,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:04,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:05:04,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103141876] [2022-11-02 21:05:04,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:04,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:04,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:05:04,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:04,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:04,532 INFO L87 Difference]: Start difference. First operand 255 states and 384 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 21:05:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:04,743 INFO L93 Difference]: Finished difference Result 498 states and 757 transitions. [2022-11-02 21:05:04,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:04,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2022-11-02 21:05:04,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:04,753 INFO L225 Difference]: With dead ends: 498 [2022-11-02 21:05:04,753 INFO L226 Difference]: Without dead ends: 374 [2022-11-02 21:05:04,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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 21:05:04,759 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 137 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 562 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.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:04,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 562 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:05:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-11-02 21:05:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2022-11-02 21:05:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.5067024128686326) internal successors, (562), 373 states have internal predecessors, (562), 0 states have call successors, (0), 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 21:05:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 562 transitions. [2022-11-02 21:05:04,803 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 562 transitions. Word has length 64 [2022-11-02 21:05:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:04,803 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 562 transitions. [2022-11-02 21:05:04,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 21:05:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 562 transitions. [2022-11-02 21:05:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-02 21:05:04,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:04,816 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-11-02 21:05:04,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:05,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:05:05,034 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:05,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:05,034 INFO L85 PathProgramCache]: Analyzing trace with hash 485035231, now seen corresponding path program 1 times [2022-11-02 21:05:05,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:05:05,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357519621] [2022-11-02 21:05:05,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:05,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:05:05,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:05:05,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:05:05,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 21:05:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:05,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:05:05,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 21:05:06,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:05:06,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:05:06,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357519621] [2022-11-02 21:05:06,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357519621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:06,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:06,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:05:06,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929435426] [2022-11-02 21:05:06,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:06,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:06,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:05:06,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:06,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:06,016 INFO L87 Difference]: Start difference. First operand 374 states and 562 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 21:05:06,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:06,239 INFO L93 Difference]: Finished difference Result 737 states and 1115 transitions. [2022-11-02 21:05:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:06,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 86 [2022-11-02 21:05:06,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:06,243 INFO L225 Difference]: With dead ends: 737 [2022-11-02 21:05:06,243 INFO L226 Difference]: Without dead ends: 494 [2022-11-02 21:05:06,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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 21:05:06,245 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 137 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 566 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.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:06,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 566 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:05:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-11-02 21:05:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2022-11-02 21:05:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 1.5050709939148073) internal successors, (742), 493 states have internal predecessors, (742), 0 states have call successors, (0), 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 21:05:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 742 transitions. [2022-11-02 21:05:06,268 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 742 transitions. Word has length 86 [2022-11-02 21:05:06,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:06,268 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 742 transitions. [2022-11-02 21:05:06,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 21:05:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 742 transitions. [2022-11-02 21:05:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-02 21:05:06,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:06,272 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 21:05:06,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:06,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:05:06,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:06,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:06,498 INFO L85 PathProgramCache]: Analyzing trace with hash -220313936, now seen corresponding path program 1 times [2022-11-02 21:05:06,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:05:06,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874860679] [2022-11-02 21:05:06,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:06,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:05:06,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:05:06,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:05:06,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-02 21:05:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:07,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:05:07,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-02 21:05:07,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:05:07,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:05:07,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874860679] [2022-11-02 21:05:07,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874860679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:07,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:07,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:05:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18086340] [2022-11-02 21:05:07,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:07,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:07,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:05:07,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:07,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:07,628 INFO L87 Difference]: Start difference. First operand 494 states and 742 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:07,769 INFO L93 Difference]: Finished difference Result 854 states and 1285 transitions. [2022-11-02 21:05:07,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:07,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-11-02 21:05:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:07,772 INFO L225 Difference]: With dead ends: 854 [2022-11-02 21:05:07,772 INFO L226 Difference]: Without dead ends: 491 [2022-11-02 21:05:07,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 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 21:05:07,774 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 138 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:07,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 561 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-11-02 21:05:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-11-02 21:05:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.493877551020408) internal successors, (732), 490 states have internal predecessors, (732), 0 states have call successors, (0), 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 21:05:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 732 transitions. [2022-11-02 21:05:07,793 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 732 transitions. Word has length 127 [2022-11-02 21:05:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:07,794 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 732 transitions. [2022-11-02 21:05:07,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 732 transitions. [2022-11-02 21:05:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-02 21:05:07,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:07,797 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:07,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:08,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:05:08,016 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:08,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:08,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1760202500, now seen corresponding path program 1 times [2022-11-02 21:05:08,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:05:08,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270629695] [2022-11-02 21:05:08,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:08,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:05:08,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:05:08,020 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:05:08,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-02 21:05:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:09,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 21:05:09,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:09,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:09,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:09,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2022-11-02 21:05:09,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2022-11-02 21:05:09,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-11-02 21:05:09,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-11-02 21:05:09,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:05:09,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 21:05:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-02 21:05:09,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:05:09,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:05:09,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270629695] [2022-11-02 21:05:09,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270629695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:09,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:09,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:05:09,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997943826] [2022-11-02 21:05:09,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:09,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:05:09,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:05:09,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:05:09,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:05:09,858 INFO L87 Difference]: Start difference. First operand 491 states and 732 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 21:05:11,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:05:13,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:05:16,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:05:21,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:05:23,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:23,605 INFO L93 Difference]: Finished difference Result 979 states and 1460 transitions. [2022-11-02 21:05:23,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:05:23,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 128 [2022-11-02 21:05:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:23,610 INFO L225 Difference]: With dead ends: 979 [2022-11-02 21:05:23,611 INFO L226 Difference]: Without dead ends: 491 [2022-11-02 21:05:23,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:05:23,614 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 7 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:23,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 635 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 13.6s Time] [2022-11-02 21:05:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-11-02 21:05:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-11-02 21:05:23,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.4918367346938775) internal successors, (731), 490 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 731 transitions. [2022-11-02 21:05:23,633 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 731 transitions. Word has length 128 [2022-11-02 21:05:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:23,634 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 731 transitions. [2022-11-02 21:05:23,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 21:05:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 731 transitions. [2022-11-02 21:05:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-02 21:05:23,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:23,636 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:23,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:23,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:05:23,861 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:23,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:23,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1330544194, now seen corresponding path program 1 times [2022-11-02 21:05:23,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:05:23,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654825520] [2022-11-02 21:05:23,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:23,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:05:23,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:05:23,866 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:05:23,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-02 21:05:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:25,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 21:05:25,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:25,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:25,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:25,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:25,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:25,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:25,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:05:25,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2022-11-02 21:05:25,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:25,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 89 [2022-11-02 21:05:26,079 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:26,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 26 [2022-11-02 21:05:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-02 21:05:26,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:05:26,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:05:26,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654825520] [2022-11-02 21:05:26,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654825520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:26,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:26,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:05:26,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606277174] [2022-11-02 21:05:26,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:26,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:05:26,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:05:26,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:05:26,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:05:26,111 INFO L87 Difference]: Start difference. First operand 491 states and 731 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 21:05:28,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:05:29,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:05:34,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:05:37,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:37,939 INFO L93 Difference]: Finished difference Result 1122 states and 1671 transitions. [2022-11-02 21:05:37,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:05:37,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 128 [2022-11-02 21:05:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:37,951 INFO L225 Difference]: With dead ends: 1122 [2022-11-02 21:05:37,952 INFO L226 Difference]: Without dead ends: 641 [2022-11-02 21:05:37,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:05:37,953 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 39 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:37,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 566 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 1 Unknown, 0 Unchecked, 11.7s Time] [2022-11-02 21:05:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-11-02 21:05:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 566. [2022-11-02 21:05:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.5221238938053097) internal successors, (860), 565 states have internal predecessors, (860), 0 states have call successors, (0), 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 21:05:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 860 transitions. [2022-11-02 21:05:38,009 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 860 transitions. Word has length 128 [2022-11-02 21:05:38,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:38,010 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 860 transitions. [2022-11-02 21:05:38,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 21:05:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 860 transitions. [2022-11-02 21:05:38,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-02 21:05:38,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:38,012 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:38,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:38,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:05:38,239 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:38,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash -545938624, now seen corresponding path program 1 times [2022-11-02 21:05:38,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:05:38,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632503325] [2022-11-02 21:05:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:38,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:05:38,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:05:38,243 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:05:38,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-02 21:05:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:05:44,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:05:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:05:47,054 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-02 21:05:47,054 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:05:47,055 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 21:05:47,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:47,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:05:47,285 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:47,289 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:05:47,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:05:47 BoogieIcfgContainer [2022-11-02 21:05:47,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:05:47,534 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:05:47,534 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:05:47,534 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:05:47,535 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:01" (3/4) ... [2022-11-02 21:05:47,537 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-02 21:05:47,662 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:05:47,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:05:47,663 INFO L158 Benchmark]: Toolchain (without parser) took 57117.15ms. Allocated memory was 65.0MB in the beginning and 100.7MB in the end (delta: 35.7MB). Free memory was 42.4MB in the beginning and 35.1MB in the end (delta: 7.3MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2022-11-02 21:05:47,663 INFO L158 Benchmark]: CDTParser took 4.64ms. Allocated memory is still 65.0MB. Free memory was 45.3MB in the beginning and 45.2MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:05:47,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1182.71ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 42.2MB in the beginning and 45.3MB in the end (delta: -3.1MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2022-11-02 21:05:47,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.82ms. Allocated memory is still 79.7MB. Free memory was 45.3MB in the beginning and 40.4MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 21:05:47,664 INFO L158 Benchmark]: Boogie Preprocessor took 127.06ms. Allocated memory is still 79.7MB. Free memory was 40.4MB in the beginning and 55.3MB in the end (delta: -14.9MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2022-11-02 21:05:47,665 INFO L158 Benchmark]: RCFGBuilder took 9889.44ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 55.3MB in the beginning and 55.0MB in the end (delta: 345.3kB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2022-11-02 21:05:47,665 INFO L158 Benchmark]: TraceAbstraction took 45650.43ms. Allocated memory is still 100.7MB. Free memory was 54.2MB in the beginning and 52.7MB in the end (delta: 1.5MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2022-11-02 21:05:47,666 INFO L158 Benchmark]: Witness Printer took 128.43ms. Allocated memory is still 100.7MB. Free memory was 52.7MB in the beginning and 35.1MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-02 21:05:47,671 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.64ms. Allocated memory is still 65.0MB. Free memory was 45.3MB in the beginning and 45.2MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1182.71ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 42.2MB in the beginning and 45.3MB in the end (delta: -3.1MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 132.82ms. Allocated memory is still 79.7MB. Free memory was 45.3MB in the beginning and 40.4MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.06ms. Allocated memory is still 79.7MB. Free memory was 40.4MB in the beginning and 55.3MB in the end (delta: -14.9MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * RCFGBuilder took 9889.44ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 55.3MB in the beginning and 55.0MB in the end (delta: 345.3kB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 45650.43ms. Allocated memory is still 100.7MB. Free memory was 54.2MB in the beginning and 52.7MB in the end (delta: 1.5MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Witness Printer took 128.43ms. Allocated memory is still 100.7MB. Free memory was 52.7MB in the beginning and 35.1MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 1737]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={-1610612725:0}, s={-1610612725:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1160] EXPR s->cert VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={-1610612725:0}, s={-1610612725:0}, s->cert={536870922:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={-1610612725:0}, s={-1610612725:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={-1610612725:0}, s={-1610612725:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={-1610612725:0}, s={-1610612725:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={-1610612725:0}, s={-1610612725:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={-1610612725:0}, s={-1610612725:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={-1610612725:0}, s={-1610612725:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={-1610612725:0}, s={-1610612725:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={-1610612725:0}, s={-1610612725:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={-1610612725:0}, s={-1610612725:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=0, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->s3={536870923:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->hit=-2147483648, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1383] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->s3={536870923:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___9=2147483648] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->s3={536870923:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={-1610612725:0}, s={-1610612725:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1618] COND TRUE blastFlag == 5 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1737] reach_error() VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={-1610612725:0}, s={-1610612725:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.3s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 645 SdHoareTripleChecker+Valid, 25.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 645 mSDsluCounter, 3347 SdHoareTripleChecker+Invalid, 25.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1558 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 1789 mSDtfsCounter, 419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=566occurred in iteration=6, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 75 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 9.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 574 ConstructedInterpolants, 0 QuantifiedInterpolants, 1778 SizeOfPredicates, 11 NumberOfNonLiveVariables, 4568 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 359/359 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 RESULT: Ultimate proved your program to be incorrect! [2022-11-02 21:05:47,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3e808c8-97a3-424b-b297-b5653d61af2a/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE