./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_clnt.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_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/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_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/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_f778adea-7990-4af6-9597-22bce7dd6b59/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 781939b227b3ba0a20ad2d0323c2d13ae338349fb5c0bf292cccf74fd05cfb42 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:53:05,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:53:05,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:53:05,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:53:05,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:53:05,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:53:05,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:53:05,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:53:05,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:53:05,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:53:05,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:53:05,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:53:05,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:53:05,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:53:05,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:53:05,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:53:05,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:53:05,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:53:05,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:53:05,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:53:05,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:53:05,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:53:05,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:53:05,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:53:05,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:53:05,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:53:05,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:53:05,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:53:05,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:53:05,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:53:05,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:53:05,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:53:05,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:53:05,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:53:05,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:53:05,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:53:05,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:53:05,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:53:05,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:53:05,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:53:05,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:53:05,207 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:53:05,256 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:53:05,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:53:05,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:53:05,258 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:53:05,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:53:05,260 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:53:05,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:53:05,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:53:05,262 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:53:05,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:53:05,263 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:53:05,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:53:05,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:53:05,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:53:05,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:53:05,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:53:05,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:53:05,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:53:05,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:53:05,266 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:53:05,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:53:05,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:53:05,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:53:05,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:53:05,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:05,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:53:05,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:53:05,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:53:05,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:53:05,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:53:05,269 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:53:05,270 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:53:05,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:53:05,271 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_f778adea-7990-4af6-9597-22bce7dd6b59/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_f778adea-7990-4af6-9597-22bce7dd6b59/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 -> 781939b227b3ba0a20ad2d0323c2d13ae338349fb5c0bf292cccf74fd05cfb42 [2022-11-02 20:53:05,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:53:05,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:53:05,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:53:05,680 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:53:05,681 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:53:05,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2022-11-02 20:53:05,769 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/data/5b9ff9ec2/3d2b8a18855d40e5b59614fd0024007b/FLAG44d9a49b2 [2022-11-02 20:53:06,585 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:53:06,586 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2022-11-02 20:53:06,608 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/data/5b9ff9ec2/3d2b8a18855d40e5b59614fd0024007b/FLAG44d9a49b2 [2022-11-02 20:53:06,738 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/data/5b9ff9ec2/3d2b8a18855d40e5b59614fd0024007b [2022-11-02 20:53:06,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:53:06,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:53:06,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:06,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:53:06,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:53:06,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:06" (1/1) ... [2022-11-02 20:53:06,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab62705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06, skipping insertion in model container [2022-11-02 20:53:06,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:06" (1/1) ... [2022-11-02 20:53:06,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:53:06,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:53:07,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c[65520,65533] [2022-11-02 20:53:07,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:07,592 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:53:07,740 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_f778adea-7990-4af6-9597-22bce7dd6b59/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c[65520,65533] [2022-11-02 20:53:07,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:07,768 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:53:07,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:07 WrapperNode [2022-11-02 20:53:07,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:07,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:07,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:53:07,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:53:07,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:07" (1/1) ... [2022-11-02 20:53:07,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:07" (1/1) ... [2022-11-02 20:53:07,914 INFO L138 Inliner]: procedures = 31, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 724 [2022-11-02 20:53:07,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:07,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:53:07,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:53:07,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:53:07,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:07" (1/1) ... [2022-11-02 20:53:07,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:07" (1/1) ... [2022-11-02 20:53:07,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:07" (1/1) ... [2022-11-02 20:53:07,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:07" (1/1) ... [2022-11-02 20:53:08,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:07" (1/1) ... [2022-11-02 20:53:08,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:07" (1/1) ... [2022-11-02 20:53:08,048 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:07" (1/1) ... [2022-11-02 20:53:08,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:07" (1/1) ... [2022-11-02 20:53:08,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:53:08,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:53:08,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:53:08,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:53:08,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:07" (1/1) ... [2022-11-02 20:53:08,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:08,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:08,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:53:08,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:53:08,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:53:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:53:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:53:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:53:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:53:08,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:53:08,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:53:08,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:53:08,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:53:08,385 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:53:08,388 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:53:08,441 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:53:11,767 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-11-02 20:53:11,771 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-11-02 20:53:11,771 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:53:11,781 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:53:11,784 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:53:11,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:11 BoogieIcfgContainer [2022-11-02 20:53:11,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:53:11,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:53:11,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:53:11,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:53:11,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:53:06" (1/3) ... [2022-11-02 20:53:11,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5642de0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:11, skipping insertion in model container [2022-11-02 20:53:11,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:07" (2/3) ... [2022-11-02 20:53:11,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5642de0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:11, skipping insertion in model container [2022-11-02 20:53:11,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:11" (3/3) ... [2022-11-02 20:53:11,801 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2022-11-02 20:53:11,824 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:53:11,824 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:53:11,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:53:11,907 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;@28469f36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:53:11,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:53:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:11,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:53:11,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:11,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:11,927 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-11-02 20:53:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:11,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791021124] [2022-11-02 20:53:11,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:13,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:13,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791021124] [2022-11-02 20:53:13,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791021124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:13,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:13,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575361064] [2022-11-02 20:53:13,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:13,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:13,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:53:13,855 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 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 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:15,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:16,666 INFO L93 Difference]: Finished difference Result 365 states and 610 transitions. [2022-11-02 20:53:16,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:16,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:53:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:16,684 INFO L225 Difference]: With dead ends: 365 [2022-11-02 20:53:16,684 INFO L226 Difference]: Without dead ends: 208 [2022-11-02 20:53:16,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:16,692 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 143 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:16,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 381 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 235 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-11-02 20:53:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-11-02 20:53:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 138. [2022-11-02 20:53:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.5547445255474452) internal successors, (213), 137 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 213 transitions. [2022-11-02 20:53:16,752 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 213 transitions. Word has length 24 [2022-11-02 20:53:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:16,752 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 213 transitions. [2022-11-02 20:53:16,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 213 transitions. [2022-11-02 20:53:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:53:16,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:16,755 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] [2022-11-02 20:53:16,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:53:16,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:16,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:16,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2051399350, now seen corresponding path program 1 times [2022-11-02 20:53:16,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:16,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055654727] [2022-11-02 20:53:16,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:16,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:17,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:17,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055654727] [2022-11-02 20:53:17,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055654727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:17,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:17,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:17,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675151607] [2022-11-02 20:53:17,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:17,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:17,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:17,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:17,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:53:17,662 INFO L87 Difference]: Start difference. First operand 138 states and 213 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:19,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:20,270 INFO L93 Difference]: Finished difference Result 363 states and 558 transitions. [2022-11-02 20:53:20,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:20,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-02 20:53:20,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:20,275 INFO L225 Difference]: With dead ends: 363 [2022-11-02 20:53:20,275 INFO L226 Difference]: Without dead ends: 232 [2022-11-02 20:53:20,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:20,278 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 109 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:20,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 20:53:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-02 20:53:20,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 163. [2022-11-02 20:53:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5864197530864197) internal successors, (257), 162 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 257 transitions. [2022-11-02 20:53:20,324 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 257 transitions. Word has length 25 [2022-11-02 20:53:20,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:20,325 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 257 transitions. [2022-11-02 20:53:20,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 257 transitions. [2022-11-02 20:53:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:53:20,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:20,329 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] [2022-11-02 20:53:20,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:53:20,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:20,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:20,335 INFO L85 PathProgramCache]: Analyzing trace with hash -835386660, now seen corresponding path program 1 times [2022-11-02 20:53:20,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:20,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429901489] [2022-11-02 20:53:20,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:20,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:21,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:21,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429901489] [2022-11-02 20:53:21,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429901489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:21,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:21,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:21,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935419857] [2022-11-02 20:53:21,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:21,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:21,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:21,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:21,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:53:21,080 INFO L87 Difference]: Start difference. First operand 163 states and 257 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:23,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:23,410 INFO L93 Difference]: Finished difference Result 323 states and 508 transitions. [2022-11-02 20:53:23,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:23,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-02 20:53:23,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:23,413 INFO L225 Difference]: With dead ends: 323 [2022-11-02 20:53:23,413 INFO L226 Difference]: Without dead ends: 167 [2022-11-02 20:53:23,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:23,416 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 7 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:23,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 409 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:53:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-02 20:53:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2022-11-02 20:53:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.5757575757575757) internal successors, (260), 165 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 260 transitions. [2022-11-02 20:53:23,431 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 260 transitions. Word has length 26 [2022-11-02 20:53:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:23,431 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 260 transitions. [2022-11-02 20:53:23,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 260 transitions. [2022-11-02 20:53:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:53:23,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:23,434 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] [2022-11-02 20:53:23,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:53:23,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:23,435 INFO L85 PathProgramCache]: Analyzing trace with hash -747175225, now seen corresponding path program 1 times [2022-11-02 20:53:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:23,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011976482] [2022-11-02 20:53:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:23,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:53:23,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:23,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011976482] [2022-11-02 20:53:23,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011976482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:23,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:23,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:53:23,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741661346] [2022-11-02 20:53:23,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:23,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:23,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:23,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:23,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:23,847 INFO L87 Difference]: Start difference. First operand 166 states and 260 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:23,889 INFO L93 Difference]: Finished difference Result 474 states and 748 transitions. [2022-11-02 20:53:23,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:23,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 41 [2022-11-02 20:53:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:23,892 INFO L225 Difference]: With dead ends: 474 [2022-11-02 20:53:23,893 INFO L226 Difference]: Without dead ends: 318 [2022-11-02 20:53:23,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:23,895 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 123 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:23,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 314 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:53:23,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-11-02 20:53:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-11-02 20:53:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.5646687697160884) internal successors, (496), 317 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 496 transitions. [2022-11-02 20:53:23,917 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 496 transitions. Word has length 41 [2022-11-02 20:53:23,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:23,918 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 496 transitions. [2022-11-02 20:53:23,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:23,919 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 496 transitions. [2022-11-02 20:53:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-02 20:53:23,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:23,921 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:23,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:53:23,922 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:23,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1722196731, now seen corresponding path program 1 times [2022-11-02 20:53:23,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:23,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745904329] [2022-11-02 20:53:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:23,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:53:24,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:24,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745904329] [2022-11-02 20:53:24,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745904329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:24,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:24,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:53:24,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889907666] [2022-11-02 20:53:24,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:24,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:24,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:24,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:24,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:24,322 INFO L87 Difference]: Start difference. First operand 318 states and 496 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:26,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:26,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:26,401 INFO L93 Difference]: Finished difference Result 625 states and 983 transitions. [2022-11-02 20:53:26,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:26,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 56 [2022-11-02 20:53:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:26,412 INFO L225 Difference]: With dead ends: 625 [2022-11-02 20:53:26,413 INFO L226 Difference]: Without dead ends: 469 [2022-11-02 20:53:26,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:26,420 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 124 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:26,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 467 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:53:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-11-02 20:53:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2022-11-02 20:53:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.561965811965812) internal successors, (731), 468 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 731 transitions. [2022-11-02 20:53:26,474 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 731 transitions. Word has length 56 [2022-11-02 20:53:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:26,481 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 731 transitions. [2022-11-02 20:53:26,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 731 transitions. [2022-11-02 20:53:26,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 20:53:26,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:26,493 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:26,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:53:26,494 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:26,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:26,494 INFO L85 PathProgramCache]: Analyzing trace with hash 475156595, now seen corresponding path program 1 times [2022-11-02 20:53:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:26,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779181318] [2022-11-02 20:53:26,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:26,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:53:27,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:27,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779181318] [2022-11-02 20:53:27,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779181318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:27,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:27,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:27,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050748878] [2022-11-02 20:53:27,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:27,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:27,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:27,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:27,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:53:27,477 INFO L87 Difference]: Start difference. First operand 469 states and 731 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:29,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:31,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:32,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:32,085 INFO L93 Difference]: Finished difference Result 1110 states and 1718 transitions. [2022-11-02 20:53:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:32,086 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 74 [2022-11-02 20:53:32,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:32,090 INFO L225 Difference]: With dead ends: 1110 [2022-11-02 20:53:32,090 INFO L226 Difference]: Without dead ends: 651 [2022-11-02 20:53:32,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:32,092 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 91 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:32,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 560 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2022-11-02 20:53:32,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-11-02 20:53:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 523. [2022-11-02 20:53:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.5727969348659003) internal successors, (821), 522 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 821 transitions. [2022-11-02 20:53:32,119 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 821 transitions. Word has length 74 [2022-11-02 20:53:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:32,119 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 821 transitions. [2022-11-02 20:53:32,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 821 transitions. [2022-11-02 20:53:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 20:53:32,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:32,123 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:32,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:53:32,123 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:32,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:32,124 INFO L85 PathProgramCache]: Analyzing trace with hash 537196209, now seen corresponding path program 1 times [2022-11-02 20:53:32,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:32,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505718880] [2022-11-02 20:53:32,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:32,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:53:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:33,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505718880] [2022-11-02 20:53:33,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505718880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:33,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:33,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067766942] [2022-11-02 20:53:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:33,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:33,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:33,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:33,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:53:33,010 INFO L87 Difference]: Start difference. First operand 523 states and 821 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:35,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:37,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:37,469 INFO L93 Difference]: Finished difference Result 1120 states and 1753 transitions. [2022-11-02 20:53:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:37,471 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 74 [2022-11-02 20:53:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:37,478 INFO L225 Difference]: With dead ends: 1120 [2022-11-02 20:53:37,478 INFO L226 Difference]: Without dead ends: 607 [2022-11-02 20:53:37,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:37,481 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 38 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:37,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 496 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-11-02 20:53:37,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2022-11-02 20:53:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 563. [2022-11-02 20:53:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 1.5818505338078293) internal successors, (889), 562 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 889 transitions. [2022-11-02 20:53:37,510 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 889 transitions. Word has length 74 [2022-11-02 20:53:37,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:37,512 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 889 transitions. [2022-11-02 20:53:37,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:37,512 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 889 transitions. [2022-11-02 20:53:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-02 20:53:37,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:37,515 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:37,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:53:37,516 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:37,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:37,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1840475418, now seen corresponding path program 1 times [2022-11-02 20:53:37,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:37,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719893749] [2022-11-02 20:53:37,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:37,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:53:38,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:38,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719893749] [2022-11-02 20:53:38,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719893749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:38,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:38,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:38,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46139083] [2022-11-02 20:53:38,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:38,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:38,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:38,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:38,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:53:38,349 INFO L87 Difference]: Start difference. First operand 563 states and 889 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 20:53:40,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:40,924 INFO L93 Difference]: Finished difference Result 1316 states and 2040 transitions. [2022-11-02 20:53:40,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:40,925 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 75 [2022-11-02 20:53:40,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:40,929 INFO L225 Difference]: With dead ends: 1316 [2022-11-02 20:53:40,929 INFO L226 Difference]: Without dead ends: 763 [2022-11-02 20:53:40,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:40,935 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 105 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:40,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:53:40,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2022-11-02 20:53:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 569. [2022-11-02 20:53:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.5809859154929577) internal successors, (898), 568 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 898 transitions. [2022-11-02 20:53:40,964 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 898 transitions. Word has length 75 [2022-11-02 20:53:40,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:40,965 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 898 transitions. [2022-11-02 20:53:40,965 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 20:53:40,966 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 898 transitions. [2022-11-02 20:53:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-02 20:53:40,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:40,969 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:40,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:53:40,969 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:40,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash -729811888, now seen corresponding path program 2 times [2022-11-02 20:53:40,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:40,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959811549] [2022-11-02 20:53:40,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:40,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:53:41,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:41,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959811549] [2022-11-02 20:53:41,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959811549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:41,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:41,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:41,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367453850] [2022-11-02 20:53:41,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:41,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:41,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:41,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:41,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:53:41,866 INFO L87 Difference]: Start difference. First operand 569 states and 898 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:43,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:45,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:46,429 INFO L93 Difference]: Finished difference Result 1319 states and 2043 transitions. [2022-11-02 20:53:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:46,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 89 [2022-11-02 20:53:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:46,434 INFO L225 Difference]: With dead ends: 1319 [2022-11-02 20:53:46,434 INFO L226 Difference]: Without dead ends: 760 [2022-11-02 20:53:46,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:46,436 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 112 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:46,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 288 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 20:53:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-11-02 20:53:46,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 569. [2022-11-02 20:53:46,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.5633802816901408) internal successors, (888), 568 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 888 transitions. [2022-11-02 20:53:46,467 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 888 transitions. Word has length 89 [2022-11-02 20:53:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:46,468 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 888 transitions. [2022-11-02 20:53:46,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 888 transitions. [2022-11-02 20:53:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-02 20:53:46,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:46,470 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2022-11-02 20:53:46,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:53:46,471 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:46,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:46,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1477837842, now seen corresponding path program 1 times [2022-11-02 20:53:46,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:46,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595271706] [2022-11-02 20:53:46,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:46,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:53:47,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:47,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595271706] [2022-11-02 20:53:47,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595271706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:47,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:47,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:47,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292272688] [2022-11-02 20:53:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:47,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:47,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:47,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:47,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:53:47,377 INFO L87 Difference]: Start difference. First operand 569 states and 888 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:49,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:49,947 INFO L93 Difference]: Finished difference Result 1320 states and 2024 transitions. [2022-11-02 20:53:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:49,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 89 [2022-11-02 20:53:49,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:49,952 INFO L225 Difference]: With dead ends: 1320 [2022-11-02 20:53:49,952 INFO L226 Difference]: Without dead ends: 761 [2022-11-02 20:53:49,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:49,956 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 119 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:49,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:53:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-11-02 20:53:49,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 569. [2022-11-02 20:53:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.545774647887324) internal successors, (878), 568 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 878 transitions. [2022-11-02 20:53:49,998 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 878 transitions. Word has length 89 [2022-11-02 20:53:49,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:49,999 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 878 transitions. [2022-11-02 20:53:49,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 878 transitions. [2022-11-02 20:53:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-02 20:53:50,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:50,001 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:50,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:53:50,002 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:50,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:50,003 INFO L85 PathProgramCache]: Analyzing trace with hash -859117231, now seen corresponding path program 1 times [2022-11-02 20:53:50,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:50,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423264963] [2022-11-02 20:53:50,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:50,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:53:50,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:50,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423264963] [2022-11-02 20:53:50,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423264963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:50,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:50,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206391520] [2022-11-02 20:53:50,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:50,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:50,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:50,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:50,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:53:50,787 INFO L87 Difference]: Start difference. First operand 569 states and 878 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:52,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:54,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:55,390 INFO L93 Difference]: Finished difference Result 1045 states and 1596 transitions. [2022-11-02 20:53:55,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:55,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 89 [2022-11-02 20:53:55,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:55,395 INFO L225 Difference]: With dead ends: 1045 [2022-11-02 20:53:55,395 INFO L226 Difference]: Without dead ends: 685 [2022-11-02 20:53:55,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:55,397 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 92 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:55,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 544 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 20:53:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-11-02 20:53:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 569. [2022-11-02 20:53:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.5422535211267605) internal successors, (876), 568 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 876 transitions. [2022-11-02 20:53:55,431 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 876 transitions. Word has length 89 [2022-11-02 20:53:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:55,432 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 876 transitions. [2022-11-02 20:53:55,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 876 transitions. [2022-11-02 20:53:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-02 20:53:55,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:55,434 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:55,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:53:55,435 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:55,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:55,436 INFO L85 PathProgramCache]: Analyzing trace with hash -435470509, now seen corresponding path program 1 times [2022-11-02 20:53:55,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:55,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765292806] [2022-11-02 20:53:55,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:55,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:53:56,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:56,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765292806] [2022-11-02 20:53:56,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765292806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:56,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:56,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:56,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619236545] [2022-11-02 20:53:56,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:56,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:56,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:56,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:56,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:53:56,266 INFO L87 Difference]: Start difference. First operand 569 states and 876 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:58,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:58,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:58,828 INFO L93 Difference]: Finished difference Result 1202 states and 1825 transitions. [2022-11-02 20:53:58,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:58,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 89 [2022-11-02 20:53:58,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:58,834 INFO L225 Difference]: With dead ends: 1202 [2022-11-02 20:53:58,834 INFO L226 Difference]: Without dead ends: 842 [2022-11-02 20:53:58,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:53:58,836 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 114 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:58,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 498 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:53:58,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-11-02 20:53:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 617. [2022-11-02 20:53:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.530844155844156) internal successors, (943), 616 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 943 transitions. [2022-11-02 20:53:58,871 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 943 transitions. Word has length 89 [2022-11-02 20:53:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:58,872 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 943 transitions. [2022-11-02 20:53:58,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 943 transitions. [2022-11-02 20:53:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-02 20:53:58,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:58,875 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2022-11-02 20:53:58,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:53:58,875 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:58,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1165506567, now seen corresponding path program 1 times [2022-11-02 20:53:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:58,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454507562] [2022-11-02 20:53:58,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:58,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:53:59,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:59,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454507562] [2022-11-02 20:53:59,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454507562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:59,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:59,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:59,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48404023] [2022-11-02 20:53:59,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:59,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:59,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:59,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:59,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:53:59,748 INFO L87 Difference]: Start difference. First operand 617 states and 943 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:01,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:02,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:02,315 INFO L93 Difference]: Finished difference Result 1416 states and 2134 transitions. [2022-11-02 20:54:02,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:54:02,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-11-02 20:54:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:02,320 INFO L225 Difference]: With dead ends: 1416 [2022-11-02 20:54:02,320 INFO L226 Difference]: Without dead ends: 809 [2022-11-02 20:54:02,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:02,322 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 117 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:02,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 292 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:54:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-11-02 20:54:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 617. [2022-11-02 20:54:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.5097402597402598) internal successors, (930), 616 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 930 transitions. [2022-11-02 20:54:02,362 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 930 transitions. Word has length 90 [2022-11-02 20:54:02,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:02,363 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 930 transitions. [2022-11-02 20:54:02,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:02,363 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 930 transitions. [2022-11-02 20:54:02,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-02 20:54:02,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:02,365 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:02,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:54:02,366 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1304764074, now seen corresponding path program 1 times [2022-11-02 20:54:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:02,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282186547] [2022-11-02 20:54:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:02,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:54:03,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:03,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282186547] [2022-11-02 20:54:03,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282186547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:03,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:03,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:03,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248367364] [2022-11-02 20:54:03,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:03,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:03,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:03,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:03,181 INFO L87 Difference]: Start difference. First operand 617 states and 930 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:05,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:05,775 INFO L93 Difference]: Finished difference Result 1226 states and 1832 transitions. [2022-11-02 20:54:05,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:54:05,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-11-02 20:54:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:05,780 INFO L225 Difference]: With dead ends: 1226 [2022-11-02 20:54:05,781 INFO L226 Difference]: Without dead ends: 834 [2022-11-02 20:54:05,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:05,782 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 109 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:05,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 492 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:54:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-11-02 20:54:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 620. [2022-11-02 20:54:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.495961227786753) internal successors, (926), 619 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 926 transitions. [2022-11-02 20:54:05,819 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 926 transitions. Word has length 90 [2022-11-02 20:54:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:05,819 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 926 transitions. [2022-11-02 20:54:05,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 926 transitions. [2022-11-02 20:54:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:54:05,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:05,822 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:54:05,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:54:05,823 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:05,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:05,824 INFO L85 PathProgramCache]: Analyzing trace with hash -823645421, now seen corresponding path program 1 times [2022-11-02 20:54:05,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:05,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794991397] [2022-11-02 20:54:05,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:05,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:54:06,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:06,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794991397] [2022-11-02 20:54:06,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794991397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:06,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:06,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:06,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411089184] [2022-11-02 20:54:06,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:06,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:06,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:06,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:06,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:06,666 INFO L87 Difference]: Start difference. First operand 620 states and 926 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:08,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:09,239 INFO L93 Difference]: Finished difference Result 1422 states and 2100 transitions. [2022-11-02 20:54:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:54:09,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-11-02 20:54:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:09,244 INFO L225 Difference]: With dead ends: 1422 [2022-11-02 20:54:09,244 INFO L226 Difference]: Without dead ends: 812 [2022-11-02 20:54:09,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:09,249 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 115 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:09,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 270 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:54:09,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-02 20:54:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 620. [2022-11-02 20:54:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4749596122778674) internal successors, (913), 619 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 913 transitions. [2022-11-02 20:54:09,285 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 913 transitions. Word has length 91 [2022-11-02 20:54:09,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:09,285 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 913 transitions. [2022-11-02 20:54:09,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:09,286 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 913 transitions. [2022-11-02 20:54:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-02 20:54:09,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:09,288 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 20:54:09,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:54:09,289 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:09,289 INFO L85 PathProgramCache]: Analyzing trace with hash -391297652, now seen corresponding path program 1 times [2022-11-02 20:54:09,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:09,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364014271] [2022-11-02 20:54:09,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:09,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:54:10,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:10,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364014271] [2022-11-02 20:54:10,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364014271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:10,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:10,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:10,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519389251] [2022-11-02 20:54:10,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:10,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:10,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:10,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:10,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:10,123 INFO L87 Difference]: Start difference. First operand 620 states and 913 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:12,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:12,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:12,714 INFO L93 Difference]: Finished difference Result 1422 states and 2074 transitions. [2022-11-02 20:54:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:54:12,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-11-02 20:54:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:12,719 INFO L225 Difference]: With dead ends: 1422 [2022-11-02 20:54:12,719 INFO L226 Difference]: Without dead ends: 812 [2022-11-02 20:54:12,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:12,721 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 113 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:12,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 272 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:54:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-02 20:54:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 620. [2022-11-02 20:54:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4539579967689822) internal successors, (900), 619 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 900 transitions. [2022-11-02 20:54:12,758 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 900 transitions. Word has length 92 [2022-11-02 20:54:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:12,759 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 900 transitions. [2022-11-02 20:54:12,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 900 transitions. [2022-11-02 20:54:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-02 20:54:12,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:12,761 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:12,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:54:12,762 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:12,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:12,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1939969181, now seen corresponding path program 1 times [2022-11-02 20:54:12,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:12,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273768477] [2022-11-02 20:54:12,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:12,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:54:13,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:13,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273768477] [2022-11-02 20:54:13,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273768477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:13,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:13,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:13,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323913009] [2022-11-02 20:54:13,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:13,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:13,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:13,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:13,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:13,569 INFO L87 Difference]: Start difference. First operand 620 states and 900 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:15,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:16,124 INFO L93 Difference]: Finished difference Result 1422 states and 2048 transitions. [2022-11-02 20:54:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:54:16,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-11-02 20:54:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:16,129 INFO L225 Difference]: With dead ends: 1422 [2022-11-02 20:54:16,129 INFO L226 Difference]: Without dead ends: 812 [2022-11-02 20:54:16,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:16,131 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 107 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:16,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 274 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:54:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-02 20:54:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 620. [2022-11-02 20:54:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4410339256865912) internal successors, (892), 619 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 892 transitions. [2022-11-02 20:54:16,168 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 892 transitions. Word has length 92 [2022-11-02 20:54:16,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:16,169 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 892 transitions. [2022-11-02 20:54:16,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 892 transitions. [2022-11-02 20:54:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-02 20:54:16,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:16,171 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:16,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:54:16,172 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:16,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash -109418661, now seen corresponding path program 1 times [2022-11-02 20:54:16,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:16,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820020250] [2022-11-02 20:54:16,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-02 20:54:16,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:16,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820020250] [2022-11-02 20:54:16,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820020250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:16,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:16,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:16,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696640440] [2022-11-02 20:54:16,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:16,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:16,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:16,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:16,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:16,499 INFO L87 Difference]: Start difference. First operand 620 states and 892 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:18,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:18,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:18,597 INFO L93 Difference]: Finished difference Result 1231 states and 1778 transitions. [2022-11-02 20:54:18,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:18,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 92 [2022-11-02 20:54:18,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:18,601 INFO L225 Difference]: With dead ends: 1231 [2022-11-02 20:54:18,602 INFO L226 Difference]: Without dead ends: 839 [2022-11-02 20:54:18,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:18,604 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 122 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:18,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:54:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-11-02 20:54:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2022-11-02 20:54:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 1.437947494033413) internal successors, (1205), 838 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1205 transitions. [2022-11-02 20:54:18,651 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1205 transitions. Word has length 92 [2022-11-02 20:54:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:18,651 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 1205 transitions. [2022-11-02 20:54:18,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1205 transitions. [2022-11-02 20:54:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 20:54:18,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:18,654 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:18,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:54:18,655 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:18,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:18,655 INFO L85 PathProgramCache]: Analyzing trace with hash 883897329, now seen corresponding path program 1 times [2022-11-02 20:54:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:18,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755327529] [2022-11-02 20:54:18,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:18,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:54:18,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:18,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755327529] [2022-11-02 20:54:18,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755327529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:18,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:18,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:18,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568424413] [2022-11-02 20:54:18,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:18,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:18,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:18,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:18,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:18,988 INFO L87 Difference]: Start difference. First operand 839 states and 1205 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:21,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:21,133 INFO L93 Difference]: Finished difference Result 1644 states and 2368 transitions. [2022-11-02 20:54:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:21,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-11-02 20:54:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:21,139 INFO L225 Difference]: With dead ends: 1644 [2022-11-02 20:54:21,139 INFO L226 Difference]: Without dead ends: 1033 [2022-11-02 20:54:21,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:21,141 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 126 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:21,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:54:21,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2022-11-02 20:54:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2022-11-02 20:54:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1032 states have (on average 1.436046511627907) internal successors, (1482), 1032 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1482 transitions. [2022-11-02 20:54:21,197 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1482 transitions. Word has length 94 [2022-11-02 20:54:21,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:21,198 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1482 transitions. [2022-11-02 20:54:21,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1482 transitions. [2022-11-02 20:54:21,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 20:54:21,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:21,202 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:21,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:54:21,203 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:21,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash -782701753, now seen corresponding path program 1 times [2022-11-02 20:54:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:21,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964776618] [2022-11-02 20:54:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-02 20:54:21,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:21,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964776618] [2022-11-02 20:54:21,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964776618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:21,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:21,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:21,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962726740] [2022-11-02 20:54:21,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:21,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:21,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:21,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:21,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:21,543 INFO L87 Difference]: Start difference. First operand 1033 states and 1482 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:23,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:23,648 INFO L93 Difference]: Finished difference Result 1835 states and 2635 transitions. [2022-11-02 20:54:23,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:23,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-11-02 20:54:23,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:23,654 INFO L225 Difference]: With dead ends: 1835 [2022-11-02 20:54:23,654 INFO L226 Difference]: Without dead ends: 1030 [2022-11-02 20:54:23,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:23,657 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 128 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:23,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 469 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:54:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2022-11-02 20:54:23,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2022-11-02 20:54:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4305150631681245) internal successors, (1472), 1029 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1472 transitions. [2022-11-02 20:54:23,710 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1472 transitions. Word has length 113 [2022-11-02 20:54:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:23,710 INFO L495 AbstractCegarLoop]: Abstraction has 1030 states and 1472 transitions. [2022-11-02 20:54:23,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1472 transitions. [2022-11-02 20:54:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-02 20:54:23,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:23,714 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:23,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:54:23,715 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash -698320702, now seen corresponding path program 1 times [2022-11-02 20:54:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:23,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385000425] [2022-11-02 20:54:23,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:23,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-02 20:54:24,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:24,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385000425] [2022-11-02 20:54:24,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385000425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:24,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:24,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:54:24,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296324864] [2022-11-02 20:54:24,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:24,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:54:24,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:24,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:54:24,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:54:24,411 INFO L87 Difference]: Start difference. First operand 1030 states and 1472 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:26,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:26,979 INFO L93 Difference]: Finished difference Result 2478 states and 3517 transitions. [2022-11-02 20:54:26,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:54:26,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 115 [2022-11-02 20:54:26,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:26,986 INFO L225 Difference]: With dead ends: 2478 [2022-11-02 20:54:26,986 INFO L226 Difference]: Without dead ends: 1458 [2022-11-02 20:54:26,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:26,989 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 94 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:26,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 275 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 204 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:54:26,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2022-11-02 20:54:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1056. [2022-11-02 20:54:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1055 states have (on average 1.4293838862559243) internal successors, (1508), 1055 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1508 transitions. [2022-11-02 20:54:27,083 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1508 transitions. Word has length 115 [2022-11-02 20:54:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:27,083 INFO L495 AbstractCegarLoop]: Abstraction has 1056 states and 1508 transitions. [2022-11-02 20:54:27,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1508 transitions. [2022-11-02 20:54:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-02 20:54:27,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:27,088 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:27,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:54:27,088 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:27,089 INFO L85 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2022-11-02 20:54:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:27,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204525611] [2022-11-02 20:54:27,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:54:29,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:54:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:54:29,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:54:29,570 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:54:29,573 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:54:29,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:54:29,580 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:29,585 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:54:29,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:54:29 BoogieIcfgContainer [2022-11-02 20:54:29,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:54:29,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:54:29,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:54:29,777 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:54:29,777 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:11" (3/4) ... [2022-11-02 20:54:29,781 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:54:29,781 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:54:29,782 INFO L158 Benchmark]: Toolchain (without parser) took 83039.23ms. Allocated memory was 102.8MB in the beginning and 432.0MB in the end (delta: 329.3MB). Free memory was 70.0MB in the beginning and 147.5MB in the end (delta: -77.5MB). Peak memory consumption was 252.4MB. Max. memory is 16.1GB. [2022-11-02 20:54:29,782 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 102.8MB. Free memory was 58.8MB in the beginning and 58.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:54:29,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1014.39ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 69.7MB in the beginning and 86.1MB in the end (delta: -16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 20:54:29,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 144.87ms. Allocated memory is still 130.0MB. Free memory was 86.1MB in the beginning and 81.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:54:29,785 INFO L158 Benchmark]: Boogie Preprocessor took 140.26ms. Allocated memory is still 130.0MB. Free memory was 81.4MB in the beginning and 74.7MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:54:29,785 INFO L158 Benchmark]: RCFGBuilder took 3729.09ms. Allocated memory is still 130.0MB. Free memory was 74.7MB in the beginning and 86.9MB in the end (delta: -12.2MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2022-11-02 20:54:29,787 INFO L158 Benchmark]: TraceAbstraction took 77983.59ms. Allocated memory was 130.0MB in the beginning and 432.0MB in the end (delta: 302.0MB). Free memory was 85.9MB in the beginning and 147.5MB in the end (delta: -61.6MB). Peak memory consumption was 240.3MB. Max. memory is 16.1GB. [2022-11-02 20:54:29,787 INFO L158 Benchmark]: Witness Printer took 5.14ms. Allocated memory is still 432.0MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:54:29,789 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.39ms. Allocated memory is still 102.8MB. Free memory was 58.8MB in the beginning and 58.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1014.39ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 69.7MB in the beginning and 86.1MB in the end (delta: -16.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 144.87ms. Allocated memory is still 130.0MB. Free memory was 86.1MB in the beginning and 81.4MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 140.26ms. Allocated memory is still 130.0MB. Free memory was 81.4MB in the beginning and 74.7MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3729.09ms. Allocated memory is still 130.0MB. Free memory was 74.7MB in the beginning and 86.9MB in the end (delta: -12.2MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * TraceAbstraction took 77983.59ms. Allocated memory was 130.0MB in the beginning and 432.0MB in the end (delta: 302.0MB). Free memory was 85.9MB in the beginning and 147.5MB in the end (delta: -61.6MB). Peak memory consumption was 240.3MB. Max. memory is 16.1GB. * Witness Printer took 5.14ms. Allocated memory is still 432.0MB. Free memory is still 147.5MB. 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: 1668]: 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 1353. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={4:0}] [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) [L1104] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 ; [L1116] int tmp___4 ; [L1117] int tmp___5 ; [L1118] int tmp___6 ; [L1119] int tmp___7 ; [L1120] int tmp___8 ; [L1121] long tmp___9 ; [L1123] int blastFlag ; [L1126] blastFlag = 0 [L1127] s->hit=__VERIFIER_nondet_int () [L1128] s->state = 12292 [L1129] tmp = __VERIFIER_nondet_int() [L1130] cb = (void (*)())((void *)0) [L1131] ret = -1 [L1132] skip = 0 [L1133] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, s->info_callback={0:17}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0] [L1133] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1134] EXPR s->info_callback [L1134] cb = s->info_callback [L1142] EXPR s->in_handshake [L1142] s->in_handshake += 1 [L1143] COND FALSE !(tmp___1 & 12288) VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0] [L1153] COND TRUE 1 VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=0, tmp___2=0] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0] [L1156] COND TRUE s->state == 12292 [L1259] s->new_session = 1 [L1260] s->state = 4096 [L1261] EXPR s->ctx [L1261] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1261] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1266] s->server = 0 VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0] [L1267] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0] [L1272] EXPR s->version VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, s->version=-8, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0] [L1272] COND FALSE !((s->version & 65280) != 768) [L1278] s->type = 4096 [L1279] EXPR s->init_buf VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, s->init_buf={0:-5}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0] [L1279] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1291] tmp___4 = __VERIFIER_nondet_int() [L1292] COND FALSE !(! tmp___4) [L1298] tmp___5 = __VERIFIER_nondet_int() [L1299] COND FALSE !(! tmp___5) [L1305] s->state = 4368 [L1306] EXPR s->ctx [L1306] EXPR (s->ctx)->stats.sess_connect [L1306] (s->ctx)->stats.sess_connect += 1 [L1307] s->init_num = 0 VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:17}, (s->s3)->tmp.reuse_message=4294967304, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, s->s3={-17:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1153] COND TRUE 1 VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:17}, blastFlag=0, buf={0:18}, init=1, ret=-1, s={-15:0}, s={-15:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1171] COND TRUE s->state == 4368 [L1311] s->shutdown = 0 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 0 [L1314] blastFlag = 1 VAL [={0:17}, blastFlag=1, buf={0:18}, init=1, ret=11, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1318] COND FALSE !(ret <= 0) [L1323] s->state = 4384 [L1324] s->init_num = 0 [L1325] EXPR s->bbio [L1325] EXPR s->wbio VAL [={0:17}, blastFlag=1, buf={0:18}, init=1, ret=11, s={-15:0}, s={-15:0}, s->bbio={0:-12}, s->wbio={0:15}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1325] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:17}, (s->s3)->tmp.reuse_message=4294967304, blastFlag=1, buf={0:18}, init=1, ret=11, s={-15:0}, s={-15:0}, s->s3={-17:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:17}, blastFlag=1, buf={0:18}, init=1, ret=11, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1153] COND TRUE 1 VAL [={0:17}, blastFlag=1, buf={0:18}, init=1, ret=11, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:17}, blastFlag=1, buf={0:18}, init=1, ret=11, s={-15:0}, s={-15:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:17}, blastFlag=1, buf={0:18}, init=1, ret=11, s={-15:0}, s={-15:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:17}, blastFlag=1, buf={0:18}, init=1, ret=11, s={-15:0}, s={-15:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:17}, blastFlag=1, buf={0:18}, init=1, ret=11, s={-15:0}, s={-15:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:17}, blastFlag=1, buf={0:18}, init=1, ret=11, s={-15:0}, s={-15:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:17}, blastFlag=1, buf={0:18}, init=1, ret=11, s={-15:0}, s={-15:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:17}, blastFlag=1, buf={0:18}, init=1, ret=11, s={-15:0}, s={-15:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:17}, blastFlag=1, buf={0:18}, init=1, ret=11, s={-15:0}, s={-15:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1177] COND TRUE s->state == 4384 [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 1 [L1335] blastFlag = 2 VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) [L1344] s->hit VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1344] COND FALSE !(s->hit) [L1347] s->state = 4400 VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1349] s->init_num = 0 VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:17}, (s->s3)->tmp.reuse_message=4294967304, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, s->s3={-17:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1153] COND TRUE 1 VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:17}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1183] COND TRUE s->state == 4400 [L1353] EXPR s->s3 [L1353] EXPR (s->s3)->tmp.new_cipher [L1353] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:17}, ((s->s3)->tmp.new_cipher)->algorithms=4294967292, (s->s3)->tmp.new_cipher={-16:0}, blastFlag=2, buf={0:18}, init=1, ret=19, s={-15:0}, s={-15:0}, s->s3={-17:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1353] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 2 [L1358] blastFlag = 3 VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1362] COND FALSE !(ret <= 0) VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1368] s->state = 4416 [L1369] s->init_num = 0 VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:17}, (s->s3)->tmp.reuse_message=4294967304, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, s->s3={-17:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1153] COND TRUE 1 VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:17}, blastFlag=3, buf={0:18}, init=1, ret=22, s={-15:0}, s={-15:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1189] COND TRUE s->state == 4416 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND TRUE blastFlag == 3 [L1375] blastFlag = 4 VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4432 [L1385] s->init_num = 0 [L1386] tmp___6 = __VERIFIER_nondet_int() [L1387] COND FALSE !(! tmp___6) VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:17}, (s->s3)->tmp.reuse_message=4294967304, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->s3={-17:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1153] COND TRUE 1 VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1195] COND TRUE s->state == 4432 [L1396] ret = __VERIFIER_nondet_int() [L1397] COND FALSE !(blastFlag == 5) VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1402] COND FALSE !(ret <= 0) [L1407] s->state = 4448 [L1408] s->init_num = 0 VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:17}, (s->s3)->tmp.reuse_message=4294967304, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->s3={-17:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1153] COND TRUE 1 VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1195] COND FALSE !(s->state == 4432) [L1198] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1198] COND FALSE !(s->state == 4433) [L1201] EXPR s->state VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=1, s={-15:0}, s={-15:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1201] COND TRUE s->state == 4448 [L1412] ret = __VERIFIER_nondet_int() [L1413] COND TRUE blastFlag == 4 VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=-13, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1668] reach_error() VAL [={0:17}, blastFlag=4, buf={0:18}, init=1, ret=-13, s={-15:0}, s={-15:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=0, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 77.7s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 57.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 24 mSolverCounterUnknown, 2208 SdHoareTripleChecker+Valid, 56.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2208 mSDsluCounter, 8058 SdHoareTripleChecker+Invalid, 54.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4363 mSDsCounter, 527 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3312 IncrementalHoareTripleChecker+Invalid, 3863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 527 mSolverCounterUnsat, 3695 mSDtfsCounter, 3312 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1056occurred in iteration=21, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 2614 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 1757 NumberOfCodeBlocks, 1757 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1599 ConstructedInterpolants, 0 QuantifiedInterpolants, 3791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 1350/1350 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 20:54:29,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/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_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/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_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/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_f778adea-7990-4af6-9597-22bce7dd6b59/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 781939b227b3ba0a20ad2d0323c2d13ae338349fb5c0bf292cccf74fd05cfb42 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:54:32,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:54:32,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:54:32,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:54:32,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:54:32,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:54:32,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:54:32,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:54:32,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:54:32,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:54:32,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:54:32,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:54:32,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:54:32,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:54:32,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:54:32,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:54:32,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:54:32,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:54:32,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:54:32,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:54:32,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:54:32,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:54:32,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:54:32,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:54:32,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:54:32,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:54:32,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:54:32,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:54:32,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:54:32,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:54:32,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:54:32,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:54:32,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:54:32,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:54:32,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:54:32,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:54:32,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:54:32,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:54:32,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:54:32,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:54:32,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:54:32,532 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-02 20:54:32,575 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:54:32,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:54:32,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:54:32,582 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:54:32,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:54:32,585 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:54:32,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:54:32,587 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:54:32,588 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:54:32,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:54:32,589 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:54:32,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:54:32,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:54:32,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:54:32,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:54:32,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:54:32,590 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:54:32,591 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 20:54:32,591 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 20:54:32,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:54:32,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:54:32,592 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:54:32,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:54:32,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:54:32,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:54:32,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:54:32,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:54:32,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:54:32,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:54:32,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:54:32,594 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 20:54:32,594 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 20:54:32,595 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:54:32,595 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:54:32,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:54:32,596 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 20:54:32,596 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_f778adea-7990-4af6-9597-22bce7dd6b59/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_f778adea-7990-4af6-9597-22bce7dd6b59/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 -> 781939b227b3ba0a20ad2d0323c2d13ae338349fb5c0bf292cccf74fd05cfb42 [2022-11-02 20:54:33,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:54:33,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:54:33,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:54:33,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:54:33,109 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:54:33,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2022-11-02 20:54:33,195 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/data/0bd7fe717/75a35dd0aaea4aa89a7bcd400fbc1d83/FLAGee6c93453 [2022-11-02 20:54:33,892 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:54:33,902 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2022-11-02 20:54:33,932 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/data/0bd7fe717/75a35dd0aaea4aa89a7bcd400fbc1d83/FLAGee6c93453 [2022-11-02 20:54:34,129 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/data/0bd7fe717/75a35dd0aaea4aa89a7bcd400fbc1d83 [2022-11-02 20:54:34,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:54:34,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:54:34,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:54:34,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:54:34,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:54:34,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:34" (1/1) ... [2022-11-02 20:54:34,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8f0657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:34, skipping insertion in model container [2022-11-02 20:54:34,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:34" (1/1) ... [2022-11-02 20:54:34,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:54:34,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:54:34,790 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_f778adea-7990-4af6-9597-22bce7dd6b59/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c[65520,65533] [2022-11-02 20:54:34,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:54:34,833 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-02 20:54:34,852 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:54:34,975 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_f778adea-7990-4af6-9597-22bce7dd6b59/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c[65520,65533] [2022-11-02 20:54:34,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:54:34,987 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:54:35,154 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_f778adea-7990-4af6-9597-22bce7dd6b59/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c[65520,65533] [2022-11-02 20:54:35,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:54:35,190 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:54:35,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35 WrapperNode [2022-11-02 20:54:35,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:54:35,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:54:35,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:54:35,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:54:35,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35" (1/1) ... [2022-11-02 20:54:35,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35" (1/1) ... [2022-11-02 20:54:35,308 INFO L138 Inliner]: procedures = 35, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 694 [2022-11-02 20:54:35,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:54:35,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:54:35,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:54:35,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:54:35,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35" (1/1) ... [2022-11-02 20:54:35,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35" (1/1) ... [2022-11-02 20:54:35,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35" (1/1) ... [2022-11-02 20:54:35,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35" (1/1) ... [2022-11-02 20:54:35,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35" (1/1) ... [2022-11-02 20:54:35,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35" (1/1) ... [2022-11-02 20:54:35,435 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35" (1/1) ... [2022-11-02 20:54:35,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35" (1/1) ... [2022-11-02 20:54:35,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:54:35,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:54:35,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:54:35,445 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:54:35,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35" (1/1) ... [2022-11-02 20:54:35,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:54:35,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:35,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:54:35,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:54:35,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:54:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 20:54:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:54:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-02 20:54:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:54:35,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:54:35,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:54:35,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:54:35,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-02 20:54:35,839 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:54:35,842 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:54:35,871 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:54:45,371 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-11-02 20:54:45,371 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-11-02 20:54:45,371 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:54:45,380 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:54:45,384 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:54:45,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:45 BoogieIcfgContainer [2022-11-02 20:54:45,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:54:45,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:54:45,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:54:45,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:54:45,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:54:34" (1/3) ... [2022-11-02 20:54:45,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fceb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:45, skipping insertion in model container [2022-11-02 20:54:45,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35" (2/3) ... [2022-11-02 20:54:45,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fceb0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:45, skipping insertion in model container [2022-11-02 20:54:45,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:45" (3/3) ... [2022-11-02 20:54:45,406 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2022-11-02 20:54:45,429 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:54:45,429 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:54:45,518 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:54:45,536 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;@461bfe89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:54:45,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:54:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:54:45,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:45,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:45,555 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:45,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2022-11-02 20:54:45,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:54:45,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211457421] [2022-11-02 20:54:45,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:45,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:54:45,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:54:45,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:54:45,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 20:54:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:46,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:54:46,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:46,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:54:46,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:54:46,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211457421] [2022-11-02 20:54:46,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211457421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:46,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:46,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:46,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251844187] [2022-11-02 20:54:46,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:46,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:54:46,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:46,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:46,997 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:47,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:47,160 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2022-11-02 20:54:47,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:47,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 20:54:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:47,176 INFO L225 Difference]: With dead ends: 375 [2022-11-02 20:54:47,177 INFO L226 Difference]: Without dead ends: 217 [2022-11-02 20:54:47,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:47,184 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 181 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:47,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:54:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-02 20:54:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-11-02 20:54:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2022-11-02 20:54:47,254 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2022-11-02 20:54:47,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:47,255 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2022-11-02 20:54:47,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:47,255 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2022-11-02 20:54:47,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:54:47,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:47,258 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] [2022-11-02 20:54:47,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:47,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:54:47,485 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:47,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:47,485 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2022-11-02 20:54:47,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:54:47,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292809666] [2022-11-02 20:54:47,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:47,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:54:47,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:54:47,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:54:47,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 20:54:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:48,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:54:48,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:48,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:54:48,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:54:48,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292809666] [2022-11-02 20:54:48,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292809666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:48,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:48,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:48,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584231245] [2022-11-02 20:54:48,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:48,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:48,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:54:48,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:48,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:48,923 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:50,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:51,070 INFO L93 Difference]: Finished difference Result 426 states and 636 transitions. [2022-11-02 20:54:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:51,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-11-02 20:54:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:51,073 INFO L225 Difference]: With dead ends: 426 [2022-11-02 20:54:51,073 INFO L226 Difference]: Without dead ends: 319 [2022-11-02 20:54:51,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:51,075 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 126 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:51,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 467 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:54:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-02 20:54:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-11-02 20:54:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4779874213836477) internal successors, (470), 318 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2022-11-02 20:54:51,103 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 39 [2022-11-02 20:54:51,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:51,104 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2022-11-02 20:54:51,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2022-11-02 20:54:51,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-02 20:54:51,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:51,108 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:51,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:51,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:54:51,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1711683715, now seen corresponding path program 1 times [2022-11-02 20:54:51,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:54:51,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856938437] [2022-11-02 20:54:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:51,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:54:51,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:54:51,338 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:54:51,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 20:54:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:52,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:54:52,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:54:52,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:54:52,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:54:52,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856938437] [2022-11-02 20:54:52,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856938437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:52,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:52,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:52,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482870741] [2022-11-02 20:54:52,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:52,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:52,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:54:52,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:52,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:52,918 INFO L87 Difference]: Start difference. First operand 319 states and 470 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:54,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:55,077 INFO L93 Difference]: Finished difference Result 632 states and 937 transitions. [2022-11-02 20:54:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:55,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 57 [2022-11-02 20:54:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:55,081 INFO L225 Difference]: With dead ends: 632 [2022-11-02 20:54:55,081 INFO L226 Difference]: Without dead ends: 423 [2022-11-02 20:54:55,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:55,084 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:55,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:54:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-11-02 20:54:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2022-11-02 20:54:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 1.4739336492890995) internal successors, (622), 422 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:55,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 622 transitions. [2022-11-02 20:54:55,154 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 622 transitions. Word has length 57 [2022-11-02 20:54:55,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:55,155 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 622 transitions. [2022-11-02 20:54:55,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 622 transitions. [2022-11-02 20:54:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:54:55,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:55,166 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:55,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:55,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:54:55,383 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:55,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:55,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1922596163, now seen corresponding path program 1 times [2022-11-02 20:54:55,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:54:55,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476259609] [2022-11-02 20:54:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:55,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:54:55,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:54:55,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:54:55,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-02 20:54:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:56,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:54:56,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-02 20:54:57,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:54:57,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:54:57,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476259609] [2022-11-02 20:54:57,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476259609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:57,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:57,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:57,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294559060] [2022-11-02 20:54:57,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:57,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:57,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:54:57,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:57,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:57,087 INFO L87 Difference]: Start difference. First operand 423 states and 622 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:59,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:59,244 INFO L93 Difference]: Finished difference Result 839 states and 1240 transitions. [2022-11-02 20:54:59,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:59,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-11-02 20:54:59,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:59,249 INFO L225 Difference]: With dead ends: 839 [2022-11-02 20:54:59,250 INFO L226 Difference]: Without dead ends: 526 [2022-11-02 20:54:59,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:59,254 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:59,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 473 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:54:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-11-02 20:54:59,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2022-11-02 20:54:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.4723809523809523) internal successors, (773), 525 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 773 transitions. [2022-11-02 20:54:59,278 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 773 transitions. Word has length 77 [2022-11-02 20:54:59,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:59,279 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 773 transitions. [2022-11-02 20:54:59,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 773 transitions. [2022-11-02 20:54:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 20:54:59,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:59,282 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:59,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:59,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:54:59,497 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:59,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:59,497 INFO L85 PathProgramCache]: Analyzing trace with hash -158208422, now seen corresponding path program 1 times [2022-11-02 20:54:59,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:54:59,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202339660] [2022-11-02 20:54:59,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:59,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:54:59,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:54:59,500 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:54:59,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-02 20:55:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:00,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:55:00,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-11-02 20:55:01,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:55:01,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:55:01,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202339660] [2022-11-02 20:55:01,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202339660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:01,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:01,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:55:01,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519683055] [2022-11-02 20:55:01,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:01,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:01,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:55:01,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:01,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:01,162 INFO L87 Difference]: Start difference. First operand 526 states and 773 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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 20:55:03,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:03,312 INFO L93 Difference]: Finished difference Result 939 states and 1381 transitions. [2022-11-02 20:55:03,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:03,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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 98 [2022-11-02 20:55:03,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:03,321 INFO L225 Difference]: With dead ends: 939 [2022-11-02 20:55:03,323 INFO L226 Difference]: Without dead ends: 523 [2022-11-02 20:55:03,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:03,327 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 128 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:03,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 469 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:55:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-11-02 20:55:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-11-02 20:55:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.4616858237547892) internal successors, (763), 522 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 763 transitions. [2022-11-02 20:55:03,358 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 763 transitions. Word has length 98 [2022-11-02 20:55:03,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:03,359 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 763 transitions. [2022-11-02 20:55:03,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 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 20:55:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 763 transitions. [2022-11-02 20:55:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:55:03,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:03,365 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:03,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-11-02 20:55:03,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:55:03,595 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:03,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2022-11-02 20:55:03,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:55:03,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800876415] [2022-11-02 20:55:03,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:03,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:55:03,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:55:03,598 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:55:03,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f778adea-7990-4af6-9597-22bce7dd6b59/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-02 20:55:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:06,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 20:55:06,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:55:08,541 INFO L356 Elim1Store]: treesize reduction 32, result has 78.5 percent of original size [2022-11-02 20:55:08,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 1482 treesize of output 1090 [2022-11-02 20:55:35,983 WARN L234 SmtUtils]: Spent 27.30s on a formula simplification. DAG size of input: 205 DAG size of output: 93 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-02 20:55:35,985 INFO L356 Elim1Store]: treesize reduction 1374, result has 25.4 percent of original size [2022-11-02 20:55:35,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 9 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 4114 treesize of output 4792 [2022-11-02 20:55:36,095 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 4387 treesize of output 3109 [2022-11-02 20:55:36,355 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 4521 treesize of output 3987 [2022-11-02 20:55:36,917 INFO L244 Elim1Store]: Index analysis took 150 ms [2022-11-02 20:55:39,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:55:39,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3791 treesize of output 3107 [2022-11-02 20:55:39,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1375 treesize of output 1263 [2022-11-02 20:55:41,491 INFO L244 Elim1Store]: Index analysis took 542 ms [2022-11-02 20:55:42,489 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:55:42,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1229 treesize of output 1045 [2022-11-02 20:55:43,809 INFO L244 Elim1Store]: Index analysis took 613 ms [2022-11-02 20:55:44,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 87 [2022-11-02 20:55:46,288 INFO L244 Elim1Store]: Index analysis took 637 ms [2022-11-02 20:55:49,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 111 [2022-11-02 20:55:50,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 131 treesize of output 107 [2022-11-02 20:55:51,837 INFO L244 Elim1Store]: Index analysis took 685 ms [2022-11-02 20:55:53,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 31 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 111