./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/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_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/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_c42c4681-de1e-485a-8560-4ab6af759e75/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 253b2130a235408df8c2a581facc1d40316361da7beeb584c737673c98999cc2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:03:12,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:03:12,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:03:12,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:03:12,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:03:12,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:03:12,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:03:12,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:03:12,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:03:12,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:03:12,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:03:12,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:03:12,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:03:12,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:03:12,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:03:12,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:03:12,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:03:12,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:03:12,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:03:12,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:03:12,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:03:12,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:03:12,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:03:12,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:03:12,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:03:12,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:03:12,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:03:12,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:03:12,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:03:12,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:03:12,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:03:12,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:03:12,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:03:12,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:03:12,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:03:12,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:03:12,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:03:12,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:03:12,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:03:12,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:03:12,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:03:12,498 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:03:12,523 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:03:12,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:03:12,524 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:03:12,524 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:03:12,525 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:03:12,525 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:03:12,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:03:12,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:03:12,526 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:03:12,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:03:12,527 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:03:12,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:03:12,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:03:12,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:03:12,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:03:12,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:03:12,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:03:12,529 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:03:12,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:03:12,529 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:03:12,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:03:12,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:03:12,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:03:12,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:03:12,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:03:12,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:03:12,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:03:12,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:03:12,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:03:12,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:03:12,533 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:03:12,533 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:03:12,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:03:12,534 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_c42c4681-de1e-485a-8560-4ab6af759e75/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_c42c4681-de1e-485a-8560-4ab6af759e75/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 -> 253b2130a235408df8c2a581facc1d40316361da7beeb584c737673c98999cc2 [2022-11-02 21:03:12,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:03:12,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:03:12,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:03:12,852 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:03:12,853 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:03:12,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2022-11-02 21:03:12,928 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/data/1880529b2/949d8fecf9994006a5cf46ce1bf53eb8/FLAGf26a816bc [2022-11-02 21:03:13,509 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:03:13,509 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2022-11-02 21:03:13,542 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/data/1880529b2/949d8fecf9994006a5cf46ce1bf53eb8/FLAGf26a816bc [2022-11-02 21:03:13,756 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/data/1880529b2/949d8fecf9994006a5cf46ce1bf53eb8 [2022-11-02 21:03:13,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:03:13,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:03:13,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:03:13,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:03:13,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:03:13,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:03:13" (1/1) ... [2022-11-02 21:03:13,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a5fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:13, skipping insertion in model container [2022-11-02 21:03:13,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:03:13" (1/1) ... [2022-11-02 21:03:13,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:03:13,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:03:14,230 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_c42c4681-de1e-485a-8560-4ab6af759e75/sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-11-02 21:03:14,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:03:14,265 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:03:14,386 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_c42c4681-de1e-485a-8560-4ab6af759e75/sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-11-02 21:03:14,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:03:14,406 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:03:14,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:14 WrapperNode [2022-11-02 21:03:14,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:03:14,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:03:14,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:03:14,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:03:14,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:14" (1/1) ... [2022-11-02 21:03:14,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:14" (1/1) ... [2022-11-02 21:03:14,502 INFO L138 Inliner]: procedures = 31, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 718 [2022-11-02 21:03:14,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:03:14,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:03:14,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:03:14,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:03:14,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:14" (1/1) ... [2022-11-02 21:03:14,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:14" (1/1) ... [2022-11-02 21:03:14,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:14" (1/1) ... [2022-11-02 21:03:14,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:14" (1/1) ... [2022-11-02 21:03:14,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:14" (1/1) ... [2022-11-02 21:03:14,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:14" (1/1) ... [2022-11-02 21:03:14,614 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:14" (1/1) ... [2022-11-02 21:03:14,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:14" (1/1) ... [2022-11-02 21:03:14,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:03:14,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:03:14,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:03:14,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:03:14,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:14" (1/1) ... [2022-11-02 21:03:14,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:03:14,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:03:14,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:03:14,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:03:14,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:03:14,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:03:14,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:03:14,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:03:14,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:03:14,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:03:14,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:03:14,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:03:14,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:03:14,947 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:03:14,949 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:03:14,978 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:03:18,098 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-11-02 21:03:18,098 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-11-02 21:03:18,098 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:03:18,108 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:03:18,109 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 21:03:18,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:03:18 BoogieIcfgContainer [2022-11-02 21:03:18,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:03:18,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:03:18,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:03:18,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:03:18,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:03:13" (1/3) ... [2022-11-02 21:03:18,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d46644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:03:18, skipping insertion in model container [2022-11-02 21:03:18,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:14" (2/3) ... [2022-11-02 21:03:18,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d46644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:03:18, skipping insertion in model container [2022-11-02 21:03:18,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:03:18" (3/3) ... [2022-11-02 21:03:18,125 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2022-11-02 21:03:18,145 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:03:18,145 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:03:18,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:03:18,248 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;@4d45dd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:03:18,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:03:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:03:18,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:18,274 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 21:03:18,275 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:18,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:18,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-11-02 21:03:18,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:18,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124480772] [2022-11-02 21:03:18,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:18,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:19,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:19,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124480772] [2022-11-02 21:03:19,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124480772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:19,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:19,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:19,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461752949] [2022-11-02 21:03:19,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:19,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:19,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:19,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:19,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:19,825 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 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 21:03:21,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:22,233 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2022-11-02 21:03:22,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:03:22,236 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 21:03:22,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:22,258 INFO L225 Difference]: With dead ends: 255 [2022-11-02 21:03:22,258 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 21:03:22,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:22,272 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 7 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:22,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 530 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:03:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 21:03:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2022-11-02 21:03:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 114 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2022-11-02 21:03:22,321 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2022-11-02 21:03:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:22,322 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2022-11-02 21:03:22,322 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 21:03:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2022-11-02 21:03:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 21:03:22,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:22,324 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] [2022-11-02 21:03:22,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:03:22,324 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:22,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2022-11-02 21:03:22,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:22,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070232589] [2022-11-02 21:03:22,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:22,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:22,785 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 21:03:22,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:22,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070232589] [2022-11-02 21:03:22,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070232589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:22,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:22,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:03:22,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225962784] [2022-11-02 21:03:22,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:22,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:22,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:22,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:22,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:22,792 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:22,859 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2022-11-02 21:03:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:22,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-02 21:03:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:22,869 INFO L225 Difference]: With dead ends: 321 [2022-11-02 21:03:22,870 INFO L226 Difference]: Without dead ends: 216 [2022-11-02 21:03:22,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:22,876 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 124 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:22,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 310 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:03:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-02 21:03:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-11-02 21:03:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.4883720930232558) internal successors, (320), 215 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:22,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2022-11-02 21:03:22,921 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2022-11-02 21:03:22,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:22,921 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2022-11-02 21:03:22,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2022-11-02 21:03:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 21:03:22,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:22,926 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] [2022-11-02 21:03:22,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:03:22,927 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:22,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:22,928 INFO L85 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2022-11-02 21:03:22,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:22,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947949221] [2022-11-02 21:03:22,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:22,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:23,369 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 21:03:23,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:23,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947949221] [2022-11-02 21:03:23,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947949221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:23,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:23,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:03:23,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796096462] [2022-11-02 21:03:23,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:23,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:23,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:23,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:23,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:23,373 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:25,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:25,451 INFO L93 Difference]: Finished difference Result 421 states and 631 transitions. [2022-11-02 21:03:25,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:25,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 53 [2022-11-02 21:03:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:25,454 INFO L225 Difference]: With dead ends: 421 [2022-11-02 21:03:25,454 INFO L226 Difference]: Without dead ends: 316 [2022-11-02 21:03:25,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:25,456 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 461 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 21:03:25,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 461 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 21:03:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-02 21:03:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-11-02 21:03:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.4825396825396826) internal successors, (467), 315 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 467 transitions. [2022-11-02 21:03:25,490 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 467 transitions. Word has length 53 [2022-11-02 21:03:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:25,490 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 467 transitions. [2022-11-02 21:03:25,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 467 transitions. [2022-11-02 21:03:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 21:03:25,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:25,499 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] [2022-11-02 21:03:25,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:03:25,500 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:25,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:25,500 INFO L85 PathProgramCache]: Analyzing trace with hash -971278195, now seen corresponding path program 1 times [2022-11-02 21:03:25,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:25,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445668876] [2022-11-02 21:03:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:25,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:26,347 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 21:03:26,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:26,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445668876] [2022-11-02 21:03:26,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445668876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:26,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:26,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:26,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781442754] [2022-11-02 21:03:26,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:26,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:26,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:26,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:26,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:26,351 INFO L87 Difference]: Start difference. First operand 316 states and 467 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:28,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:28,882 INFO L93 Difference]: Finished difference Result 894 states and 1328 transitions. [2022-11-02 21:03:28,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:03:28,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-11-02 21:03:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:28,886 INFO L225 Difference]: With dead ends: 894 [2022-11-02 21:03:28,887 INFO L226 Difference]: Without dead ends: 588 [2022-11-02 21:03:28,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:28,889 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:28,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 265 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:03:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-11-02 21:03:28,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 388. [2022-11-02 21:03:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.5322997416020672) internal successors, (593), 387 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 593 transitions. [2022-11-02 21:03:28,914 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 593 transitions. Word has length 71 [2022-11-02 21:03:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:28,915 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 593 transitions. [2022-11-02 21:03:28,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 593 transitions. [2022-11-02 21:03:28,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-02 21:03:28,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:28,917 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] [2022-11-02 21:03:28,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:03:28,918 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:28,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:28,919 INFO L85 PathProgramCache]: Analyzing trace with hash -49538802, now seen corresponding path program 1 times [2022-11-02 21:03:28,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:28,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370871108] [2022-11-02 21:03:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:28,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:29,615 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 21:03:29,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:29,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370871108] [2022-11-02 21:03:29,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370871108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:29,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:29,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:29,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227822935] [2022-11-02 21:03:29,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:29,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:29,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:29,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:29,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:29,618 INFO L87 Difference]: Start difference. First operand 388 states and 593 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:31,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:32,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:33,330 INFO L93 Difference]: Finished difference Result 944 states and 1441 transitions. [2022-11-02 21:03:33,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:03:33,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-11-02 21:03:33,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:33,334 INFO L225 Difference]: With dead ends: 944 [2022-11-02 21:03:33,334 INFO L226 Difference]: Without dead ends: 566 [2022-11-02 21:03:33,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:33,336 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 91 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:33,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 235 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-11-02 21:03:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-11-02 21:03:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 440. [2022-11-02 21:03:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.55125284738041) internal successors, (681), 439 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 681 transitions. [2022-11-02 21:03:33,367 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 681 transitions. Word has length 72 [2022-11-02 21:03:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:33,367 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 681 transitions. [2022-11-02 21:03:33,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 681 transitions. [2022-11-02 21:03:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-02 21:03:33,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:33,369 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] [2022-11-02 21:03:33,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:03:33,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:33,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:33,371 INFO L85 PathProgramCache]: Analyzing trace with hash 91009808, now seen corresponding path program 1 times [2022-11-02 21:03:33,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:33,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844442946] [2022-11-02 21:03:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:33,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:34,055 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 21:03:34,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:34,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844442946] [2022-11-02 21:03:34,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844442946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:34,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:34,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:34,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726313469] [2022-11-02 21:03:34,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:34,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:34,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:34,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:34,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:34,058 INFO L87 Difference]: Start difference. First operand 440 states and 681 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:36,072 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 21:03:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:36,563 INFO L93 Difference]: Finished difference Result 1142 states and 1756 transitions. [2022-11-02 21:03:36,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:03:36,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-11-02 21:03:36,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:36,567 INFO L225 Difference]: With dead ends: 1142 [2022-11-02 21:03:36,567 INFO L226 Difference]: Without dead ends: 712 [2022-11-02 21:03:36,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:36,570 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 107 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 264 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.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:36,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:03:36,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-11-02 21:03:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 463. [2022-11-02 21:03:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.5692640692640694) internal successors, (725), 462 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 725 transitions. [2022-11-02 21:03:36,594 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 725 transitions. Word has length 72 [2022-11-02 21:03:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:36,596 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 725 transitions. [2022-11-02 21:03:36,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 725 transitions. [2022-11-02 21:03:36,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-02 21:03:36,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:36,598 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:36,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:03:36,598 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:36,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:36,599 INFO L85 PathProgramCache]: Analyzing trace with hash -406970094, now seen corresponding path program 1 times [2022-11-02 21:03:36,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:36,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754180590] [2022-11-02 21:03:36,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 21:03:37,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:37,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754180590] [2022-11-02 21:03:37,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754180590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:37,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:37,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:37,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809843251] [2022-11-02 21:03:37,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:37,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:37,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:37,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:37,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:37,346 INFO L87 Difference]: Start difference. First operand 463 states and 725 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 21:03:39,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:41,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:41,895 INFO L93 Difference]: Finished difference Result 1094 states and 1703 transitions. [2022-11-02 21:03:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:03:41,896 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 21:03:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:41,899 INFO L225 Difference]: With dead ends: 1094 [2022-11-02 21:03:41,899 INFO L226 Difference]: Without dead ends: 641 [2022-11-02 21:03:41,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:41,901 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 93 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 550 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.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:41,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 550 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 21:03:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-11-02 21:03:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 509. [2022-11-02 21:03:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.580708661417323) internal successors, (803), 508 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 803 transitions. [2022-11-02 21:03:41,927 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 803 transitions. Word has length 92 [2022-11-02 21:03:41,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:41,927 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 803 transitions. [2022-11-02 21:03:41,927 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 21:03:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 803 transitions. [2022-11-02 21:03:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-02 21:03:41,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:41,935 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:41,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:03:41,936 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:41,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:41,937 INFO L85 PathProgramCache]: Analyzing trace with hash 486516244, now seen corresponding path program 1 times [2022-11-02 21:03:41,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:41,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842825210] [2022-11-02 21:03:41,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 21:03:42,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:42,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842825210] [2022-11-02 21:03:42,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842825210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:42,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:42,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994856654] [2022-11-02 21:03:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:42,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:42,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:42,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:42,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:42,595 INFO L87 Difference]: Start difference. First operand 509 states and 803 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 21:03:44,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:46,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:46,974 INFO L93 Difference]: Finished difference Result 1094 states and 1720 transitions. [2022-11-02 21:03:46,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:03:46,977 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 92 [2022-11-02 21:03:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:46,979 INFO L225 Difference]: With dead ends: 1094 [2022-11-02 21:03:46,979 INFO L226 Difference]: Without dead ends: 595 [2022-11-02 21:03:46,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:46,981 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 40 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 494 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.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:46,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 494 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-11-02 21:03:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-11-02 21:03:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 549. [2022-11-02 21:03:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5894160583941606) internal successors, (871), 548 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 871 transitions. [2022-11-02 21:03:47,003 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 871 transitions. Word has length 92 [2022-11-02 21:03:47,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:47,004 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 871 transitions. [2022-11-02 21:03:47,004 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 21:03:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 871 transitions. [2022-11-02 21:03:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 21:03:47,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:47,006 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:47,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:03:47,007 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:47,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash 648309393, now seen corresponding path program 1 times [2022-11-02 21:03:47,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:47,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382854847] [2022-11-02 21:03:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 21:03:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:47,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382854847] [2022-11-02 21:03:47,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382854847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:47,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:47,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:47,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079604132] [2022-11-02 21:03:47,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:47,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:47,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:47,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:47,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:47,700 INFO L87 Difference]: Start difference. First operand 549 states and 871 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:49,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:50,223 INFO L93 Difference]: Finished difference Result 1285 states and 2001 transitions. [2022-11-02 21:03:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:03:50,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-11-02 21:03:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:50,228 INFO L225 Difference]: With dead ends: 1285 [2022-11-02 21:03:50,228 INFO L226 Difference]: Without dead ends: 746 [2022-11-02 21:03:50,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:50,230 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 108 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 264 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 21:03:50,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:03:50,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-11-02 21:03:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 549. [2022-11-02 21:03:50,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5784671532846715) internal successors, (865), 548 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 865 transitions. [2022-11-02 21:03:50,261 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 865 transitions. Word has length 93 [2022-11-02 21:03:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:50,262 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 865 transitions. [2022-11-02 21:03:50,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 865 transitions. [2022-11-02 21:03:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 21:03:50,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:50,265 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:50,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:03:50,265 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:50,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:50,266 INFO L85 PathProgramCache]: Analyzing trace with hash 328538170, now seen corresponding path program 2 times [2022-11-02 21:03:50,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:50,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380351773] [2022-11-02 21:03:50,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:50,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 21:03:50,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:50,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380351773] [2022-11-02 21:03:50,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380351773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:50,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:50,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:50,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781954063] [2022-11-02 21:03:50,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:50,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:50,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:51,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:51,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:51,001 INFO L87 Difference]: Start difference. First operand 549 states and 865 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 21:03:53,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:55,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:03:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:55,520 INFO L93 Difference]: Finished difference Result 1282 states and 1986 transitions. [2022-11-02 21:03:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:03:55,521 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 106 [2022-11-02 21:03:55,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:55,524 INFO L225 Difference]: With dead ends: 1282 [2022-11-02 21:03:55,524 INFO L226 Difference]: Without dead ends: 743 [2022-11-02 21:03:55,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:03:55,526 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 111 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 282 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 21:03:55,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 282 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 21:03:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-11-02 21:03:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 549. [2022-11-02 21:03:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5602189781021898) internal successors, (855), 548 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:03:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 855 transitions. [2022-11-02 21:03:55,555 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 855 transitions. Word has length 106 [2022-11-02 21:03:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:55,555 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 855 transitions. [2022-11-02 21:03:55,555 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 21:03:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 855 transitions. [2022-11-02 21:03:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 21:03:55,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:55,558 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:55,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:03:55,558 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:03:55,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:55,559 INFO L85 PathProgramCache]: Analyzing trace with hash 945009752, now seen corresponding path program 1 times [2022-11-02 21:03:55,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:55,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370736594] [2022-11-02 21:03:55,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:55,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 21:03:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:56,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370736594] [2022-11-02 21:03:56,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370736594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:56,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:56,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:03:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522473641] [2022-11-02 21:03:56,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:56,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:03:56,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:56,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:03:56,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:03:56,219 INFO L87 Difference]: Start difference. First operand 549 states and 855 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 21:03:58,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:00,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:00,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:00,765 INFO L93 Difference]: Finished difference Result 1212 states and 1872 transitions. [2022-11-02 21:04:00,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:00,766 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 106 [2022-11-02 21:04:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:00,769 INFO L225 Difference]: With dead ends: 1212 [2022-11-02 21:04:00,769 INFO L226 Difference]: Without dead ends: 673 [2022-11-02 21:04:00,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:00,771 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 97 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:00,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 538 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 21:04:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-11-02 21:04:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 549. [2022-11-02 21:04:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5565693430656935) internal successors, (853), 548 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 853 transitions. [2022-11-02 21:04:00,797 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 853 transitions. Word has length 106 [2022-11-02 21:04:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:00,797 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 853 transitions. [2022-11-02 21:04:00,797 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 21:04:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 853 transitions. [2022-11-02 21:04:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 21:04:00,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:00,799 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:00,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:04:00,800 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:00,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1505709530, now seen corresponding path program 1 times [2022-11-02 21:04:00,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:00,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083891178] [2022-11-02 21:04:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:00,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 21:04:01,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:01,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083891178] [2022-11-02 21:04:01,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083891178] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:01,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:01,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:01,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591184126] [2022-11-02 21:04:01,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:01,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:01,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:01,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:01,445 INFO L87 Difference]: Start difference. First operand 549 states and 853 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 21:04:03,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:05,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:05,791 INFO L93 Difference]: Finished difference Result 1132 states and 1748 transitions. [2022-11-02 21:04:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:05,792 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 106 [2022-11-02 21:04:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:05,795 INFO L225 Difference]: With dead ends: 1132 [2022-11-02 21:04:05,795 INFO L226 Difference]: Without dead ends: 593 [2022-11-02 21:04:05,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:05,801 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 46 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:05,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 492 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-11-02 21:04:05,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-11-02 21:04:05,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 549. [2022-11-02 21:04:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.552919708029197) internal successors, (851), 548 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 851 transitions. [2022-11-02 21:04:05,825 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 851 transitions. Word has length 106 [2022-11-02 21:04:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:05,826 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 851 transitions. [2022-11-02 21:04:05,826 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 21:04:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 851 transitions. [2022-11-02 21:04:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-02 21:04:05,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:05,828 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:05,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:04:05,828 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:05,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:05,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1643241353, now seen corresponding path program 1 times [2022-11-02 21:04:05,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:05,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495231860] [2022-11-02 21:04:05,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:05,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 21:04:06,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:06,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495231860] [2022-11-02 21:04:06,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495231860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:06,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:06,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:06,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008157494] [2022-11-02 21:04:06,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:06,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:06,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:06,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:06,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:06,470 INFO L87 Difference]: Start difference. First operand 549 states and 851 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 21:04:08,483 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 21:04:08,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:08,937 INFO L93 Difference]: Finished difference Result 1283 states and 1959 transitions. [2022-11-02 21:04:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:08,938 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 107 [2022-11-02 21:04:08,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:08,940 INFO L225 Difference]: With dead ends: 1283 [2022-11-02 21:04:08,941 INFO L226 Difference]: Without dead ends: 744 [2022-11-02 21:04:08,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:08,943 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 117 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 286 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.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:08,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 286 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:04:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-11-02 21:04:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 549. [2022-11-02 21:04:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.5346715328467153) internal successors, (841), 548 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 841 transitions. [2022-11-02 21:04:08,968 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 841 transitions. Word has length 107 [2022-11-02 21:04:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:08,969 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 841 transitions. [2022-11-02 21:04:08,969 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 21:04:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 841 transitions. [2022-11-02 21:04:08,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-02 21:04:08,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:08,994 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:08,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:04:08,994 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:08,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:08,995 INFO L85 PathProgramCache]: Analyzing trace with hash 521678268, now seen corresponding path program 1 times [2022-11-02 21:04:08,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:08,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506593488] [2022-11-02 21:04:08,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:08,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 21:04:09,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:09,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506593488] [2022-11-02 21:04:09,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506593488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:09,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:09,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:09,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058489264] [2022-11-02 21:04:09,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:09,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:09,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:09,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:09,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:09,639 INFO L87 Difference]: Start difference. First operand 549 states and 841 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 21:04:11,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:12,123 INFO L93 Difference]: Finished difference Result 1167 states and 1766 transitions. [2022-11-02 21:04:12,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:12,124 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 107 [2022-11-02 21:04:12,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:12,127 INFO L225 Difference]: With dead ends: 1167 [2022-11-02 21:04:12,127 INFO L226 Difference]: Without dead ends: 819 [2022-11-02 21:04:12,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:12,129 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 113 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 492 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.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:12,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 492 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:04:12,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-11-02 21:04:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 597. [2022-11-02 21:04:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.5201342281879195) internal successors, (906), 596 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 906 transitions. [2022-11-02 21:04:12,159 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 906 transitions. Word has length 107 [2022-11-02 21:04:12,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:12,159 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 906 transitions. [2022-11-02 21:04:12,159 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 21:04:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 906 transitions. [2022-11-02 21:04:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-02 21:04:12,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:12,162 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:12,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:04:12,162 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:12,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1921869643, now seen corresponding path program 1 times [2022-11-02 21:04:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:12,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839258235] [2022-11-02 21:04:12,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:12,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 21:04:12,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:12,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839258235] [2022-11-02 21:04:12,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839258235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:12,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:12,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:12,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894928608] [2022-11-02 21:04:12,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:12,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:12,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:12,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:12,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:12,806 INFO L87 Difference]: Start difference. First operand 597 states and 906 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:14,819 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 21:04:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:15,298 INFO L93 Difference]: Finished difference Result 1460 states and 2192 transitions. [2022-11-02 21:04:15,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:15,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-11-02 21:04:15,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:15,302 INFO L225 Difference]: With dead ends: 1460 [2022-11-02 21:04:15,302 INFO L226 Difference]: Without dead ends: 873 [2022-11-02 21:04:15,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:15,307 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 93 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:15,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 266 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:04:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-11-02 21:04:15,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 711. [2022-11-02 21:04:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.5380281690140845) internal successors, (1092), 710 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1092 transitions. [2022-11-02 21:04:15,342 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1092 transitions. Word has length 107 [2022-11-02 21:04:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:15,342 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 1092 transitions. [2022-11-02 21:04:15,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1092 transitions. [2022-11-02 21:04:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 21:04:15,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:15,345 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:15,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:04:15,346 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1096338685, now seen corresponding path program 1 times [2022-11-02 21:04:15,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:15,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770922656] [2022-11-02 21:04:15,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:15,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 21:04:15,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:15,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770922656] [2022-11-02 21:04:15,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770922656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:15,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:15,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68492981] [2022-11-02 21:04:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:15,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:15,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:15,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:15,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:15,906 INFO L87 Difference]: Start difference. First operand 711 states and 1092 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 21:04:17,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:19,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:20,413 INFO L93 Difference]: Finished difference Result 1536 states and 2344 transitions. [2022-11-02 21:04:20,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:20,414 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 108 [2022-11-02 21:04:20,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:20,417 INFO L225 Difference]: With dead ends: 1536 [2022-11-02 21:04:20,417 INFO L226 Difference]: Without dead ends: 835 [2022-11-02 21:04:20,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:20,419 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 91 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:20,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 530 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 21:04:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-11-02 21:04:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 711. [2022-11-02 21:04:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.5352112676056338) internal successors, (1090), 710 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1090 transitions. [2022-11-02 21:04:20,458 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1090 transitions. Word has length 108 [2022-11-02 21:04:20,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:20,459 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 1090 transitions. [2022-11-02 21:04:20,459 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 21:04:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1090 transitions. [2022-11-02 21:04:20,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 21:04:20,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:20,461 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:20,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:04:20,462 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:20,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:20,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1722268611, now seen corresponding path program 1 times [2022-11-02 21:04:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:20,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324003043] [2022-11-02 21:04:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 21:04:20,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:20,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324003043] [2022-11-02 21:04:20,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324003043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:20,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:20,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:20,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485381528] [2022-11-02 21:04:20,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:20,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:20,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:20,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:20,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:20,942 INFO L87 Difference]: Start difference. First operand 711 states and 1090 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 21:04:22,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:24,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:25,425 INFO L93 Difference]: Finished difference Result 1285 states and 1958 transitions. [2022-11-02 21:04:25,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:25,426 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 108 [2022-11-02 21:04:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:25,429 INFO L225 Difference]: With dead ends: 1285 [2022-11-02 21:04:25,429 INFO L226 Difference]: Without dead ends: 829 [2022-11-02 21:04:25,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:25,430 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 85 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:25,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 524 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-11-02 21:04:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-11-02 21:04:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 711. [2022-11-02 21:04:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.532394366197183) internal successors, (1088), 710 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1088 transitions. [2022-11-02 21:04:25,460 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1088 transitions. Word has length 108 [2022-11-02 21:04:25,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:25,460 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 1088 transitions. [2022-11-02 21:04:25,461 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 21:04:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1088 transitions. [2022-11-02 21:04:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 21:04:25,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:25,463 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:25,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:04:25,463 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:25,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:25,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2029459340, now seen corresponding path program 1 times [2022-11-02 21:04:25,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:25,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471171449] [2022-11-02 21:04:25,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:25,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 21:04:25,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:25,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471171449] [2022-11-02 21:04:25,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471171449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:25,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:25,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:25,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13278154] [2022-11-02 21:04:25,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:25,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:25,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:25,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:25,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:25,995 INFO L87 Difference]: Start difference. First operand 711 states and 1088 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:28,007 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 21:04:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:28,422 INFO L93 Difference]: Finished difference Result 1607 states and 2433 transitions. [2022-11-02 21:04:28,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:28,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-11-02 21:04:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:28,427 INFO L225 Difference]: With dead ends: 1607 [2022-11-02 21:04:28,427 INFO L226 Difference]: Without dead ends: 906 [2022-11-02 21:04:28,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:28,429 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 92 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 268 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.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:28,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 268 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:04:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2022-11-02 21:04:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 747. [2022-11-02 21:04:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 1.5509383378016086) internal successors, (1157), 746 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1157 transitions. [2022-11-02 21:04:28,463 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1157 transitions. Word has length 108 [2022-11-02 21:04:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:28,463 INFO L495 AbstractCegarLoop]: Abstraction has 747 states and 1157 transitions. [2022-11-02 21:04:28,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1157 transitions. [2022-11-02 21:04:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 21:04:28,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:28,466 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:28,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:04:28,466 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:28,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:28,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1379060519, now seen corresponding path program 1 times [2022-11-02 21:04:28,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:28,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316924927] [2022-11-02 21:04:28,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:28,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 21:04:28,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:28,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316924927] [2022-11-02 21:04:28,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316924927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:28,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:28,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:28,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822492963] [2022-11-02 21:04:28,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:28,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:28,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:28,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:28,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:28,954 INFO L87 Difference]: Start difference. First operand 747 states and 1157 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:30,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:32,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:33,360 INFO L93 Difference]: Finished difference Result 1598 states and 2461 transitions. [2022-11-02 21:04:33,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:33,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-11-02 21:04:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:33,365 INFO L225 Difference]: With dead ends: 1598 [2022-11-02 21:04:33,365 INFO L226 Difference]: Without dead ends: 861 [2022-11-02 21:04:33,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:33,367 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 61 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:33,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 518 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 220 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-11-02 21:04:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2022-11-02 21:04:33,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 779. [2022-11-02 21:04:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 778 states have (on average 1.5539845758354756) internal successors, (1209), 778 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1209 transitions. [2022-11-02 21:04:33,401 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1209 transitions. Word has length 108 [2022-11-02 21:04:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:33,402 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1209 transitions. [2022-11-02 21:04:33,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1209 transitions. [2022-11-02 21:04:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 21:04:33,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:33,404 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:33,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:04:33,405 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:33,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:33,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1237053953, now seen corresponding path program 1 times [2022-11-02 21:04:33,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:33,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136471345] [2022-11-02 21:04:33,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:33,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 21:04:33,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:33,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136471345] [2022-11-02 21:04:33,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136471345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:33,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:33,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:33,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451380492] [2022-11-02 21:04:33,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:33,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:33,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:33,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:33,973 INFO L87 Difference]: Start difference. First operand 779 states and 1209 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 21:04:35,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:36,410 INFO L93 Difference]: Finished difference Result 1707 states and 2603 transitions. [2022-11-02 21:04:36,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:36,411 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 108 [2022-11-02 21:04:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:36,414 INFO L225 Difference]: With dead ends: 1707 [2022-11-02 21:04:36,414 INFO L226 Difference]: Without dead ends: 938 [2022-11-02 21:04:36,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:36,416 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 114 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 264 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.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:36,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:04:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-11-02 21:04:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 779. [2022-11-02 21:04:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 778 states have (on average 1.5359897172236503) internal successors, (1195), 778 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1195 transitions. [2022-11-02 21:04:36,453 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1195 transitions. Word has length 108 [2022-11-02 21:04:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:36,454 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1195 transitions. [2022-11-02 21:04:36,454 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 21:04:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1195 transitions. [2022-11-02 21:04:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-02 21:04:36,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:36,456 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:36,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:04:36,456 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:36,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:36,457 INFO L85 PathProgramCache]: Analyzing trace with hash 239306047, now seen corresponding path program 1 times [2022-11-02 21:04:36,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:36,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535150555] [2022-11-02 21:04:36,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 21:04:37,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:37,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535150555] [2022-11-02 21:04:37,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535150555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:37,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:37,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:37,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283577724] [2022-11-02 21:04:37,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:37,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:37,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:37,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:37,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:37,002 INFO L87 Difference]: Start difference. First operand 779 states and 1195 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 21:04:39,020 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 21:04:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:39,462 INFO L93 Difference]: Finished difference Result 1489 states and 2259 transitions. [2022-11-02 21:04:39,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:39,463 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 108 [2022-11-02 21:04:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:39,467 INFO L225 Difference]: With dead ends: 1489 [2022-11-02 21:04:39,467 INFO L226 Difference]: Without dead ends: 993 [2022-11-02 21:04:39,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:39,469 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 107 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:39,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 474 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:04:39,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-11-02 21:04:39,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 782. [2022-11-02 21:04:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.5236875800256082) internal successors, (1190), 781 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1190 transitions. [2022-11-02 21:04:39,510 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1190 transitions. Word has length 108 [2022-11-02 21:04:39,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:39,510 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1190 transitions. [2022-11-02 21:04:39,511 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 21:04:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1190 transitions. [2022-11-02 21:04:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-02 21:04:39,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:39,513 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:39,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:04:39,513 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:39,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:39,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1494959612, now seen corresponding path program 1 times [2022-11-02 21:04:39,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:39,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230837181] [2022-11-02 21:04:39,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:39,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 21:04:40,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:40,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230837181] [2022-11-02 21:04:40,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230837181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:40,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:40,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:40,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008503547] [2022-11-02 21:04:40,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:40,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:40,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:40,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:40,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:40,062 INFO L87 Difference]: Start difference. First operand 782 states and 1190 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:42,077 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 21:04:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:42,490 INFO L93 Difference]: Finished difference Result 1713 states and 2565 transitions. [2022-11-02 21:04:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:42,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-11-02 21:04:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:42,501 INFO L225 Difference]: With dead ends: 1713 [2022-11-02 21:04:42,501 INFO L226 Difference]: Without dead ends: 941 [2022-11-02 21:04:42,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:42,503 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 112 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 268 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.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:42,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 268 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:04:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-11-02 21:04:42,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 782. [2022-11-02 21:04:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.503201024327785) internal successors, (1174), 781 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1174 transitions. [2022-11-02 21:04:42,544 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1174 transitions. Word has length 109 [2022-11-02 21:04:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:42,544 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1174 transitions. [2022-11-02 21:04:42,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1174 transitions. [2022-11-02 21:04:42,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-02 21:04:42,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:42,546 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:42,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:04:42,547 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:42,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1195640152, now seen corresponding path program 1 times [2022-11-02 21:04:42,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:42,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544280574] [2022-11-02 21:04:42,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:42,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 21:04:43,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:43,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544280574] [2022-11-02 21:04:43,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544280574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:43,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:43,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:43,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027650917] [2022-11-02 21:04:43,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:43,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:43,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:43,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:43,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:43,072 INFO L87 Difference]: Start difference. First operand 782 states and 1174 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:45,085 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 21:04:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:45,482 INFO L93 Difference]: Finished difference Result 1713 states and 2533 transitions. [2022-11-02 21:04:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:45,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-11-02 21:04:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:45,486 INFO L225 Difference]: With dead ends: 1713 [2022-11-02 21:04:45,487 INFO L226 Difference]: Without dead ends: 941 [2022-11-02 21:04:45,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:45,488 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 264 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.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:45,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 264 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:04:45,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-11-02 21:04:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 788. [2022-11-02 21:04:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.5031766200762389) internal successors, (1183), 787 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1183 transitions. [2022-11-02 21:04:45,531 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1183 transitions. Word has length 109 [2022-11-02 21:04:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:45,532 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1183 transitions. [2022-11-02 21:04:45,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1183 transitions. [2022-11-02 21:04:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-02 21:04:45,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:45,534 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] [2022-11-02 21:04:45,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 21:04:45,534 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:45,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:45,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1791034879, now seen corresponding path program 1 times [2022-11-02 21:04:45,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:45,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347614439] [2022-11-02 21:04:45,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:45,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 21:04:46,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:46,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347614439] [2022-11-02 21:04:46,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347614439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:46,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:46,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:46,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186553585] [2022-11-02 21:04:46,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:46,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:46,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:46,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:46,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:46,153 INFO L87 Difference]: Start difference. First operand 788 states and 1183 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:48,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:48,575 INFO L93 Difference]: Finished difference Result 1719 states and 2539 transitions. [2022-11-02 21:04:48,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:48,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-11-02 21:04:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:48,579 INFO L225 Difference]: With dead ends: 1719 [2022-11-02 21:04:48,579 INFO L226 Difference]: Without dead ends: 941 [2022-11-02 21:04:48,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:48,581 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 105 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 272 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.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:48,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 272 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 21:04:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-11-02 21:04:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 788. [2022-11-02 21:04:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.4891994917407878) internal successors, (1172), 787 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1172 transitions. [2022-11-02 21:04:48,626 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1172 transitions. Word has length 110 [2022-11-02 21:04:48,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:48,626 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1172 transitions. [2022-11-02 21:04:48,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1172 transitions. [2022-11-02 21:04:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-02 21:04:48,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:48,629 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:48,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:04:48,629 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:48,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1059618658, now seen corresponding path program 1 times [2022-11-02 21:04:48,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:48,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564760245] [2022-11-02 21:04:48,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:48,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 21:04:49,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:49,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564760245] [2022-11-02 21:04:49,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564760245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:49,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:49,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:49,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159310394] [2022-11-02 21:04:49,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:49,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:49,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:49,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:49,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:49,149 INFO L87 Difference]: Start difference. First operand 788 states and 1172 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:51,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:51,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:51,545 INFO L93 Difference]: Finished difference Result 1710 states and 2505 transitions. [2022-11-02 21:04:51,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:51,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-11-02 21:04:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:51,550 INFO L225 Difference]: With dead ends: 1710 [2022-11-02 21:04:51,550 INFO L226 Difference]: Without dead ends: 929 [2022-11-02 21:04:51,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:04:51,551 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 83 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:51,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 270 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 203 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 21:04:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-11-02 21:04:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 794. [2022-11-02 21:04:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.489281210592686) internal successors, (1181), 793 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1181 transitions. [2022-11-02 21:04:51,598 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1181 transitions. Word has length 110 [2022-11-02 21:04:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:51,598 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1181 transitions. [2022-11-02 21:04:51,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1181 transitions. [2022-11-02 21:04:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-02 21:04:51,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:51,600 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] [2022-11-02 21:04:51,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:04:51,601 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:51,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:51,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2086535811, now seen corresponding path program 1 times [2022-11-02 21:04:51,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:51,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775086302] [2022-11-02 21:04:51,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:51,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-02 21:04:51,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:51,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775086302] [2022-11-02 21:04:51,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775086302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:51,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:51,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:51,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078486322] [2022-11-02 21:04:51,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:51,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:51,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:51,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:51,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:51,805 INFO L87 Difference]: Start difference. First operand 794 states and 1181 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:53,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:04:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:53,881 INFO L93 Difference]: Finished difference Result 1578 states and 2354 transitions. [2022-11-02 21:04:53,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:53,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-11-02 21:04:53,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:53,886 INFO L225 Difference]: With dead ends: 1578 [2022-11-02 21:04:53,886 INFO L226 Difference]: Without dead ends: 1074 [2022-11-02 21:04:53,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:53,888 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 123 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:53,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 468 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-11-02 21:04:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2022-11-02 21:04:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2022-11-02 21:04:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 1073 states have (on average 1.4874184529356944) internal successors, (1596), 1073 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1596 transitions. [2022-11-02 21:04:53,960 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1596 transitions. Word has length 110 [2022-11-02 21:04:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:53,960 INFO L495 AbstractCegarLoop]: Abstraction has 1074 states and 1596 transitions. [2022-11-02 21:04:53,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:04:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1596 transitions. [2022-11-02 21:04:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 21:04:53,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:53,963 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] [2022-11-02 21:04:53,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 21:04:53,963 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:53,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash 797599730, now seen corresponding path program 1 times [2022-11-02 21:04:53,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:53,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294886025] [2022-11-02 21:04:53,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:53,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:04:54,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:04:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:04:55,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:04:55,453 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:04:55,454 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 21:04:55,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 21:04:55,460 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:55,464 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:04:55,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:04:55 BoogieIcfgContainer [2022-11-02 21:04:55,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:04:55,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:04:55,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:04:55,621 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:04:55,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:03:18" (3/4) ... [2022-11-02 21:04:55,625 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 21:04:55,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:04:55,626 INFO L158 Benchmark]: Toolchain (without parser) took 101865.51ms. Allocated memory was 94.4MB in the beginning and 352.3MB in the end (delta: 257.9MB). Free memory was 57.9MB in the beginning and 252.6MB in the end (delta: -194.6MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2022-11-02 21:04:55,626 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 94.4MB. Free memory was 66.8MB in the beginning and 66.8MB in the end (delta: 28.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:04:55,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 641.37ms. Allocated memory is still 94.4MB. Free memory was 57.7MB in the beginning and 51.0MB in the end (delta: 6.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 21:04:55,627 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.44ms. Allocated memory is still 94.4MB. Free memory was 51.0MB in the beginning and 46.4MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 21:04:55,627 INFO L158 Benchmark]: Boogie Preprocessor took 118.19ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 46.4MB in the beginning and 89.0MB in the end (delta: -42.6MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-11-02 21:04:55,627 INFO L158 Benchmark]: RCFGBuilder took 3489.78ms. Allocated memory is still 115.3MB. Free memory was 89.0MB in the beginning and 47.6MB in the end (delta: 41.4MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2022-11-02 21:04:55,628 INFO L158 Benchmark]: TraceAbstraction took 97503.53ms. Allocated memory was 115.3MB in the beginning and 352.3MB in the end (delta: 237.0MB). Free memory was 46.8MB in the beginning and 252.6MB in the end (delta: -205.7MB). Peak memory consumption was 211.9MB. Max. memory is 16.1GB. [2022-11-02 21:04:55,628 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 352.3MB. Free memory is still 252.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:04:55,630 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.28ms. Allocated memory is still 94.4MB. Free memory was 66.8MB in the beginning and 66.8MB in the end (delta: 28.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 641.37ms. Allocated memory is still 94.4MB. Free memory was 57.7MB in the beginning and 51.0MB in the end (delta: 6.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.44ms. Allocated memory is still 94.4MB. Free memory was 51.0MB in the beginning and 46.4MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.19ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 46.4MB in the beginning and 89.0MB in the end (delta: -42.6MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * RCFGBuilder took 3489.78ms. Allocated memory is still 115.3MB. Free memory was 89.0MB in the beginning and 47.6MB in the end (delta: 41.4MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * TraceAbstraction took 97503.53ms. Allocated memory was 115.3MB in the beginning and 352.3MB in the end (delta: 237.0MB). Free memory was 46.8MB in the beginning and 252.6MB in the end (delta: -205.7MB). Peak memory consumption was 211.9MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 352.3MB. Free memory is still 252.6MB. 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: 1665]: 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 1356. 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 ; [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 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->info_callback={0:1}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] EXPR s->version VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->version=-5, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->init_buf={0:1}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967355, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->s3={-8:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:1}, blastFlag=0, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1321] COND FALSE !(ret <= 0) [L1326] s->state = 4384 [L1327] s->init_num = 0 [L1328] EXPR s->bbio [L1328] EXPR s->wbio VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-12:0}, s={-12:0}, s->bbio={0:11}, s->wbio={0:-11}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1328] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967355, blastFlag=1, init=1, ret=13, s={-12:0}, s={-12:0}, s->s3={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:1}, blastFlag=1, init=1, ret=13, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND TRUE s->state == 4384 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(s->hit) [L1350] s->state = 4400 VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1352] s->init_num = 0 VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967355, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->s3={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:1}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND TRUE s->state == 4400 [L1356] EXPR s->s3 [L1356] EXPR (s->s3)->tmp.new_cipher [L1356] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:1}, ((s->s3)->tmp.new_cipher)->algorithms=4294967354, (s->s3)->tmp.new_cipher={-13:0}, blastFlag=2, init=1, ret=1, s={-12:0}, s={-12:0}, s->s3={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1356] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1359] ret = __VERIFIER_nondet_int() [L1360] COND TRUE blastFlag == 2 [L1361] blastFlag = 3 VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1369] COND FALSE !(ret <= 0) VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1375] s->state = 4416 [L1376] s->init_num = 0 VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967355, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, s->s3={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:1}, blastFlag=3, init=1, ret=18, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1393] COND FALSE !(! tmp___6) VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=4294967355, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->s3={-8:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1152] COND TRUE 1 VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state VAL [={0:1}, blastFlag=4, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 VAL [={0:1}, blastFlag=4, init=1, ret=0, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1665] reach_error() VAL [={0:1}, blastFlag=4, init=1, ret=0, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=0, tmp___1=1, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 97.3s, OverallIterations: 27, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 78.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33 mSolverCounterUnknown, 2438 SdHoareTripleChecker+Valid, 76.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2438 mSDsluCounter, 10164 SdHoareTripleChecker+Invalid, 74.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5840 mSDsCounter, 627 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4735 IncrementalHoareTripleChecker+Invalid, 5395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 627 mSolverCounterUnsat, 4324 mSDtfsCounter, 4735 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1074occurred in iteration=26, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 3345 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 2554 NumberOfCodeBlocks, 2554 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2416 ConstructedInterpolants, 0 QuantifiedInterpolants, 6030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 2491/2491 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 21:04:55,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/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_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/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_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/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_c42c4681-de1e-485a-8560-4ab6af759e75/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 253b2130a235408df8c2a581facc1d40316361da7beeb584c737673c98999cc2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:04:58,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:04:58,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:04:58,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:04:58,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:04:58,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:04:58,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:04:58,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:04:58,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:04:58,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:04:58,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:04:58,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:04:58,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:04:58,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:04:58,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:04:58,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:04:58,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:04:58,119 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:04:58,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:04:58,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:04:58,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:04:58,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:04:58,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:04:58,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:04:58,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:04:58,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:04:58,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:04:58,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:04:58,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:04:58,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:04:58,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:04:58,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:04:58,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:04:58,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:04:58,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:04:58,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:04:58,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:04:58,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:04:58,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:04:58,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:04:58,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:04:58,159 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-02 21:04:58,188 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:04:58,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:04:58,189 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:04:58,189 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:04:58,190 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:04:58,190 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:04:58,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:04:58,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:04:58,192 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:04:58,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:04:58,192 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:04:58,192 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:04:58,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:04:58,193 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:04:58,193 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:04:58,193 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:04:58,193 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 21:04:58,194 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 21:04:58,194 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 21:04:58,194 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:04:58,194 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:04:58,194 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:04:58,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:04:58,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:04:58,195 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:04:58,195 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:04:58,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:58,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:04:58,196 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:04:58,196 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:04:58,196 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 21:04:58,197 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 21:04:58,197 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:04:58,197 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:04:58,197 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:04:58,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 21:04:58,198 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_c42c4681-de1e-485a-8560-4ab6af759e75/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_c42c4681-de1e-485a-8560-4ab6af759e75/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 -> 253b2130a235408df8c2a581facc1d40316361da7beeb584c737673c98999cc2 [2022-11-02 21:04:58,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:04:58,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:04:58,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:04:58,598 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:04:58,599 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:04:58,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2022-11-02 21:04:58,662 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/data/6ffabe3fe/985c1d0874ad4357a8f5e46bb849f1a0/FLAG8c9960b34 [2022-11-02 21:04:59,315 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:04:59,316 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c [2022-11-02 21:04:59,359 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/data/6ffabe3fe/985c1d0874ad4357a8f5e46bb849f1a0/FLAG8c9960b34 [2022-11-02 21:04:59,563 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/data/6ffabe3fe/985c1d0874ad4357a8f5e46bb849f1a0 [2022-11-02 21:04:59,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:04:59,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:04:59,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:59,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:04:59,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:04:59,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:59" (1/1) ... [2022-11-02 21:04:59,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710c9a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:59, skipping insertion in model container [2022-11-02 21:04:59,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:59" (1/1) ... [2022-11-02 21:04:59,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:04:59,639 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:05:00,037 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_c42c4681-de1e-485a-8560-4ab6af759e75/sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-11-02 21:05:00,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:05:00,070 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-02 21:05:00,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:05:00,189 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_c42c4681-de1e-485a-8560-4ab6af759e75/sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-11-02 21:05:00,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:05:00,199 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:05:00,304 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_c42c4681-de1e-485a-8560-4ab6af759e75/sv-benchmarks/c/openssl/s3_clnt.blast.04.i.cil-1.c[65405,65418] [2022-11-02 21:05:00,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:05:00,324 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:05:00,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:00 WrapperNode [2022-11-02 21:05:00,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:05:00,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:05:00,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:05:00,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:05:00,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:00" (1/1) ... [2022-11-02 21:05:00,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:00" (1/1) ... [2022-11-02 21:05:00,401 INFO L138 Inliner]: procedures = 35, calls = 217, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 689 [2022-11-02 21:05:00,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:05:00,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:05:00,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:05:00,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:05:00,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:00" (1/1) ... [2022-11-02 21:05:00,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:00" (1/1) ... [2022-11-02 21:05:00,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:00" (1/1) ... [2022-11-02 21:05:00,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:00" (1/1) ... [2022-11-02 21:05:00,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:00" (1/1) ... [2022-11-02 21:05:00,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:00" (1/1) ... [2022-11-02 21:05:00,499 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:00" (1/1) ... [2022-11-02 21:05:00,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:00" (1/1) ... [2022-11-02 21:05:00,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:05:00,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:05:00,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:05:00,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:05:00,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:00" (1/1) ... [2022-11-02 21:05:00,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:05:00,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:00,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:05:00,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:05:00,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:05:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 21:05:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:05:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-02 21:05:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:05:00,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:05:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:05:00,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:05:00,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-02 21:05:00,850 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:05:00,853 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:05:00,870 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 21:05:10,338 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-11-02 21:05:10,338 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-11-02 21:05:10,338 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:05:10,346 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:05:10,347 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 21:05:10,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:10 BoogieIcfgContainer [2022-11-02 21:05:10,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:05:10,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:05:10,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:05:10,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:05:10,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:04:59" (1/3) ... [2022-11-02 21:05:10,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc0f266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:10, skipping insertion in model container [2022-11-02 21:05:10,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:00" (2/3) ... [2022-11-02 21:05:10,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc0f266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:10, skipping insertion in model container [2022-11-02 21:05:10,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:10" (3/3) ... [2022-11-02 21:05:10,359 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04.i.cil-1.c [2022-11-02 21:05:10,379 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:05:10,380 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:05:10,459 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:05:10,467 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;@39cda7f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:05:10,468 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:05:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 21:05:10,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:10,487 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 21:05:10,488 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:10,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2022-11-02 21:05:10,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:05:10,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018442819] [2022-11-02 21:05:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:10,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:05:10,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:05:10,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:05:10,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 21:05:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:11,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:05:11,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:11,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:05:11,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:05:11,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018442819] [2022-11-02 21:05:11,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018442819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:11,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:11,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:05:11,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631655339] [2022-11-02 21:05:11,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:11,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:11,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:05:11,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:11,739 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 0 states have call successors, (0), 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 21:05:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:11,862 INFO L93 Difference]: Finished difference Result 369 states and 623 transitions. [2022-11-02 21:05:11,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:11,866 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 21:05:11,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:11,879 INFO L225 Difference]: With dead ends: 369 [2022-11-02 21:05:11,879 INFO L226 Difference]: Without dead ends: 213 [2022-11-02 21:05:11,883 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 21:05:11,886 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 180 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 400 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 21:05:11,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 400 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:05:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-02 21:05:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-11-02 21:05:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4952830188679245) internal successors, (317), 212 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 317 transitions. [2022-11-02 21:05:11,965 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 317 transitions. Word has length 24 [2022-11-02 21:05:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:11,966 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 317 transitions. [2022-11-02 21:05:11,966 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 21:05:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 317 transitions. [2022-11-02 21:05:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:05:11,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:11,970 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 21:05:12,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-02 21:05:12,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:05:12,186 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:12,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:12,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1192110763, now seen corresponding path program 1 times [2022-11-02 21:05:12,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:05:12,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766075320] [2022-11-02 21:05:12,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:12,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:05:12,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:05:12,191 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:05:12,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 21:05:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:13,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:05:13,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:05:13,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:05:13,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:05:13,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766075320] [2022-11-02 21:05:13,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766075320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:13,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:13,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:05:13,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442013017] [2022-11-02 21:05:13,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:13,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:13,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:05:13,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:13,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:13,416 INFO L87 Difference]: Start difference. First operand 213 states and 317 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 21:05:15,451 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 21:05:15,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:15,596 INFO L93 Difference]: Finished difference Result 418 states and 628 transitions. [2022-11-02 21:05:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:15,597 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 21:05:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:15,600 INFO L225 Difference]: With dead ends: 418 [2022-11-02 21:05:15,600 INFO L226 Difference]: Without dead ends: 313 [2022-11-02 21:05:15,601 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 21:05:15,602 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 461 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 21:05:15,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 461 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 21:05:15,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-02 21:05:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-11-02 21:05:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4871794871794872) internal successors, (464), 312 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 464 transitions. [2022-11-02 21:05:15,630 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 464 transitions. Word has length 39 [2022-11-02 21:05:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:15,630 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 464 transitions. [2022-11-02 21:05:15,631 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 21:05:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 464 transitions. [2022-11-02 21:05:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-02 21:05:15,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:15,634 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 21:05:15,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:15,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:05:15,857 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:15,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:15,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1701754597, now seen corresponding path program 1 times [2022-11-02 21:05:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:05:15,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833409877] [2022-11-02 21:05:15,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:15,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:05:15,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:05:15,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:05:15,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 21:05:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:17,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:05:17,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:17,197 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 21:05:17,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:05:17,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:05:17,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833409877] [2022-11-02 21:05:17,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833409877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:17,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:17,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:05:17,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297912752] [2022-11-02 21:05:17,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:17,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:17,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:05:17,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:17,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:17,200 INFO L87 Difference]: Start difference. First operand 313 states and 464 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 21:05:19,227 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 21:05:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:19,332 INFO L93 Difference]: Finished difference Result 619 states and 923 transitions. [2022-11-02 21:05:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:19,333 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 21:05:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:19,341 INFO L225 Difference]: With dead ends: 619 [2022-11-02 21:05:19,341 INFO L226 Difference]: Without dead ends: 414 [2022-11-02 21:05:19,342 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 21:05:19,343 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 125 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:19,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 468 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 21:05:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-11-02 21:05:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-11-02 21:05:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.4842615012106537) internal successors, (613), 413 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2022-11-02 21:05:19,401 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 57 [2022-11-02 21:05:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:19,401 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2022-11-02 21:05:19,402 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 21:05:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2022-11-02 21:05:19,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 21:05:19,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:19,405 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 21:05:19,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:19,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:05:19,626 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:19,627 INFO L85 PathProgramCache]: Analyzing trace with hash -998738617, now seen corresponding path program 1 times [2022-11-02 21:05:19,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:05:19,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904720093] [2022-11-02 21:05:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:19,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:05:19,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:05:19,630 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:05:19,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-02 21:05:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:20,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:05:20,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:21,092 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 21:05:21,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:05:21,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 21:05:21,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904720093] [2022-11-02 21:05:21,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904720093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:21,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:21,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:05:21,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572721505] [2022-11-02 21:05:21,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:21,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:05:21,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 21:05:21,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:05:21,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:05:21,095 INFO L87 Difference]: Start difference. First operand 414 states and 613 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 21:05:23,122 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 21:05:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:23,213 INFO L93 Difference]: Finished difference Result 821 states and 1222 transitions. [2022-11-02 21:05:23,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:05:23,214 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 21:05:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:23,216 INFO L225 Difference]: With dead ends: 821 [2022-11-02 21:05:23,216 INFO L226 Difference]: Without dead ends: 515 [2022-11-02 21:05:23,217 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 21:05:23,218 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 126 mSDsluCounter, 156 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 21:05:23,219 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 21:05:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-11-02 21:05:23,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2022-11-02 21:05:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.482490272373541) internal successors, (762), 514 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:05:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 762 transitions. [2022-11-02 21:05:23,241 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 762 transitions. Word has length 77 [2022-11-02 21:05:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:23,242 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 762 transitions. [2022-11-02 21:05:23,242 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 21:05:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 762 transitions. [2022-11-02 21:05:23,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 21:05:23,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:23,246 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 21:05:23,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:05:23,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 21:05:23,470 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:23,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:23,470 INFO L85 PathProgramCache]: Analyzing trace with hash 465583256, now seen corresponding path program 1 times [2022-11-02 21:05:23,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 21:05:23,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032473437] [2022-11-02 21:05:23,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:23,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 21:05:23,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 21:05:23,473 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 21:05:23,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c42c4681-de1e-485a-8560-4ab6af759e75/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-02 21:05:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:25,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 21:05:25,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:27,455 INFO L356 Elim1Store]: treesize reduction 32, result has 78.5 percent of original size [2022-11-02 21:05:27,457 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 21:05:48,402 WARN L234 SmtUtils]: Spent 20.83s 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 21:05:48,403 INFO L356 Elim1Store]: treesize reduction 1374, result has 25.4 percent of original size [2022-11-02 21:05:48,404 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 4790 treesize of output 4750 [2022-11-02 21:05:48,521 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 4345 treesize of output 3031 [2022-11-02 21:05:50,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:50,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2460 treesize of output 1702 [2022-11-02 21:05:50,966 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:05:50,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 962 treesize of output 883 [2022-11-02 21:05:51,811 INFO L244 Elim1Store]: Index analysis took 483 ms [2022-11-02 21:05:52,664 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 21:05:54,022 INFO L244 Elim1Store]: Index analysis took 478 ms [2022-11-02 21:05:55,084 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 21:05:55,897 INFO L244 Elim1Store]: Index analysis took 347 ms [2022-11-02 21:05:56,693 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 21:05:57,205 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 383 treesize of output 323 [2022-11-02 21:05:57,635 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 143 treesize of output 123 [2022-11-02 21:05:58,239 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 135 treesize of output 115