./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/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_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/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_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/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 f559dc59bc463f9a27da280f1f7098996cb99e14cb280bd541f8697a124cb729 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:49:31,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:49:31,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:49:31,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:49:31,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:49:31,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:49:31,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:49:31,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:49:31,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:49:31,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:49:31,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:49:31,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:49:31,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:49:31,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:49:31,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:49:31,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:49:31,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:49:31,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:49:31,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:49:31,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:49:31,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:49:31,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:49:31,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:49:31,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:49:31,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:49:31,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:49:31,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:49:31,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:49:31,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:49:31,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:49:31,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:49:31,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:49:31,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:49:31,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:49:31,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:49:31,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:49:31,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:49:31,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:49:31,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:49:31,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:49:31,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:49:31,510 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:49:31,535 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:49:31,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:49:31,536 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:49:31,536 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:49:31,537 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:49:31,537 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:49:31,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:49:31,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:49:31,538 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:49:31,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:49:31,539 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:49:31,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:49:31,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:49:31,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:49:31,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:49:31,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:49:31,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:49:31,540 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:49:31,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:49:31,541 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:49:31,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:49:31,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:49:31,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:49:31,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:49:31,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:49:31,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:49:31,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:49:31,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:49:31,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:49:31,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:49:31,543 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:49:31,544 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:49:31,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:49:31,544 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_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/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_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/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 -> f559dc59bc463f9a27da280f1f7098996cb99e14cb280bd541f8697a124cb729 [2022-11-02 20:49:31,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:49:31,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:49:31,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:49:31,935 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:49:31,937 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:49:31,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2022-11-02 20:49:32,022 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/data/0b17471b2/c0b3329ca5b346e4a80bf92c249232f4/FLAG6506eb463 [2022-11-02 20:49:32,642 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:49:32,642 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2022-11-02 20:49:32,667 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/data/0b17471b2/c0b3329ca5b346e4a80bf92c249232f4/FLAG6506eb463 [2022-11-02 20:49:32,923 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/data/0b17471b2/c0b3329ca5b346e4a80bf92c249232f4 [2022-11-02 20:49:32,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:49:32,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:49:32,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:49:32,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:49:32,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:49:32,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:49:32" (1/1) ... [2022-11-02 20:49:32,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a81270c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:32, skipping insertion in model container [2022-11-02 20:49:32,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:49:32" (1/1) ... [2022-11-02 20:49:32,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:49:32,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:49:33,314 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_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c[42875,42888] [2022-11-02 20:49:33,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:49:33,331 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:49:33,382 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_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c[42875,42888] [2022-11-02 20:49:33,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:49:33,409 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:49:33,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:33 WrapperNode [2022-11-02 20:49:33,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:49:33,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:49:33,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:49:33,413 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:49:33,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:33" (1/1) ... [2022-11-02 20:49:33,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:33" (1/1) ... [2022-11-02 20:49:33,490 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 546 [2022-11-02 20:49:33,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:49:33,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:49:33,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:49:33,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:49:33,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:33" (1/1) ... [2022-11-02 20:49:33,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:33" (1/1) ... [2022-11-02 20:49:33,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:33" (1/1) ... [2022-11-02 20:49:33,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:33" (1/1) ... [2022-11-02 20:49:33,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:33" (1/1) ... [2022-11-02 20:49:33,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:33" (1/1) ... [2022-11-02 20:49:33,530 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:33" (1/1) ... [2022-11-02 20:49:33,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:33" (1/1) ... [2022-11-02 20:49:33,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:49:33,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:49:33,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:49:33,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:49:33,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:33" (1/1) ... [2022-11-02 20:49:33,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:49:33,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:33,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:49:33,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:49:33,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:49:33,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:49:33,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:49:33,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:49:33,758 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:49:33,761 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:49:33,788 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-02 20:49:34,478 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-11-02 20:49:34,486 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-11-02 20:49:34,486 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:49:34,494 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:49:34,496 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:49:34,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:34 BoogieIcfgContainer [2022-11-02 20:49:34,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:49:34,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:49:34,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:49:34,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:49:34,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:49:32" (1/3) ... [2022-11-02 20:49:34,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd7185b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:34, skipping insertion in model container [2022-11-02 20:49:34,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:33" (2/3) ... [2022-11-02 20:49:34,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd7185b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:34, skipping insertion in model container [2022-11-02 20:49:34,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:34" (3/3) ... [2022-11-02 20:49:34,516 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2022-11-02 20:49:34,533 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:49:34,533 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:49:34,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:49:34,624 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;@215edf4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:49:34,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:49:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:49:34,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:34,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:34,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:34,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:34,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2022-11-02 20:49:34,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:34,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294547289] [2022-11-02 20:49:34,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:34,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:35,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:35,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294547289] [2022-11-02 20:49:35,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294547289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:35,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:35,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:35,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585256613] [2022-11-02 20:49:35,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:35,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:35,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:35,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:35,181 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 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 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:35,455 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2022-11-02 20:49:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:35,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-02 20:49:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:35,475 INFO L225 Difference]: With dead ends: 328 [2022-11-02 20:49:35,475 INFO L226 Difference]: Without dead ends: 175 [2022-11-02 20:49:35,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:35,488 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 170 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:35,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 190 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:35,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-02 20:49:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2022-11-02 20:49:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 169 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2022-11-02 20:49:35,557 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2022-11-02 20:49:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:35,558 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2022-11-02 20:49:35,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:35,558 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2022-11-02 20:49:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:49:35,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:35,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:35,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:49:35,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:35,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:35,579 INFO L85 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2022-11-02 20:49:35,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:35,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135919612] [2022-11-02 20:49:35,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:35,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:35,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135919612] [2022-11-02 20:49:35,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135919612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:35,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:35,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:35,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456946049] [2022-11-02 20:49:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:35,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:35,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:35,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:35,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:35,856 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:36,070 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2022-11-02 20:49:36,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:36,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-02 20:49:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:36,075 INFO L225 Difference]: With dead ends: 380 [2022-11-02 20:49:36,075 INFO L226 Difference]: Without dead ends: 216 [2022-11-02 20:49:36,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:36,085 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 129 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:36,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 142 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:36,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-02 20:49:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2022-11-02 20:49:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2022-11-02 20:49:36,118 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2022-11-02 20:49:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:36,120 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2022-11-02 20:49:36,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:36,126 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2022-11-02 20:49:36,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-02 20:49:36,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:36,132 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:36,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:49:36,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:36,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1754997851, now seen corresponding path program 1 times [2022-11-02 20:49:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:36,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508922219] [2022-11-02 20:49:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:36,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:36,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508922219] [2022-11-02 20:49:36,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508922219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:36,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:36,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:36,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948702957] [2022-11-02 20:49:36,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:36,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:36,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:36,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:36,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:36,337 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:36,543 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2022-11-02 20:49:36,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:36,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 20:49:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:36,546 INFO L225 Difference]: With dead ends: 445 [2022-11-02 20:49:36,546 INFO L226 Difference]: Without dead ends: 242 [2022-11-02 20:49:36,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:36,556 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:36,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 155 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:36,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-02 20:49:36,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-11-02 20:49:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2022-11-02 20:49:36,589 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2022-11-02 20:49:36,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:36,589 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2022-11-02 20:49:36,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2022-11-02 20:49:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-02 20:49:36,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:36,593 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:36,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:49:36,593 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:36,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash -479038981, now seen corresponding path program 1 times [2022-11-02 20:49:36,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:36,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513988951] [2022-11-02 20:49:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:36,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 20:49:36,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:36,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513988951] [2022-11-02 20:49:36,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513988951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:36,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:36,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:36,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714470116] [2022-11-02 20:49:36,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:36,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:36,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:36,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:36,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:36,766 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:36,900 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2022-11-02 20:49:36,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:36,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 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 84 [2022-11-02 20:49:36,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:36,904 INFO L225 Difference]: With dead ends: 493 [2022-11-02 20:49:36,904 INFO L226 Difference]: Without dead ends: 259 [2022-11-02 20:49:36,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:36,912 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 158 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:36,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 150 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-02 20:49:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-11-02 20:49:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2022-11-02 20:49:36,955 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2022-11-02 20:49:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:36,955 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2022-11-02 20:49:36,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2022-11-02 20:49:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-02 20:49:36,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:36,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:36,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:49:36,958 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:36,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1816808322, now seen corresponding path program 1 times [2022-11-02 20:49:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:36,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504214219] [2022-11-02 20:49:36,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:36,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:37,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:37,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504214219] [2022-11-02 20:49:37,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504214219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:37,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:37,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:37,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378931586] [2022-11-02 20:49:37,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:37,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:37,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:37,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:37,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:37,127 INFO L87 Difference]: Start difference. First operand 257 states and 431 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 20:49:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:37,311 INFO L93 Difference]: Finished difference Result 553 states and 933 transitions. [2022-11-02 20:49:37,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:37,311 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 84 [2022-11-02 20:49:37,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:37,316 INFO L225 Difference]: With dead ends: 553 [2022-11-02 20:49:37,317 INFO L226 Difference]: Without dead ends: 304 [2022-11-02 20:49:37,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:37,318 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 133 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:37,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 147 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-02 20:49:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2022-11-02 20:49:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6946308724832215) internal successors, (505), 298 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2022-11-02 20:49:37,339 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2022-11-02 20:49:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:37,340 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2022-11-02 20:49:37,340 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 20:49:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2022-11-02 20:49:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-02 20:49:37,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:37,349 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:37,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:49:37,350 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:37,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:37,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1697148062, now seen corresponding path program 1 times [2022-11-02 20:49:37,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:37,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804619564] [2022-11-02 20:49:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:37,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 20:49:37,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:37,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804619564] [2022-11-02 20:49:37,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804619564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:37,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:37,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:37,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555811891] [2022-11-02 20:49:37,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:37,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:37,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:37,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:37,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:37,481 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:37,657 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2022-11-02 20:49:37,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:37,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 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 85 [2022-11-02 20:49:37,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:37,659 INFO L225 Difference]: With dead ends: 592 [2022-11-02 20:49:37,659 INFO L226 Difference]: Without dead ends: 301 [2022-11-02 20:49:37,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:37,660 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 157 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:37,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 138 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-02 20:49:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2022-11-02 20:49:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 298 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2022-11-02 20:49:37,675 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2022-11-02 20:49:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:37,676 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2022-11-02 20:49:37,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2022-11-02 20:49:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-02 20:49:37,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:37,677 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:37,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:49:37,678 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:37,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1432172412, now seen corresponding path program 1 times [2022-11-02 20:49:37,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:37,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076685164] [2022-11-02 20:49:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:37,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:37,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:37,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076685164] [2022-11-02 20:49:37,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076685164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:37,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:37,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:37,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918660368] [2022-11-02 20:49:37,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:37,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:37,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:37,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:37,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:37,771 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:37,946 INFO L93 Difference]: Finished difference Result 595 states and 997 transitions. [2022-11-02 20:49:37,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:37,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-11-02 20:49:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:37,949 INFO L225 Difference]: With dead ends: 595 [2022-11-02 20:49:37,949 INFO L226 Difference]: Without dead ends: 302 [2022-11-02 20:49:37,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:37,952 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 130 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:37,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 145 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-02 20:49:37,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2022-11-02 20:49:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.6756756756756757) internal successors, (496), 296 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2022-11-02 20:49:37,971 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2022-11-02 20:49:37,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:37,971 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2022-11-02 20:49:37,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2022-11-02 20:49:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-02 20:49:37,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:37,973 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:37,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:49:37,973 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:37,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:37,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1085183485, now seen corresponding path program 1 times [2022-11-02 20:49:37,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:37,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899979651] [2022-11-02 20:49:37,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-02 20:49:38,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:38,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899979651] [2022-11-02 20:49:38,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899979651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:38,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:38,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:38,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847117853] [2022-11-02 20:49:38,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:38,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:38,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:38,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:38,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:38,099 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:38,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:38,222 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2022-11-02 20:49:38,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:38,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-11-02 20:49:38,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:38,224 INFO L225 Difference]: With dead ends: 595 [2022-11-02 20:49:38,224 INFO L226 Difference]: Without dead ends: 306 [2022-11-02 20:49:38,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:38,225 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 162 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:38,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 149 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-02 20:49:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-11-02 20:49:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.6459016393442623) internal successors, (502), 305 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2022-11-02 20:49:38,241 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2022-11-02 20:49:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:38,242 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2022-11-02 20:49:38,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2022-11-02 20:49:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 20:49:38,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:38,243 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:38,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:49:38,244 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:38,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash -860132162, now seen corresponding path program 1 times [2022-11-02 20:49:38,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:38,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955895555] [2022-11-02 20:49:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:38,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:38,328 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 20:49:38,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:38,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955895555] [2022-11-02 20:49:38,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955895555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:38,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:38,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:38,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203548087] [2022-11-02 20:49:38,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:38,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:38,331 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:38,503 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2022-11-02 20:49:38,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:38,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-11-02 20:49:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:38,508 INFO L225 Difference]: With dead ends: 635 [2022-11-02 20:49:38,508 INFO L226 Difference]: Without dead ends: 337 [2022-11-02 20:49:38,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:38,511 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 141 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:38,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 141 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:38,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-11-02 20:49:38,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-11-02 20:49:38,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6437125748502994) internal successors, (549), 334 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2022-11-02 20:49:38,532 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2022-11-02 20:49:38,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:38,532 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2022-11-02 20:49:38,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2022-11-02 20:49:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-02 20:49:38,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:38,538 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:38,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:49:38,539 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:38,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:38,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1120928325, now seen corresponding path program 1 times [2022-11-02 20:49:38,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:38,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325211797] [2022-11-02 20:49:38,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 20:49:38,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:38,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325211797] [2022-11-02 20:49:38,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325211797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:38,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:38,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:38,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739131293] [2022-11-02 20:49:38,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:38,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:38,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:38,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:38,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:38,661 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:38,818 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2022-11-02 20:49:38,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:38,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-11-02 20:49:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:38,820 INFO L225 Difference]: With dead ends: 664 [2022-11-02 20:49:38,820 INFO L226 Difference]: Without dead ends: 337 [2022-11-02 20:49:38,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:38,822 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:38,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 141 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-11-02 20:49:38,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-11-02 20:49:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6317365269461077) internal successors, (545), 334 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2022-11-02 20:49:38,839 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2022-11-02 20:49:38,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:38,839 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2022-11-02 20:49:38,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2022-11-02 20:49:38,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:49:38,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:38,841 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:38,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:49:38,841 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:38,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1084775058, now seen corresponding path program 1 times [2022-11-02 20:49:38,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:38,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105625881] [2022-11-02 20:49:38,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:38,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 20:49:38,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:38,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105625881] [2022-11-02 20:49:38,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105625881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:38,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:38,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:38,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301591695] [2022-11-02 20:49:38,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:38,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:38,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:38,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:38,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:38,942 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:39,134 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2022-11-02 20:49:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:39,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-11-02 20:49:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:39,137 INFO L225 Difference]: With dead ends: 697 [2022-11-02 20:49:39,137 INFO L226 Difference]: Without dead ends: 370 [2022-11-02 20:49:39,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:39,139 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:39,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 149 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-02 20:49:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2022-11-02 20:49:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.626038781163435) internal successors, (587), 361 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2022-11-02 20:49:39,169 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2022-11-02 20:49:39,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:39,169 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2022-11-02 20:49:39,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2022-11-02 20:49:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 20:49:39,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:39,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:39,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:49:39,172 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:39,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:39,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1691577195, now seen corresponding path program 1 times [2022-11-02 20:49:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:39,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624719828] [2022-11-02 20:49:39,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:39,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 20:49:39,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:39,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624719828] [2022-11-02 20:49:39,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624719828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:39,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:39,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:39,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871405183] [2022-11-02 20:49:39,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:39,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:39,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:39,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:39,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:39,290 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:39,476 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2022-11-02 20:49:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:39,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-11-02 20:49:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:39,478 INFO L225 Difference]: With dead ends: 724 [2022-11-02 20:49:39,478 INFO L226 Difference]: Without dead ends: 370 [2022-11-02 20:49:39,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:39,480 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:39,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 149 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-02 20:49:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2022-11-02 20:49:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6121883656509695) internal successors, (582), 361 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2022-11-02 20:49:39,502 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2022-11-02 20:49:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:39,503 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2022-11-02 20:49:39,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2022-11-02 20:49:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-02 20:49:39,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:39,505 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:39,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:49:39,505 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:39,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:39,505 INFO L85 PathProgramCache]: Analyzing trace with hash -479008336, now seen corresponding path program 1 times [2022-11-02 20:49:39,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:39,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509676116] [2022-11-02 20:49:39,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-02 20:49:39,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:39,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509676116] [2022-11-02 20:49:39,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509676116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:39,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:39,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:39,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387340316] [2022-11-02 20:49:39,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:39,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:39,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:39,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:39,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:39,618 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:39,773 INFO L93 Difference]: Finished difference Result 741 states and 1193 transitions. [2022-11-02 20:49:39,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:39,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-11-02 20:49:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:39,776 INFO L225 Difference]: With dead ends: 741 [2022-11-02 20:49:39,776 INFO L226 Difference]: Without dead ends: 387 [2022-11-02 20:49:39,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:39,778 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 149 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:39,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 144 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:39,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-11-02 20:49:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2022-11-02 20:49:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 382 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2022-11-02 20:49:39,805 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2022-11-02 20:49:39,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:39,806 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2022-11-02 20:49:39,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2022-11-02 20:49:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-02 20:49:39,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:39,808 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:39,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:49:39,808 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:39,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2118869193, now seen corresponding path program 1 times [2022-11-02 20:49:39,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:39,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417052781] [2022-11-02 20:49:39,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:39,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-02 20:49:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:39,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417052781] [2022-11-02 20:49:39,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417052781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:39,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:39,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:39,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358198913] [2022-11-02 20:49:39,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:39,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:39,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:39,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:39,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:39,932 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:40,076 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2022-11-02 20:49:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:40,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-11-02 20:49:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:40,078 INFO L225 Difference]: With dead ends: 762 [2022-11-02 20:49:40,078 INFO L226 Difference]: Without dead ends: 387 [2022-11-02 20:49:40,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:40,080 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:40,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 144 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-11-02 20:49:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2022-11-02 20:49:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5837696335078535) internal successors, (605), 382 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2022-11-02 20:49:40,106 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2022-11-02 20:49:40,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:40,107 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2022-11-02 20:49:40,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2022-11-02 20:49:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-02 20:49:40,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:40,109 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:40,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:49:40,109 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:40,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:40,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1932137040, now seen corresponding path program 1 times [2022-11-02 20:49:40,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:40,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142343213] [2022-11-02 20:49:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:40,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:49:40,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:40,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142343213] [2022-11-02 20:49:40,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142343213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:40,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:40,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275968230] [2022-11-02 20:49:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:40,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:40,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:40,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:40,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:40,200 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:40,278 INFO L93 Difference]: Finished difference Result 1131 states and 1790 transitions. [2022-11-02 20:49:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-11-02 20:49:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:40,282 INFO L225 Difference]: With dead ends: 1131 [2022-11-02 20:49:40,282 INFO L226 Difference]: Without dead ends: 756 [2022-11-02 20:49:40,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:40,284 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 137 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:40,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 543 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:49:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-11-02 20:49:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2022-11-02 20:49:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.5788079470198675) internal successors, (1192), 755 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1192 transitions. [2022-11-02 20:49:40,339 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1192 transitions. Word has length 121 [2022-11-02 20:49:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:40,340 INFO L495 AbstractCegarLoop]: Abstraction has 756 states and 1192 transitions. [2022-11-02 20:49:40,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1192 transitions. [2022-11-02 20:49:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-02 20:49:40,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:40,342 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:40,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:49:40,343 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1552830339, now seen corresponding path program 1 times [2022-11-02 20:49:40,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:40,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993263496] [2022-11-02 20:49:40,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:49:40,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:40,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993263496] [2022-11-02 20:49:40,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993263496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:40,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:40,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:40,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314593578] [2022-11-02 20:49:40,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:40,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:40,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:40,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:40,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:40,402 INFO L87 Difference]: Start difference. First operand 756 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:40,484 INFO L93 Difference]: Finished difference Result 1832 states and 2893 transitions. [2022-11-02 20:49:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:40,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 122 [2022-11-02 20:49:40,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:40,489 INFO L225 Difference]: With dead ends: 1832 [2022-11-02 20:49:40,490 INFO L226 Difference]: Without dead ends: 1084 [2022-11-02 20:49:40,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:40,491 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 134 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:40,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 543 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:49:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2022-11-02 20:49:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2022-11-02 20:49:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 1.5780240073868883) internal successors, (1709), 1083 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1709 transitions. [2022-11-02 20:49:40,574 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1709 transitions. Word has length 122 [2022-11-02 20:49:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:40,574 INFO L495 AbstractCegarLoop]: Abstraction has 1084 states and 1709 transitions. [2022-11-02 20:49:40,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1709 transitions. [2022-11-02 20:49:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-02 20:49:40,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:40,577 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:40,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:49:40,577 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:40,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:40,578 INFO L85 PathProgramCache]: Analyzing trace with hash 323652479, now seen corresponding path program 1 times [2022-11-02 20:49:40,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:40,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615268292] [2022-11-02 20:49:40,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:40,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-02 20:49:40,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:40,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615268292] [2022-11-02 20:49:40,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615268292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:40,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:40,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676957191] [2022-11-02 20:49:40,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:40,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:40,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:40,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:40,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:40,627 INFO L87 Difference]: Start difference. First operand 1084 states and 1709 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:40,730 INFO L93 Difference]: Finished difference Result 2529 states and 3993 transitions. [2022-11-02 20:49:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:40,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 122 [2022-11-02 20:49:40,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:40,736 INFO L225 Difference]: With dead ends: 2529 [2022-11-02 20:49:40,736 INFO L226 Difference]: Without dead ends: 1453 [2022-11-02 20:49:40,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:40,739 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 155 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:40,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 546 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:49:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-11-02 20:49:40,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2022-11-02 20:49:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1452 states have (on average 1.5778236914600552) internal successors, (2291), 1452 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2291 transitions. [2022-11-02 20:49:40,863 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2291 transitions. Word has length 122 [2022-11-02 20:49:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:40,863 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 2291 transitions. [2022-11-02 20:49:40,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2291 transitions. [2022-11-02 20:49:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-02 20:49:40,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:40,868 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:40,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:49:40,868 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:40,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:40,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1712946493, now seen corresponding path program 1 times [2022-11-02 20:49:40,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:40,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365816823] [2022-11-02 20:49:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:40,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-02 20:49:40,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:40,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365816823] [2022-11-02 20:49:40,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365816823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:40,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:40,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:40,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690700283] [2022-11-02 20:49:40,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:40,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:40,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:40,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:40,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:40,929 INFO L87 Difference]: Start difference. First operand 1453 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:41,057 INFO L93 Difference]: Finished difference Result 3249 states and 5126 transitions. [2022-11-02 20:49:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:41,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 122 [2022-11-02 20:49:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:41,064 INFO L225 Difference]: With dead ends: 3249 [2022-11-02 20:49:41,064 INFO L226 Difference]: Without dead ends: 1804 [2022-11-02 20:49:41,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:41,067 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 170 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:41,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 388 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:49:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2022-11-02 20:49:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2022-11-02 20:49:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.5762617859123682) internal successors, (2842), 1803 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2842 transitions. [2022-11-02 20:49:41,205 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2842 transitions. Word has length 122 [2022-11-02 20:49:41,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:41,205 INFO L495 AbstractCegarLoop]: Abstraction has 1804 states and 2842 transitions. [2022-11-02 20:49:41,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2842 transitions. [2022-11-02 20:49:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-11-02 20:49:41,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:41,212 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:41,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:49:41,212 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:41,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1532697181, now seen corresponding path program 1 times [2022-11-02 20:49:41,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:41,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99354917] [2022-11-02 20:49:41,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-02 20:49:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:41,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99354917] [2022-11-02 20:49:41,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99354917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:41,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:41,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:41,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624294207] [2022-11-02 20:49:41,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:41,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:41,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:41,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:41,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:41,305 INFO L87 Difference]: Start difference. First operand 1804 states and 2842 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:41,580 INFO L93 Difference]: Finished difference Result 3650 states and 5732 transitions. [2022-11-02 20:49:41,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:41,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 199 [2022-11-02 20:49:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:41,588 INFO L225 Difference]: With dead ends: 3650 [2022-11-02 20:49:41,588 INFO L226 Difference]: Without dead ends: 1854 [2022-11-02 20:49:41,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:41,592 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:41,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 297 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2022-11-02 20:49:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1804. [2022-11-02 20:49:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.5363283416528009) internal successors, (2770), 1803 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2770 transitions. [2022-11-02 20:49:41,730 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2770 transitions. Word has length 199 [2022-11-02 20:49:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:41,731 INFO L495 AbstractCegarLoop]: Abstraction has 1804 states and 2770 transitions. [2022-11-02 20:49:41,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2770 transitions. [2022-11-02 20:49:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-11-02 20:49:41,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:41,737 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:41,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:49:41,737 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:41,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash -995291011, now seen corresponding path program 1 times [2022-11-02 20:49:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:41,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5889009] [2022-11-02 20:49:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:41,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-11-02 20:49:41,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:41,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5889009] [2022-11-02 20:49:41,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5889009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:41,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:41,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24471650] [2022-11-02 20:49:41,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:41,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:41,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:41,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:41,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:41,836 INFO L87 Difference]: Start difference. First operand 1804 states and 2770 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:42,127 INFO L93 Difference]: Finished difference Result 3667 states and 5605 transitions. [2022-11-02 20:49:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:42,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2022-11-02 20:49:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:42,135 INFO L225 Difference]: With dead ends: 3667 [2022-11-02 20:49:42,135 INFO L226 Difference]: Without dead ends: 1871 [2022-11-02 20:49:42,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:42,138 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:42,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 163 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2022-11-02 20:49:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1804. [2022-11-02 20:49:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.4941763727121464) internal successors, (2694), 1803 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2694 transitions. [2022-11-02 20:49:42,275 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2694 transitions. Word has length 213 [2022-11-02 20:49:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:42,276 INFO L495 AbstractCegarLoop]: Abstraction has 1804 states and 2694 transitions. [2022-11-02 20:49:42,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2694 transitions. [2022-11-02 20:49:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-11-02 20:49:42,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:42,284 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:42,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:49:42,284 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:42,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:42,285 INFO L85 PathProgramCache]: Analyzing trace with hash -344869126, now seen corresponding path program 1 times [2022-11-02 20:49:42,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:42,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607268938] [2022-11-02 20:49:42,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:42,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-02 20:49:42,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:42,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607268938] [2022-11-02 20:49:42,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607268938] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:42,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464067489] [2022-11-02 20:49:42,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:42,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:42,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:42,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:42,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:49:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:42,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:49:42,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-02 20:49:42,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-02 20:49:42,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464067489] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:42,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:42,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:49:42,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864651673] [2022-11-02 20:49:42,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:42,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:49:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:42,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:49:42,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:42,954 INFO L87 Difference]: Start difference. First operand 1804 states and 2694 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:43,457 INFO L93 Difference]: Finished difference Result 4265 states and 6321 transitions. [2022-11-02 20:49:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:49:43,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 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 232 [2022-11-02 20:49:43,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:43,467 INFO L225 Difference]: With dead ends: 4265 [2022-11-02 20:49:43,467 INFO L226 Difference]: Without dead ends: 2436 [2022-11-02 20:49:43,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:49:43,470 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 486 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:43,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 448 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:49:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2022-11-02 20:49:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1604. [2022-11-02 20:49:43,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 1.470991890205864) internal successors, (2358), 1603 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2358 transitions. [2022-11-02 20:49:43,585 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2358 transitions. Word has length 232 [2022-11-02 20:49:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:43,585 INFO L495 AbstractCegarLoop]: Abstraction has 1604 states and 2358 transitions. [2022-11-02 20:49:43,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2358 transitions. [2022-11-02 20:49:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-11-02 20:49:43,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:43,591 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:43,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:43,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:43,806 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:43,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:43,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1731638989, now seen corresponding path program 1 times [2022-11-02 20:49:43,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:43,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308706523] [2022-11-02 20:49:43,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:43,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-11-02 20:49:43,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:43,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308706523] [2022-11-02 20:49:43,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308706523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:43,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:43,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:43,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154105440] [2022-11-02 20:49:43,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:43,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:43,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:43,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:43,915 INFO L87 Difference]: Start difference. First operand 1604 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:44,173 INFO L93 Difference]: Finished difference Result 3395 states and 5009 transitions. [2022-11-02 20:49:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:44,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2022-11-02 20:49:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:44,179 INFO L225 Difference]: With dead ends: 3395 [2022-11-02 20:49:44,179 INFO L226 Difference]: Without dead ends: 1679 [2022-11-02 20:49:44,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:44,183 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 46 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:44,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 270 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:44,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2022-11-02 20:49:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2022-11-02 20:49:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1678 states have (on average 1.4439809296781883) internal successors, (2423), 1678 states have internal predecessors, (2423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2423 transitions. [2022-11-02 20:49:44,294 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2423 transitions. Word has length 241 [2022-11-02 20:49:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:44,295 INFO L495 AbstractCegarLoop]: Abstraction has 1679 states and 2423 transitions. [2022-11-02 20:49:44,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2423 transitions. [2022-11-02 20:49:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-11-02 20:49:44,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:44,302 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:44,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:49:44,302 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:44,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:44,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1272517136, now seen corresponding path program 1 times [2022-11-02 20:49:44,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:44,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444022970] [2022-11-02 20:49:44,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:44,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-11-02 20:49:44,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:44,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444022970] [2022-11-02 20:49:44,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444022970] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:44,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137547792] [2022-11-02 20:49:44,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:44,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:44,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:44,422 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:44,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:49:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:44,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:49:44,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-11-02 20:49:44,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-11-02 20:49:44,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137547792] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:44,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:44,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:49:44,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894968184] [2022-11-02 20:49:44,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:44,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:49:44,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:44,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:49:44,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:44,776 INFO L87 Difference]: Start difference. First operand 1679 states and 2423 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:45,772 INFO L93 Difference]: Finished difference Result 7700 states and 11238 transitions. [2022-11-02 20:49:45,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:49:45,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-11-02 20:49:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:45,791 INFO L225 Difference]: With dead ends: 7700 [2022-11-02 20:49:45,791 INFO L226 Difference]: Without dead ends: 6029 [2022-11-02 20:49:45,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:49:45,798 INFO L413 NwaCegarLoop]: 540 mSDtfsCounter, 438 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:45,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1186 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:49:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2022-11-02 20:49:45,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 2357. [2022-11-02 20:49:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2356 states have (on average 1.3247028862478778) internal successors, (3121), 2356 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3121 transitions. [2022-11-02 20:49:45,996 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3121 transitions. Word has length 253 [2022-11-02 20:49:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:45,996 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 3121 transitions. [2022-11-02 20:49:46,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3121 transitions. [2022-11-02 20:49:46,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-11-02 20:49:46,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:46,009 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:46,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:46,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:46,223 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:46,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:46,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1561336526, now seen corresponding path program 1 times [2022-11-02 20:49:46,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:46,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242667859] [2022-11-02 20:49:46,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:46,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-11-02 20:49:46,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:46,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242667859] [2022-11-02 20:49:46,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242667859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:46,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:46,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:46,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531339447] [2022-11-02 20:49:46,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:46,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:46,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:46,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:46,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:46,305 INFO L87 Difference]: Start difference. First operand 2357 states and 3121 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:46,595 INFO L93 Difference]: Finished difference Result 6533 states and 8644 transitions. [2022-11-02 20:49:46,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:46,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-11-02 20:49:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:46,616 INFO L225 Difference]: With dead ends: 6533 [2022-11-02 20:49:46,621 INFO L226 Difference]: Without dead ends: 4184 [2022-11-02 20:49:46,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:46,626 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 120 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:46,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 514 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:49:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2022-11-02 20:49:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 4182. [2022-11-02 20:49:46,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4182 states, 4181 states have (on average 1.3207366658694093) internal successors, (5522), 4181 states have internal predecessors, (5522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 5522 transitions. [2022-11-02 20:49:46,918 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 5522 transitions. Word has length 253 [2022-11-02 20:49:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:46,919 INFO L495 AbstractCegarLoop]: Abstraction has 4182 states and 5522 transitions. [2022-11-02 20:49:46,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 5522 transitions. [2022-11-02 20:49:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-11-02 20:49:46,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:46,927 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:46,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:49:46,928 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:46,929 INFO L85 PathProgramCache]: Analyzing trace with hash -914284920, now seen corresponding path program 1 times [2022-11-02 20:49:46,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:46,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568248148] [2022-11-02 20:49:46,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:46,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-11-02 20:49:47,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:47,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568248148] [2022-11-02 20:49:47,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568248148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:47,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:47,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:47,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690068483] [2022-11-02 20:49:47,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:47,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:47,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:47,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:47,041 INFO L87 Difference]: Start difference. First operand 4182 states and 5522 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:47,418 INFO L93 Difference]: Finished difference Result 8584 states and 11340 transitions. [2022-11-02 20:49:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:47,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 256 [2022-11-02 20:49:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:47,440 INFO L225 Difference]: With dead ends: 8584 [2022-11-02 20:49:47,440 INFO L226 Difference]: Without dead ends: 4410 [2022-11-02 20:49:47,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:47,446 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 137 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:47,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 166 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:47,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states. [2022-11-02 20:49:47,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4182. [2022-11-02 20:49:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4182 states, 4181 states have (on average 1.3035159052858167) internal successors, (5450), 4181 states have internal predecessors, (5450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 5450 transitions. [2022-11-02 20:49:47,751 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 5450 transitions. Word has length 256 [2022-11-02 20:49:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:47,751 INFO L495 AbstractCegarLoop]: Abstraction has 4182 states and 5450 transitions. [2022-11-02 20:49:47,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 5450 transitions. [2022-11-02 20:49:47,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2022-11-02 20:49:47,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:47,763 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:47,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:49:47,764 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:47,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:47,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1357789354, now seen corresponding path program 1 times [2022-11-02 20:49:47,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:47,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341429816] [2022-11-02 20:49:47,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:47,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-11-02 20:49:47,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:47,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341429816] [2022-11-02 20:49:47,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341429816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:47,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:47,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:47,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434092267] [2022-11-02 20:49:47,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:47,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:47,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:47,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:47,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:47,847 INFO L87 Difference]: Start difference. First operand 4182 states and 5450 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:48,234 INFO L93 Difference]: Finished difference Result 8488 states and 11054 transitions. [2022-11-02 20:49:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:48,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2022-11-02 20:49:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:48,244 INFO L225 Difference]: With dead ends: 8488 [2022-11-02 20:49:48,244 INFO L226 Difference]: Without dead ends: 4314 [2022-11-02 20:49:48,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:48,249 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:48,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 300 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2022-11-02 20:49:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 4274. [2022-11-02 20:49:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4274 states, 4273 states have (on average 1.301661596068336) internal successors, (5562), 4273 states have internal predecessors, (5562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5562 transitions. [2022-11-02 20:49:48,588 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5562 transitions. Word has length 290 [2022-11-02 20:49:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:48,588 INFO L495 AbstractCegarLoop]: Abstraction has 4274 states and 5562 transitions. [2022-11-02 20:49:48,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5562 transitions. [2022-11-02 20:49:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-11-02 20:49:48,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:48,602 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:48,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:49:48,604 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:48,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:48,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1702375352, now seen corresponding path program 1 times [2022-11-02 20:49:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:48,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57905806] [2022-11-02 20:49:48,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2022-11-02 20:49:48,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:48,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57905806] [2022-11-02 20:49:48,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57905806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:48,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:48,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:48,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867545532] [2022-11-02 20:49:48,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:48,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:48,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:48,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:48,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:48,709 INFO L87 Difference]: Start difference. First operand 4274 states and 5562 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:49,096 INFO L93 Difference]: Finished difference Result 8920 states and 11652 transitions. [2022-11-02 20:49:49,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:49,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 311 [2022-11-02 20:49:49,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:49,107 INFO L225 Difference]: With dead ends: 8920 [2022-11-02 20:49:49,107 INFO L226 Difference]: Without dead ends: 4654 [2022-11-02 20:49:49,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:49,112 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 29 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:49,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 299 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2022-11-02 20:49:49,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 4524. [2022-11-02 20:49:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 4523 states have (on average 1.2960424497015255) internal successors, (5862), 4523 states have internal predecessors, (5862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 5862 transitions. [2022-11-02 20:49:49,372 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 5862 transitions. Word has length 311 [2022-11-02 20:49:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:49,373 INFO L495 AbstractCegarLoop]: Abstraction has 4524 states and 5862 transitions. [2022-11-02 20:49:49,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:49,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 5862 transitions. [2022-11-02 20:49:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-11-02 20:49:49,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:49,384 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:49,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:49:49,385 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:49,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash 602793911, now seen corresponding path program 1 times [2022-11-02 20:49:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:49,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410806025] [2022-11-02 20:49:49,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:49,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-11-02 20:49:49,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:49,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410806025] [2022-11-02 20:49:49,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410806025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:49,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:49,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:49,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204540103] [2022-11-02 20:49:49,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:49,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:49,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:49,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:49,493 INFO L87 Difference]: Start difference. First operand 4524 states and 5862 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:49,725 INFO L93 Difference]: Finished difference Result 7636 states and 9829 transitions. [2022-11-02 20:49:49,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:49,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2022-11-02 20:49:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:49,731 INFO L225 Difference]: With dead ends: 7636 [2022-11-02 20:49:49,731 INFO L226 Difference]: Without dead ends: 2476 [2022-11-02 20:49:49,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:49,737 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:49,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 288 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2022-11-02 20:49:49,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2022-11-02 20:49:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2836363636363637) internal successors, (3177), 2475 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3177 transitions. [2022-11-02 20:49:49,874 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3177 transitions. Word has length 321 [2022-11-02 20:49:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:49,874 INFO L495 AbstractCegarLoop]: Abstraction has 2476 states and 3177 transitions. [2022-11-02 20:49:49,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3177 transitions. [2022-11-02 20:49:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-11-02 20:49:49,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:49,880 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:49,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:49:49,880 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:49,883 INFO L85 PathProgramCache]: Analyzing trace with hash -616309997, now seen corresponding path program 1 times [2022-11-02 20:49:49,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:49,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943937267] [2022-11-02 20:49:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2022-11-02 20:49:49,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:49,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943937267] [2022-11-02 20:49:49,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943937267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:49,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:49,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517011997] [2022-11-02 20:49:49,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:49,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:49,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:49,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:49,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:49,989 INFO L87 Difference]: Start difference. First operand 2476 states and 3177 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:50,201 INFO L93 Difference]: Finished difference Result 4984 states and 6407 transitions. [2022-11-02 20:49:50,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:50,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2022-11-02 20:49:50,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:50,207 INFO L225 Difference]: With dead ends: 4984 [2022-11-02 20:49:50,207 INFO L226 Difference]: Without dead ends: 2516 [2022-11-02 20:49:50,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:50,211 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 19 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:50,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 293 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2022-11-02 20:49:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2476. [2022-11-02 20:49:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2735353535353535) internal successors, (3152), 2475 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3152 transitions. [2022-11-02 20:49:50,327 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3152 transitions. Word has length 337 [2022-11-02 20:49:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:50,327 INFO L495 AbstractCegarLoop]: Abstraction has 2476 states and 3152 transitions. [2022-11-02 20:49:50,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3152 transitions. [2022-11-02 20:49:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2022-11-02 20:49:50,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:50,333 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:50,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:49:50,333 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:50,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:50,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1063549815, now seen corresponding path program 1 times [2022-11-02 20:49:50,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:50,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596341700] [2022-11-02 20:49:50,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:50,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2022-11-02 20:49:50,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:50,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596341700] [2022-11-02 20:49:50,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596341700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:50,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:50,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361295678] [2022-11-02 20:49:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:50,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:50,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:50,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:50,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:50,458 INFO L87 Difference]: Start difference. First operand 2476 states and 3152 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:50,681 INFO L93 Difference]: Finished difference Result 4954 states and 6302 transitions. [2022-11-02 20:49:50,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:50,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 360 [2022-11-02 20:49:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:50,687 INFO L225 Difference]: With dead ends: 4954 [2022-11-02 20:49:50,687 INFO L226 Difference]: Without dead ends: 2486 [2022-11-02 20:49:50,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:50,691 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:50,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2022-11-02 20:49:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2476. [2022-11-02 20:49:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2634343434343434) internal successors, (3127), 2475 states have internal predecessors, (3127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3127 transitions. [2022-11-02 20:49:50,803 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3127 transitions. Word has length 360 [2022-11-02 20:49:50,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:50,803 INFO L495 AbstractCegarLoop]: Abstraction has 2476 states and 3127 transitions. [2022-11-02 20:49:50,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3127 transitions. [2022-11-02 20:49:50,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2022-11-02 20:49:50,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:50,810 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:50,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:49:50,810 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:50,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:50,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2107174257, now seen corresponding path program 1 times [2022-11-02 20:49:50,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:50,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192963369] [2022-11-02 20:49:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:50,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-11-02 20:49:50,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:50,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192963369] [2022-11-02 20:49:50,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192963369] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:50,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074380823] [2022-11-02 20:49:50,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:50,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:50,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:50,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:51,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:49:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:51,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:49:51,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2022-11-02 20:49:51,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:49:51,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074380823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:51,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:49:51,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-02 20:49:51,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468675041] [2022-11-02 20:49:51,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:51,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:51,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:51,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:51,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:49:51,571 INFO L87 Difference]: Start difference. First operand 2476 states and 3127 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:51,755 INFO L93 Difference]: Finished difference Result 3068 states and 3883 transitions. [2022-11-02 20:49:51,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:51,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 393 [2022-11-02 20:49:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:51,762 INFO L225 Difference]: With dead ends: 3068 [2022-11-02 20:49:51,762 INFO L226 Difference]: Without dead ends: 2930 [2022-11-02 20:49:51,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:49:51,764 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 91 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:51,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 447 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:49:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2022-11-02 20:49:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2340. [2022-11-02 20:49:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2340 states, 2339 states have (on average 1.27105600684053) internal successors, (2973), 2339 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 2973 transitions. [2022-11-02 20:49:51,932 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 2973 transitions. Word has length 393 [2022-11-02 20:49:51,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:51,933 INFO L495 AbstractCegarLoop]: Abstraction has 2340 states and 2973 transitions. [2022-11-02 20:49:51,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2973 transitions. [2022-11-02 20:49:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2022-11-02 20:49:51,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:51,939 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:51,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:52,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-02 20:49:52,153 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:52,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:52,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2021892229, now seen corresponding path program 1 times [2022-11-02 20:49:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:52,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137058273] [2022-11-02 20:49:52,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:52,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-11-02 20:49:52,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:52,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137058273] [2022-11-02 20:49:52,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137058273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:52,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374550644] [2022-11-02 20:49:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:52,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:52,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:52,326 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:52,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:49:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:52,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:49:52,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-11-02 20:49:52,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-11-02 20:49:52,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374550644] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:52,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:52,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-02 20:49:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843868953] [2022-11-02 20:49:52,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:52,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:49:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:52,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:49:52,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:52,738 INFO L87 Difference]: Start difference. First operand 2340 states and 2973 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:53,313 INFO L93 Difference]: Finished difference Result 5609 states and 7131 transitions. [2022-11-02 20:49:53,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:49:53,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 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 409 [2022-11-02 20:49:53,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:53,320 INFO L225 Difference]: With dead ends: 5609 [2022-11-02 20:49:53,321 INFO L226 Difference]: Without dead ends: 3228 [2022-11-02 20:49:53,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 818 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:49:53,325 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 586 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:53,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 397 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:49:53,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2022-11-02 20:49:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 2400. [2022-11-02 20:49:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2399 states have (on average 1.2705293872446852) internal successors, (3048), 2399 states have internal predecessors, (3048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3048 transitions. [2022-11-02 20:49:53,460 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3048 transitions. Word has length 409 [2022-11-02 20:49:53,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:53,460 INFO L495 AbstractCegarLoop]: Abstraction has 2400 states and 3048 transitions. [2022-11-02 20:49:53,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3048 transitions. [2022-11-02 20:49:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2022-11-02 20:49:53,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:53,466 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:53,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:49:53,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-02 20:49:53,682 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:53,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:53,682 INFO L85 PathProgramCache]: Analyzing trace with hash -50523035, now seen corresponding path program 1 times [2022-11-02 20:49:53,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:53,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17931097] [2022-11-02 20:49:53,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:53,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1661 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2022-11-02 20:49:53,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:53,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17931097] [2022-11-02 20:49:53,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17931097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:53,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:53,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:49:53,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018101803] [2022-11-02 20:49:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:53,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:53,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:53,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:53,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:53,840 INFO L87 Difference]: Start difference. First operand 2400 states and 3048 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:54,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:54,072 INFO L93 Difference]: Finished difference Result 4972 states and 6324 transitions. [2022-11-02 20:49:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:54,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 537 [2022-11-02 20:49:54,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:54,078 INFO L225 Difference]: With dead ends: 4972 [2022-11-02 20:49:54,078 INFO L226 Difference]: Without dead ends: 2580 [2022-11-02 20:49:54,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:54,083 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:54,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 290 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2022-11-02 20:49:54,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2570. [2022-11-02 20:49:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2569 states have (on average 1.262358894511483) internal successors, (3243), 2569 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3243 transitions. [2022-11-02 20:49:54,215 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3243 transitions. Word has length 537 [2022-11-02 20:49:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:54,215 INFO L495 AbstractCegarLoop]: Abstraction has 2570 states and 3243 transitions. [2022-11-02 20:49:54,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3243 transitions. [2022-11-02 20:49:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2022-11-02 20:49:54,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:54,222 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:54,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:49:54,222 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:49:54,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1600887189, now seen corresponding path program 1 times [2022-11-02 20:49:54,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:54,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339653978] [2022-11-02 20:49:54,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-11-02 20:49:54,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:54,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339653978] [2022-11-02 20:49:54,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339653978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:54,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264872786] [2022-11-02 20:49:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:54,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:54,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:54,504 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:54,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:49:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:54,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:49:54,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-11-02 20:49:54,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-11-02 20:49:54,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264872786] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:49:54,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:49:54,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-11-02 20:49:54,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485409940] [2022-11-02 20:49:54,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:49:54,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:49:54,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:54,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:49:54,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:49:54,948 INFO L87 Difference]: Start difference. First operand 2570 states and 3243 transitions. Second operand has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:55,290 INFO L93 Difference]: Finished difference Result 4135 states and 5217 transitions. [2022-11-02 20:49:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:49:55,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 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 599 [2022-11-02 20:49:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:55,292 INFO L225 Difference]: With dead ends: 4135 [2022-11-02 20:49:55,292 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:49:55,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1204 GetRequests, 1196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:49:55,296 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 119 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:55,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 398 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:49:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:49:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:49:55,297 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 599 [2022-11-02 20:49:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:55,298 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:49:55,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:49:55,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:49:55,301 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:49:55,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-02 20:49:55,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-02 20:49:55,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:50:21,923 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-11-02 20:50:21,923 INFO L899 garLoopResultBuilder]: For program point L531-2(lines 531 535) no Hoare annotation was computed. [2022-11-02 20:50:21,924 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2022-11-02 20:50:21,924 INFO L895 garLoopResultBuilder]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse3 .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse0 .cse1) (and .cse3 .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)))) [2022-11-02 20:50:21,925 INFO L895 garLoopResultBuilder]: At program point L168(lines 164 573) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12))) [2022-11-02 20:50:21,925 INFO L895 garLoopResultBuilder]: At program point L135(lines 134 583) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10))) [2022-11-02 20:50:21,926 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-11-02 20:50:21,926 INFO L899 garLoopResultBuilder]: For program point L499(lines 499 502) no Hoare annotation was computed. [2022-11-02 20:50:21,926 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2022-11-02 20:50:21,926 INFO L902 garLoopResultBuilder]: At program point L632(lines 623 634) the Hoare annotation is: true [2022-11-02 20:50:21,926 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 560) no Hoare annotation was computed. [2022-11-02 20:50:21,927 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 571) no Hoare annotation was computed. [2022-11-02 20:50:21,927 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 582) no Hoare annotation was computed. [2022-11-02 20:50:21,927 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2022-11-02 20:50:21,927 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-11-02 20:50:21,927 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-11-02 20:50:21,927 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-11-02 20:50:21,928 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 219 553) no Hoare annotation was computed. [2022-11-02 20:50:21,928 INFO L899 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2022-11-02 20:50:21,928 INFO L899 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2022-11-02 20:50:21,928 INFO L899 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2022-11-02 20:50:21,928 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-11-02 20:50:21,928 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 559) no Hoare annotation was computed. [2022-11-02 20:50:21,929 INFO L899 garLoopResultBuilder]: For program point L173(lines 173 570) no Hoare annotation was computed. [2022-11-02 20:50:21,929 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 581) no Hoare annotation was computed. [2022-11-02 20:50:21,929 INFO L899 garLoopResultBuilder]: For program point L504(lines 504 510) no Hoare annotation was computed. [2022-11-02 20:50:21,929 INFO L895 garLoopResultBuilder]: At program point L207(lines 203 560) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse7 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse7 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse7) .cse6))) [2022-11-02 20:50:21,930 INFO L895 garLoopResultBuilder]: At program point L174(lines 170 571) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4))) [2022-11-02 20:50:21,930 INFO L899 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2022-11-02 20:50:21,930 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2022-11-02 20:50:21,930 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 558) no Hoare annotation was computed. [2022-11-02 20:50:21,930 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 569) no Hoare annotation was computed. [2022-11-02 20:50:21,930 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 580) no Hoare annotation was computed. [2022-11-02 20:50:21,931 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 609) the Hoare annotation is: (let ((.cse6 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse25 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse19 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640)) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse26 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse31 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse30 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not .cse19)) (.cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse21 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse22 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse23 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse28 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse8 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse24 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse13 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse16 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse29 (not .cse25)) (.cse27 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse17 (not .cse6))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse3) (and .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse14 .cse2 .cse7 .cse17) (and .cse18 .cse12 .cse4 .cse19 .cse20) (and .cse21 .cse22 .cse23 .cse7 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse24 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse13 .cse14 .cse19 .cse2 .cse23) (and .cse24 .cse19 .cse25) (and .cse24 .cse18 .cse26 .cse4 .cse23 .cse20) (and .cse0 .cse27) (and .cse1 .cse28 .cse19 .cse2 .cse7) (and .cse12 .cse1 .cse22 .cse2 .cse23) (and .cse18 .cse4 .cse7 .cse20) (and .cse24 .cse18 .cse26 .cse4 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse21 .cse14) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse30 .cse1 .cse28 .cse19 .cse2) (and .cse24 .cse1 .cse22 .cse19 .cse2 .cse23) (and .cse31 .cse30 .cse23 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse24 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse31 .cse30 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse27 .cse14 .cse7 .cse17) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse23 .cse17) (and .cse12 .cse21 .cse22 .cse23 .cse15) (and .cse24 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse22 .cse19 .cse23 .cse15) (and .cse24 .cse6 .cse19) (and .cse1 .cse22 .cse2 .cse23 .cse7) (and .cse12 .cse1 .cse28 .cse19 .cse2) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse27 .cse14) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse27 .cse14 .cse17)))) [2022-11-02 20:50:21,931 INFO L899 garLoopResultBuilder]: For program point L507(lines 507 509) no Hoare annotation was computed. [2022-11-02 20:50:21,932 INFO L899 garLoopResultBuilder]: For program point L507-2(lines 219 553) no Hoare annotation was computed. [2022-11-02 20:50:21,932 INFO L895 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12))) [2022-11-02 20:50:21,932 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-11-02 20:50:21,933 INFO L895 garLoopResultBuilder]: At program point L177(lines 176 569) the Hoare annotation is: (let ((.cse6 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse3 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse1 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse0 .cse1 (not .cse2)) (and .cse0 .cse3 .cse2 .cse1 .cse4) (and .cse5 .cse0 .cse6 .cse1 .cse7) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse3 .cse2 .cse1) (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse6 .cse2 .cse1 .cse7) (and .cse0 .cse6 .cse1 .cse7 .cse4) (and .cse5 .cse0 .cse3 .cse2 .cse1))) [2022-11-02 20:50:21,933 INFO L895 garLoopResultBuilder]: At program point L144(lines 137 582) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10) (and .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse9 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-02 20:50:21,933 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-11-02 20:50:21,933 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 547) no Hoare annotation was computed. [2022-11-02 20:50:21,933 INFO L899 garLoopResultBuilder]: For program point L541-1(lines 541 547) no Hoare annotation was computed. [2022-11-02 20:50:21,934 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2022-11-02 20:50:21,934 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2022-11-02 20:50:21,934 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 557) no Hoare annotation was computed. [2022-11-02 20:50:21,934 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 568) no Hoare annotation was computed. [2022-11-02 20:50:21,934 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 579) no Hoare annotation was computed. [2022-11-02 20:50:21,934 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 590) no Hoare annotation was computed. [2022-11-02 20:50:21,935 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-11-02 20:50:21,935 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2022-11-02 20:50:21,935 INFO L899 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2022-11-02 20:50:21,935 INFO L895 garLoopResultBuilder]: At program point L213(lines 209 558) the Hoare annotation is: (let ((.cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (and .cse0 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 .cse1 .cse2 (not .cse3)) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3))) [2022-11-02 20:50:21,935 INFO L895 garLoopResultBuilder]: At program point L114(lines 113 590) the Hoare annotation is: false [2022-11-02 20:50:21,936 INFO L902 garLoopResultBuilder]: At program point L610(lines 109 611) the Hoare annotation is: true [2022-11-02 20:50:21,936 INFO L899 garLoopResultBuilder]: For program point L544(lines 544 546) no Hoare annotation was computed. [2022-11-02 20:50:21,936 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 556) no Hoare annotation was computed. [2022-11-02 20:50:21,936 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 567) no Hoare annotation was computed. [2022-11-02 20:50:21,936 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 578) no Hoare annotation was computed. [2022-11-02 20:50:21,937 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 589) no Hoare annotation was computed. [2022-11-02 20:50:21,937 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2022-11-02 20:50:21,937 INFO L899 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2022-11-02 20:50:21,937 INFO L895 garLoopResultBuilder]: At program point L216(lines 215 556) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-11-02 20:50:21,937 INFO L895 garLoopResultBuilder]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6))) [2022-11-02 20:50:21,938 INFO L895 garLoopResultBuilder]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12 .cse13 .cse14) (and (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse14))) [2022-11-02 20:50:21,938 INFO L899 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2022-11-02 20:50:21,938 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:50:21,938 INFO L895 garLoopResultBuilder]: At program point L218(lines 217 556) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-11-02 20:50:21,939 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 566) no Hoare annotation was computed. [2022-11-02 20:50:21,939 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 577) no Hoare annotation was computed. [2022-11-02 20:50:21,939 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 588) no Hoare annotation was computed. [2022-11-02 20:50:21,939 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 617) no Hoare annotation was computed. [2022-11-02 20:50:21,939 INFO L899 garLoopResultBuilder]: For program point L615-2(lines 615 617) no Hoare annotation was computed. [2022-11-02 20:50:21,939 INFO L899 garLoopResultBuilder]: For program point L516(lines 516 519) no Hoare annotation was computed. [2022-11-02 20:50:21,940 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-11-02 20:50:21,940 INFO L899 garLoopResultBuilder]: For program point L285-2(lines 219 553) no Hoare annotation was computed. [2022-11-02 20:50:21,940 INFO L899 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2022-11-02 20:50:21,940 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2022-11-02 20:50:21,940 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2022-11-02 20:50:21,941 INFO L899 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2022-11-02 20:50:21,941 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-11-02 20:50:21,941 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 565) no Hoare annotation was computed. [2022-11-02 20:50:21,941 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 576) no Hoare annotation was computed. [2022-11-02 20:50:21,941 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 587) no Hoare annotation was computed. [2022-11-02 20:50:21,941 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2022-11-02 20:50:21,942 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2022-11-02 20:50:21,942 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-11-02 20:50:21,942 INFO L895 garLoopResultBuilder]: At program point L222(lines 116 589) the Hoare annotation is: false [2022-11-02 20:50:21,942 INFO L895 garLoopResultBuilder]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6))) [2022-11-02 20:50:21,943 INFO L895 garLoopResultBuilder]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6))) [2022-11-02 20:50:21,943 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2022-11-02 20:50:21,943 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-11-02 20:50:21,943 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:50:21,943 INFO L902 garLoopResultBuilder]: At program point L620(lines 22 622) the Hoare annotation is: true [2022-11-02 20:50:21,944 INFO L895 garLoopResultBuilder]: At program point L554(lines 110 609) the Hoare annotation is: (let ((.cse6 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse25 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse19 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640)) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse26 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse31 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse30 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not .cse19)) (.cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse21 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse22 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse23 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse28 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse8 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse24 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse13 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse16 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse29 (not .cse25)) (.cse27 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse17 (not .cse6))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse3) (and .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse14 .cse2 .cse7 .cse17) (and .cse18 .cse12 .cse4 .cse19 .cse20) (and .cse21 .cse22 .cse23 .cse7 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse24 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse13 .cse14 .cse19 .cse2 .cse23) (and .cse24 .cse19 .cse25) (and .cse24 .cse18 .cse26 .cse4 .cse23 .cse20) (and .cse0 .cse27) (and .cse1 .cse28 .cse19 .cse2 .cse7) (and .cse12 .cse1 .cse22 .cse2 .cse23) (and .cse18 .cse4 .cse7 .cse20) (and .cse24 .cse18 .cse26 .cse4 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse21 .cse14) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse30 .cse1 .cse28 .cse19 .cse2) (and .cse24 .cse1 .cse22 .cse19 .cse2 .cse23) (and .cse31 .cse30 .cse23 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse24 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse31 .cse30 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse27 .cse14 .cse7 .cse17) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse23 .cse17) (and .cse12 .cse21 .cse22 .cse23 .cse15) (and .cse24 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse22 .cse19 .cse23 .cse15) (and .cse24 .cse6 .cse19) (and .cse1 .cse22 .cse2 .cse23 .cse7) (and .cse12 .cse1 .cse28 .cse19 .cse2) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse27 .cse14) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse27 .cse14 .cse17)))) [2022-11-02 20:50:21,944 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 564) no Hoare annotation was computed. [2022-11-02 20:50:21,945 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 575) no Hoare annotation was computed. [2022-11-02 20:50:21,945 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 586) no Hoare annotation was computed. [2022-11-02 20:50:21,945 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2022-11-02 20:50:21,945 INFO L899 garLoopResultBuilder]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2022-11-02 20:50:21,945 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-11-02 20:50:21,945 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:50:21,946 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 526) no Hoare annotation was computed. [2022-11-02 20:50:21,946 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2022-11-02 20:50:21,946 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-11-02 20:50:21,946 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 563) no Hoare annotation was computed. [2022-11-02 20:50:21,946 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 574) no Hoare annotation was computed. [2022-11-02 20:50:21,946 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-11-02 20:50:21,947 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 585) no Hoare annotation was computed. [2022-11-02 20:50:21,947 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 607) no Hoare annotation was computed. [2022-11-02 20:50:21,947 INFO L895 garLoopResultBuilder]: At program point L525(lines 83 621) the Hoare annotation is: false [2022-11-02 20:50:21,947 INFO L895 garLoopResultBuilder]: At program point L195(lines 191 564) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6))) [2022-11-02 20:50:21,948 INFO L895 garLoopResultBuilder]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6))) [2022-11-02 20:50:21,948 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-11-02 20:50:21,948 INFO L899 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-11-02 20:50:21,948 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 606) no Hoare annotation was computed. [2022-11-02 20:50:21,948 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2022-11-02 20:50:21,948 INFO L899 garLoopResultBuilder]: For program point L593(lines 593 598) no Hoare annotation was computed. [2022-11-02 20:50:21,949 INFO L899 garLoopResultBuilder]: For program point L527(lines 527 529) no Hoare annotation was computed. [2022-11-02 20:50:21,949 INFO L899 garLoopResultBuilder]: For program point L593-2(lines 592 606) no Hoare annotation was computed. [2022-11-02 20:50:21,949 INFO L895 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6))) [2022-11-02 20:50:21,949 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 562) no Hoare annotation was computed. [2022-11-02 20:50:21,949 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 573) no Hoare annotation was computed. [2022-11-02 20:50:21,950 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 584) no Hoare annotation was computed. [2022-11-02 20:50:21,950 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:50:21,950 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2022-11-02 20:50:21,950 INFO L899 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2022-11-02 20:50:21,950 INFO L895 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12))) [2022-11-02 20:50:21,951 INFO L895 garLoopResultBuilder]: At program point L132(lines 128 585) the Hoare annotation is: false [2022-11-02 20:50:21,951 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2022-11-02 20:50:21,951 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2022-11-02 20:50:21,951 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2022-11-02 20:50:21,951 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-11-02 20:50:21,951 INFO L899 garLoopResultBuilder]: For program point L298-2(lines 219 553) no Hoare annotation was computed. [2022-11-02 20:50:21,952 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2022-11-02 20:50:21,952 INFO L899 garLoopResultBuilder]: For program point L332-2(lines 219 553) no Hoare annotation was computed. [2022-11-02 20:50:21,952 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 561) no Hoare annotation was computed. [2022-11-02 20:50:21,952 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 572) no Hoare annotation was computed. [2022-11-02 20:50:21,952 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 583) no Hoare annotation was computed. [2022-11-02 20:50:21,952 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-11-02 20:50:21,952 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 83 621) no Hoare annotation was computed. [2022-11-02 20:50:21,956 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:21,958 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:50:22,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:50:22 BoogieIcfgContainer [2022-11-02 20:50:22,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:50:22,001 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:50:22,001 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:50:22,001 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:50:22,002 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:34" (3/4) ... [2022-11-02 20:50:22,005 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:50:22,021 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-02 20:50:22,022 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:50:22,023 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:50:22,024 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:50:22,123 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:50:22,123 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:50:22,124 INFO L158 Benchmark]: Toolchain (without parser) took 49193.15ms. Allocated memory was 115.3MB in the beginning and 572.5MB in the end (delta: 457.2MB). Free memory was 79.4MB in the beginning and 230.9MB in the end (delta: -151.5MB). Peak memory consumption was 306.3MB. Max. memory is 16.1GB. [2022-11-02 20:50:22,127 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 79.7MB. Free memory was 49.7MB in the beginning and 49.6MB in the end (delta: 30.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:50:22,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.60ms. Allocated memory is still 115.3MB. Free memory was 79.1MB in the beginning and 86.3MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:50:22,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.46ms. Allocated memory is still 115.3MB. Free memory was 86.3MB in the beginning and 83.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:50:22,134 INFO L158 Benchmark]: Boogie Preprocessor took 34.78ms. Allocated memory is still 115.3MB. Free memory was 83.2MB in the beginning and 81.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:50:22,134 INFO L158 Benchmark]: RCFGBuilder took 963.55ms. Allocated memory is still 115.3MB. Free memory was 81.1MB in the beginning and 44.9MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-02 20:50:22,134 INFO L158 Benchmark]: TraceAbstraction took 47498.38ms. Allocated memory was 115.3MB in the beginning and 572.5MB in the end (delta: 457.2MB). Free memory was 43.9MB in the beginning and 239.3MB in the end (delta: -195.4MB). Peak memory consumption was 304.8MB. Max. memory is 16.1GB. [2022-11-02 20:50:22,135 INFO L158 Benchmark]: Witness Printer took 122.38ms. Allocated memory is still 572.5MB. Free memory was 239.3MB in the beginning and 230.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:50:22,136 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 79.7MB. Free memory was 49.7MB in the beginning and 49.6MB in the end (delta: 30.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 477.60ms. Allocated memory is still 115.3MB. Free memory was 79.1MB in the beginning and 86.3MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.46ms. Allocated memory is still 115.3MB. Free memory was 86.3MB in the beginning and 83.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.78ms. Allocated memory is still 115.3MB. Free memory was 83.2MB in the beginning and 81.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 963.55ms. Allocated memory is still 115.3MB. Free memory was 81.1MB in the beginning and 44.9MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 47498.38ms. Allocated memory was 115.3MB in the beginning and 572.5MB in the end (delta: 457.2MB). Free memory was 43.9MB in the beginning and 239.3MB in the end (delta: -195.4MB). Peak memory consumption was 304.8MB. Max. memory is 16.1GB. * Witness Printer took 122.38ms. Allocated memory is still 572.5MB. Free memory was 239.3MB in the beginning and 230.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 619]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.4s, OverallIterations: 34, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4953 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4953 mSDsluCounter, 10153 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3407 mSDsCounter, 1020 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4114 IncrementalHoareTripleChecker+Invalid, 5134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1020 mSolverCounterUnsat, 6746 mSDtfsCounter, 4114 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3496 GetRequests, 3436 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4524occurred in iteration=27, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 6551 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 235 NumberOfFragments, 3584 HoareAnnotationTreeSize, 28 FomulaSimplifications, 59600 FormulaSimplificationTreeSizeReduction, 11.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 208853 FormulaSimplificationTreeSizeReductionInter, 15.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 8782 NumberOfCodeBlocks, 8782 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10232 ConstructedInterpolants, 0 QuantifiedInterpolants, 14238 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3095 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 43 InterpolantComputations, 30 PerfectInterpolantSequences, 34894/35202 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((!(8448 == s__state) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) || (((((((!(8448 == s__state) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && 0 == s__hit) && s__state <= 8672)) || ((((((!(8448 == s__state) && !(s__state == 8481)) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && blastFlag == 0) && s__state <= 8672)) || (((((((!(8448 == s__state) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && !(0 == s__hit)) && s__state <= 8672) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state <= 8640) && !(0 == s__hit))) || (8560 == s__state && blastFlag == 0)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || ((((!(s__state == 8657) && blastFlag == 1) && 8640 <= s__state) && 0 == s__hit) && s__state <= 8672)) || ((((!(s__state <= 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 0 == s__hit) && 8544 == s__state)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((!(s__state == 8657) && 8640 <= s__state) && blastFlag == 0) && s__state <= 8672)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(s__state <= 8496)) && !(s__state == 8480))) || (((((((((((((s__state == 8528 && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((8672 <= s__state && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state == 8512) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || (((8672 <= s__state && 3 == blastFlag) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && s__state == 3) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (((((2 == blastFlag && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && 8560 == s__state) && 0 == s__hit)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && s__state == 3) && !(s__state == 8480))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480)) && !(8560 == s__state)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state)) && s__s3__tmp__next_state___0 <= 8576) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 0)) || (((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state)) && !(0 == s__hit))) || (((8672 <= s__state && blastFlag == 1) && !(12292 == s__state)) && 0 == s__hit) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 623]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((((!(8576 <= s__state) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) || (((((!(8576 <= s__state) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0)) || (((((!(8576 <= s__state) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state < 8656) && !(0 == s__hit)) || ((8640 <= s__state && s__state < 8656) && blastFlag == 0)) || (((2 == blastFlag && 8640 <= s__state) && s__state < 8656) && !(0 == s__hit))) || ((blastFlag == 1 && 8640 <= s__state) && s__state < 8656)) || (((2 == blastFlag && 8640 <= s__state) && s__state < 8656) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state <= 8640) && !(0 == s__hit))) || (8560 == s__state && blastFlag == 0)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || ((((!(s__state == 8657) && blastFlag == 1) && 8640 <= s__state) && 0 == s__hit) && s__state <= 8672)) || ((((!(s__state <= 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 0 == s__hit) && 8544 == s__state)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((!(s__state == 8657) && 8640 <= s__state) && blastFlag == 0) && s__state <= 8672)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(s__state <= 8496)) && !(s__state == 8480))) || (((((((((((((s__state == 8528 && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((8672 <= s__state && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state == 8512) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || (((8672 <= s__state && 3 == blastFlag) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && s__state == 3) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (((((2 == blastFlag && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && 8560 == s__state) && 0 == s__hit)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && s__state == 3) && !(s__state == 8480))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480)) && !(8560 == s__state)) RESULT: Ultimate proved your program to be correct! [2022-11-02 20:50:22,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3570bf4c-84e3-4fd6-81bb-23bc3fdc15d3/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE