./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/toy1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a --- 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-e04fb08 [2022-11-16 20:16:37,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 20:16:37,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 20:16:37,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 20:16:37,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 20:16:37,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 20:16:37,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 20:16:37,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 20:16:37,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 20:16:37,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 20:16:37,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 20:16:37,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 20:16:37,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 20:16:37,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 20:16:37,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 20:16:37,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 20:16:37,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 20:16:37,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 20:16:37,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 20:16:37,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 20:16:37,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 20:16:37,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 20:16:37,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 20:16:37,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 20:16:37,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 20:16:37,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 20:16:37,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 20:16:37,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 20:16:37,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 20:16:37,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 20:16:37,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 20:16:37,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 20:16:37,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 20:16:37,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 20:16:37,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 20:16:37,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 20:16:37,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 20:16:37,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 20:16:37,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 20:16:37,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 20:16:37,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 20:16:37,997 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-16 20:16:38,020 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 20:16:38,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 20:16:38,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 20:16:38,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 20:16:38,022 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 20:16:38,022 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 20:16:38,022 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 20:16:38,023 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 20:16:38,023 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 20:16:38,023 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 20:16:38,023 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 20:16:38,024 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 20:16:38,024 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 20:16:38,024 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 20:16:38,024 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 20:16:38,025 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 20:16:38,025 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 20:16:38,025 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 20:16:38,026 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 20:16:38,026 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 20:16:38,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 20:16:38,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 20:16:38,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 20:16:38,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 20:16:38,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 20:16:38,028 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 20:16:38,028 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 20:16:38,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 20:16:38,029 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 20:16:38,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 20:16:38,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 20:16:38,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 20:16:38,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:16:38,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 20:16:38,030 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 20:16:38,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 20:16:38,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 20:16:38,031 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 20:16:38,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 20:16:38,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 20:16:38,032 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 20:16:38,032 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_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/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_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0 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 -> Taipan 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 -> c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a [2022-11-16 20:16:38,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 20:16:38,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 20:16:38,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 20:16:38,371 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 20:16:38,373 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 20:16:38,374 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/systemc/toy1.cil.c [2022-11-16 20:16:38,468 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/data/178656dab/87ec186dccc44a31897bfb8f9e5c9c73/FLAG3baeea63a [2022-11-16 20:16:39,021 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 20:16:39,022 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/sv-benchmarks/c/systemc/toy1.cil.c [2022-11-16 20:16:39,033 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/data/178656dab/87ec186dccc44a31897bfb8f9e5c9c73/FLAG3baeea63a [2022-11-16 20:16:39,375 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/data/178656dab/87ec186dccc44a31897bfb8f9e5c9c73 [2022-11-16 20:16:39,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 20:16:39,378 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 20:16:39,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 20:16:39,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 20:16:39,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 20:16:39,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:16:39" (1/1) ... [2022-11-16 20:16:39,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cadb9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39, skipping insertion in model container [2022-11-16 20:16:39,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:16:39" (1/1) ... [2022-11-16 20:16:39,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 20:16:39,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 20:16:39,629 WARN L229 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_f076c9fe-f278-4c9d-a490-5f4ee1124def/sv-benchmarks/c/systemc/toy1.cil.c[698,711] [2022-11-16 20:16:39,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:16:39,703 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 20:16:39,719 WARN L229 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_f076c9fe-f278-4c9d-a490-5f4ee1124def/sv-benchmarks/c/systemc/toy1.cil.c[698,711] [2022-11-16 20:16:39,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:16:39,768 INFO L208 MainTranslator]: Completed translation [2022-11-16 20:16:39,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39 WrapperNode [2022-11-16 20:16:39,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 20:16:39,770 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 20:16:39,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 20:16:39,770 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 20:16:39,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39" (1/1) ... [2022-11-16 20:16:39,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39" (1/1) ... [2022-11-16 20:16:39,829 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 360 [2022-11-16 20:16:39,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 20:16:39,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 20:16:39,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 20:16:39,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 20:16:39,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39" (1/1) ... [2022-11-16 20:16:39,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39" (1/1) ... [2022-11-16 20:16:39,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39" (1/1) ... [2022-11-16 20:16:39,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39" (1/1) ... [2022-11-16 20:16:39,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39" (1/1) ... [2022-11-16 20:16:39,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39" (1/1) ... [2022-11-16 20:16:39,878 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39" (1/1) ... [2022-11-16 20:16:39,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39" (1/1) ... [2022-11-16 20:16:39,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 20:16:39,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 20:16:39,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 20:16:39,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 20:16:39,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39" (1/1) ... [2022-11-16 20:16:39,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:16:39,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:16:39,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 20:16:39,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 20:16:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 20:16:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 20:16:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-16 20:16:39,989 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-16 20:16:39,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 20:16:39,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 20:16:40,115 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 20:16:40,118 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 20:16:40,649 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 20:16:40,966 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 20:16:40,967 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-16 20:16:40,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:16:40 BoogieIcfgContainer [2022-11-16 20:16:40,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 20:16:40,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 20:16:40,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 20:16:40,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 20:16:40,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:16:39" (1/3) ... [2022-11-16 20:16:40,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674eddc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:16:40, skipping insertion in model container [2022-11-16 20:16:40,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:16:39" (2/3) ... [2022-11-16 20:16:40,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674eddc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:16:40, skipping insertion in model container [2022-11-16 20:16:40,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:16:40" (3/3) ... [2022-11-16 20:16:40,985 INFO L112 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2022-11-16 20:16:41,004 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 20:16:41,004 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 20:16:41,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 20:16:41,090 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=FINITE_AUTOMATA, 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;@193b34a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 20:16:41,090 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 20:16:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 45 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-16 20:16:41,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 20:16:41,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:41,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:41,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:16:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash -962154126, now seen corresponding path program 1 times [2022-11-16 20:16:41,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:41,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077263722] [2022-11-16 20:16:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:41,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:41,441 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-16 20:16:41,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:41,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077263722] [2022-11-16 20:16:41,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077263722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:41,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:41,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:16:41,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814979439] [2022-11-16 20:16:41,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:41,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:16:41,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:41,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:16:41,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:16:41,494 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 45 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:41,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:41,666 INFO L93 Difference]: Finished difference Result 118 states and 191 transitions. [2022-11-16 20:16:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:16:41,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 20:16:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:41,681 INFO L225 Difference]: With dead ends: 118 [2022-11-16 20:16:41,681 INFO L226 Difference]: Without dead ends: 69 [2022-11-16 20:16:41,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 20:16:41,690 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:41,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 93 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:16:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-16 20:16:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-11-16 20:16:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 66 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 103 transitions. [2022-11-16 20:16:41,739 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 103 transitions. Word has length 15 [2022-11-16 20:16:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:41,739 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 103 transitions. [2022-11-16 20:16:41,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 103 transitions. [2022-11-16 20:16:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:16:41,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:41,743 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:41,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 20:16:41,744 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:16:41,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:41,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1222847921, now seen corresponding path program 1 times [2022-11-16 20:16:41,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:41,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578565167] [2022-11-16 20:16:41,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:41,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:42,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:42,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578565167] [2022-11-16 20:16:42,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578565167] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:16:42,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768215681] [2022-11-16 20:16:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:42,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:16:42,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:16:42,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:16:42,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 20:16:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:42,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 20:16:42,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:16:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:42,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:16:42,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768215681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:42,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 20:16:42,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-16 20:16:42,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484548917] [2022-11-16 20:16:42,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:42,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:16:42,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:42,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:16:42,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:16:42,279 INFO L87 Difference]: Start difference. First operand 68 states and 103 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:42,361 INFO L93 Difference]: Finished difference Result 137 states and 212 transitions. [2022-11-16 20:16:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:16:42,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 20:16:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:42,363 INFO L225 Difference]: With dead ends: 137 [2022-11-16 20:16:42,363 INFO L226 Difference]: Without dead ends: 98 [2022-11-16 20:16:42,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:16:42,365 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 44 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:42,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 81 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:16:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-16 20:16:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2022-11-16 20:16:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 92 states have (on average 1.565217391304348) internal successors, (144), 93 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 146 transitions. [2022-11-16 20:16:42,378 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 146 transitions. Word has length 24 [2022-11-16 20:16:42,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:42,379 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 146 transitions. [2022-11-16 20:16:42,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 146 transitions. [2022-11-16 20:16:42,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 20:16:42,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:42,381 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:42,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 20:16:42,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-16 20:16:42,587 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:16:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1814616030, now seen corresponding path program 1 times [2022-11-16 20:16:42,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:42,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498161288] [2022-11-16 20:16:42,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:42,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:16:42,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498161288] [2022-11-16 20:16:42,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498161288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:16:42,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564401973] [2022-11-16 20:16:42,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:42,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:16:42,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:16:42,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:16:42,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 20:16:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:43,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 20:16:43,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:16:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 20:16:43,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:16:43,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564401973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:43,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 20:16:43,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-16 20:16:43,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449413974] [2022-11-16 20:16:43,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:43,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:16:43,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:43,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:16:43,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:16:43,077 INFO L87 Difference]: Start difference. First operand 95 states and 146 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:43,178 INFO L93 Difference]: Finished difference Result 193 states and 304 transitions. [2022-11-16 20:16:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:16:43,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-16 20:16:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:43,180 INFO L225 Difference]: With dead ends: 193 [2022-11-16 20:16:43,183 INFO L226 Difference]: Without dead ends: 127 [2022-11-16 20:16:43,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:16:43,185 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:43,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 110 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:16:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-16 20:16:43,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2022-11-16 20:16:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 112 states have (on average 1.5714285714285714) internal successors, (176), 113 states have internal predecessors, (176), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 178 transitions. [2022-11-16 20:16:43,205 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 178 transitions. Word has length 35 [2022-11-16 20:16:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:43,207 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 178 transitions. [2022-11-16 20:16:43,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 178 transitions. [2022-11-16 20:16:43,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 20:16:43,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:43,210 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:43,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 20:16:43,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-16 20:16:43,416 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:16:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash 912835074, now seen corresponding path program 1 times [2022-11-16 20:16:43,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:43,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116074447] [2022-11-16 20:16:43,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 20:16:43,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:43,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116074447] [2022-11-16 20:16:43,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116074447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:43,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:43,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:16:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474483724] [2022-11-16 20:16:43,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:43,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:16:43,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:43,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:16:43,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:16:43,508 INFO L87 Difference]: Start difference. First operand 115 states and 178 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:43,579 INFO L93 Difference]: Finished difference Result 203 states and 317 transitions. [2022-11-16 20:16:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:16:43,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-16 20:16:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:43,609 INFO L225 Difference]: With dead ends: 203 [2022-11-16 20:16:43,609 INFO L226 Difference]: Without dead ends: 117 [2022-11-16 20:16:43,610 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-16 20:16:43,611 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 41 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:43,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 114 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:16:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-16 20:16:43,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2022-11-16 20:16:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 114 states have internal predecessors, (174), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:43,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 176 transitions. [2022-11-16 20:16:43,625 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 176 transitions. Word has length 43 [2022-11-16 20:16:43,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:43,625 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 176 transitions. [2022-11-16 20:16:43,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:43,625 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 176 transitions. [2022-11-16 20:16:43,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 20:16:43,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:43,629 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 20:16:43,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 20:16:43,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:16:43,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:43,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1294167097, now seen corresponding path program 1 times [2022-11-16 20:16:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:43,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800189144] [2022-11-16 20:16:43,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 20:16:43,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:43,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800189144] [2022-11-16 20:16:43,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800189144] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:43,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:43,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:16:43,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902629530] [2022-11-16 20:16:43,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:43,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:16:43,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:43,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:16:43,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:16:43,718 INFO L87 Difference]: Start difference. First operand 116 states and 176 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:43,781 INFO L93 Difference]: Finished difference Result 260 states and 398 transitions. [2022-11-16 20:16:43,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:16:43,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-16 20:16:43,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:43,786 INFO L225 Difference]: With dead ends: 260 [2022-11-16 20:16:43,786 INFO L226 Difference]: Without dead ends: 173 [2022-11-16 20:16:43,789 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-16 20:16:43,791 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 37 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:43,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 122 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:16:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-16 20:16:43,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 166. [2022-11-16 20:16:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 163 states have (on average 1.5644171779141105) internal successors, (255), 164 states have internal predecessors, (255), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 257 transitions. [2022-11-16 20:16:43,814 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 257 transitions. Word has length 43 [2022-11-16 20:16:43,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:43,818 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 257 transitions. [2022-11-16 20:16:43,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 257 transitions. [2022-11-16 20:16:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-16 20:16:43,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:43,826 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:43,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 20:16:43,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:16:43,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:43,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1426671902, now seen corresponding path program 1 times [2022-11-16 20:16:43,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:43,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640137772] [2022-11-16 20:16:43,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:43,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:43,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:43,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640137772] [2022-11-16 20:16:43,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640137772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:43,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:43,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:16:43,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691839432] [2022-11-16 20:16:43,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:43,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:16:43,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:43,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:16:43,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:16:43,924 INFO L87 Difference]: Start difference. First operand 166 states and 257 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:43,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:43,984 INFO L93 Difference]: Finished difference Result 385 states and 590 transitions. [2022-11-16 20:16:43,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:16:43,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-16 20:16:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:43,988 INFO L225 Difference]: With dead ends: 385 [2022-11-16 20:16:43,988 INFO L226 Difference]: Without dead ends: 223 [2022-11-16 20:16:43,989 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-16 20:16:43,997 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 32 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:43,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 119 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:16:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-16 20:16:44,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 178. [2022-11-16 20:16:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 1.52) internal successors, (266), 176 states have internal predecessors, (266), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 268 transitions. [2022-11-16 20:16:44,017 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 268 transitions. Word has length 44 [2022-11-16 20:16:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:44,017 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 268 transitions. [2022-11-16 20:16:44,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 268 transitions. [2022-11-16 20:16:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 20:16:44,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:44,025 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:44,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 20:16:44,025 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:16:44,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:44,026 INFO L85 PathProgramCache]: Analyzing trace with hash 448338724, now seen corresponding path program 1 times [2022-11-16 20:16:44,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:44,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929768938] [2022-11-16 20:16:44,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:44,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-16 20:16:44,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:44,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929768938] [2022-11-16 20:16:44,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929768938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:16:44,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:16:44,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:16:44,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045521036] [2022-11-16 20:16:44,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:16:44,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:16:44,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:16:44,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:16:44,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:16:44,097 INFO L87 Difference]: Start difference. First operand 178 states and 268 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:16:44,154 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2022-11-16 20:16:44,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:16:44,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-16 20:16:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:16:44,156 INFO L225 Difference]: With dead ends: 185 [2022-11-16 20:16:44,156 INFO L226 Difference]: Without dead ends: 182 [2022-11-16 20:16:44,157 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-16 20:16:44,157 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:16:44,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:16:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-16 20:16:44,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2022-11-16 20:16:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 177 states have (on average 1.5141242937853108) internal successors, (268), 178 states have internal predecessors, (268), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 270 transitions. [2022-11-16 20:16:44,169 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 270 transitions. Word has length 51 [2022-11-16 20:16:44,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:16:44,169 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 270 transitions. [2022-11-16 20:16:44,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:16:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 270 transitions. [2022-11-16 20:16:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 20:16:44,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:16:44,170 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:16:44,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 20:16:44,171 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:16:44,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:16:44,171 INFO L85 PathProgramCache]: Analyzing trace with hash 448391517, now seen corresponding path program 1 times [2022-11-16 20:16:44,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:16:44,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146689518] [2022-11-16 20:16:44,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:44,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:16:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:46,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:16:46,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146689518] [2022-11-16 20:16:46,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146689518] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:16:46,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275702682] [2022-11-16 20:16:46,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:16:46,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:16:46,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:16:46,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:16:46,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 20:16:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:16:46,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-16 20:16:46,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:16:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:47,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:16:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:16:50,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275702682] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:16:50,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1539355732] [2022-11-16 20:16:50,538 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-16 20:16:50,538 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:16:50,542 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:16:50,547 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:16:50,548 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:17:19,031 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 110 for LOIs [2022-11-16 20:17:19,052 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:17:30,210 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3722#(and (not (= (+ ~t_b~0 1) ~d~0)) (<= 0 ~wb_pc~0) (<= 0 ~t_b~0) (<= 0 ~e_wl~0) (<= 0 ~data~0) (<= 0 ~c1_pc~0) (not (= (+ ~t_b~0 2) ~d~0)) (<= 0 ~d~0) (<= 0 ~c_t~0) (<= ~wb_st~0 2) (= ~p_in~0 0) (<= ~c1_i~0 1) (= ~r_i~0 0) (<= 0 ~c2_pc~0) (<= 1 ~c1_i~0) (<= ~c1_pc~0 1) (<= 0 ~c~0) (<= 1 ~wl_i~0) (<= 0 ~processed~0) (<= 0 ~c2_st~0) (= ~wl_st~0 1) (= ~e_g~0 2) (<= ~wb_pc~0 1) (<= 1 ~c2_i~0) (= ~e_c~0 2) (= ~e_f~0 2) (<= 0 ~c_req_up~0) (<= 0 ~wb_st~0) (= ~p_out~0 0) (<= 0 ~c1_st~0) (= |#NULL.offset| 0) (<= ~c2_st~0 2) (= 2 ~wl_pc~0) (<= ~c2_i~0 1) (= ~wb_i~0 1) (<= ~c2_pc~0 1) (= ~e_p_in~0 0) (<= ~r_st~0 2) (<= ~wl_i~0 1) (<= 0 |#StackHeapBarrier|) (<= ~c1_st~0 2) (= ~e_e~0 2) (= |#NULL.base| 0))' at error location [2022-11-16 20:17:30,211 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 20:17:30,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:17:30,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 31 [2022-11-16 20:17:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907495803] [2022-11-16 20:17:30,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:17:30,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 20:17:30,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:17:30,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 20:17:30,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=3202, Unknown=0, NotChecked=0, Total=3540 [2022-11-16 20:17:30,214 INFO L87 Difference]: Start difference. First operand 180 states and 270 transitions. Second operand has 32 states, 32 states have (on average 3.78125) internal successors, (121), 31 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:17:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:17:43,509 INFO L93 Difference]: Finished difference Result 2198 states and 3152 transitions. [2022-11-16 20:17:43,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-11-16 20:17:43,512 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 31 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-16 20:17:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:17:43,520 INFO L225 Difference]: With dead ends: 2198 [2022-11-16 20:17:43,521 INFO L226 Difference]: Without dead ends: 2011 [2022-11-16 20:17:43,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14335 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=4860, Invalid=31050, Unknown=0, NotChecked=0, Total=35910 [2022-11-16 20:17:43,534 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 4266 mSDsluCounter, 2534 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4266 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:17:43,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4266 Valid, 2719 Invalid, 2743 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [642 Valid, 2101 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-16 20:17:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2022-11-16 20:17:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 541. [2022-11-16 20:17:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 538 states have (on average 1.5092936802973977) internal successors, (812), 539 states have internal predecessors, (812), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:17:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 814 transitions. [2022-11-16 20:17:43,619 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 814 transitions. Word has length 51 [2022-11-16 20:17:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:17:43,620 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 814 transitions. [2022-11-16 20:17:43,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 31 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:17:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 814 transitions. [2022-11-16 20:17:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 20:17:43,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:17:43,622 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:17:43,632 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 20:17:43,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:17:43,828 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:17:43,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:17:43,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1093240068, now seen corresponding path program 1 times [2022-11-16 20:17:43,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:17:43,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120480763] [2022-11-16 20:17:43,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:43,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:17:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:17:44,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:17:44,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120480763] [2022-11-16 20:17:44,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120480763] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:17:44,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461299392] [2022-11-16 20:17:44,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:17:44,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:17:44,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:17:44,410 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:17:44,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 20:17:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:17:44,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 20:17:44,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:17:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 20:17:44,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:17:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 31 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:17:44,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461299392] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:17:44,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2131092294] [2022-11-16 20:17:44,981 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-16 20:17:44,981 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:17:44,982 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:17:44,982 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:17:44,982 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:18:50,196 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 95 for LOIs [2022-11-16 20:18:50,203 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:18:56,476 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8136#(and (<= 2 ~e_e~0) (<= 0 ~wb_pc~0) (<= 0 ~t_b~0) (<= 0 ~e_wl~0) (<= 0 ~data~0) (<= 0 |#NULL.base|) (<= 0 ~c1_pc~0) (<= ~wb_i~0 1) (<= 0 ~d~0) (<= 0 ~c_t~0) (<= ~wb_st~0 2) (<= ~p_out~0 0) (<= ~c1_i~0 1) (<= 1 ~wb_i~0) (<= 0 ~c2_pc~0) (<= 1 ~c1_i~0) (<= ~c1_pc~0 1) (<= 0 ~e_p_in~0) (<= 2 ~e_f~0) (<= ~t_b~0 0) (<= 0 ~c~0) (<= 1 ~wl_i~0) (<= 0 ~processed~0) (<= ~e_c~0 2) (<= 0 ~p_in~0) (<= |#NULL.offset| 0) (<= 0 ~c2_st~0) (= ~wl_st~0 1) (<= ~e_e~0 2) (<= ~wb_pc~0 1) (<= 1 ~c2_i~0) (<= ~e_g~0 2) (<= 0 ~r_i~0) (<= 0 ~c_req_up~0) (<= |#NULL.base| 0) (<= 0 ~wb_st~0) (<= ~e_f~0 2) (<= ~d~0 0) (<= 0 ~c1_st~0) (<= ~c2_st~0 2) (<= 2 ~e_g~0) (<= 0 |#NULL.offset|) (<= 0 ~p_out~0) (= 2 ~wl_pc~0) (<= ~c2_i~0 1) (<= ~p_in~0 0) (<= ~c2_pc~0 1) (<= ~r_st~0 2) (<= ~wl_i~0 1) (<= 0 |#StackHeapBarrier|) (<= ~c1_st~0 2) (<= ~e_p_in~0 0) (<= ~r_i~0 0))' at error location [2022-11-16 20:18:56,476 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 20:18:56,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:18:56,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 9] total 17 [2022-11-16 20:18:56,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652247139] [2022-11-16 20:18:56,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:18:56,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 20:18:56,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:18:56,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 20:18:56,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1207, Unknown=0, NotChecked=0, Total=1482 [2022-11-16 20:18:56,479 INFO L87 Difference]: Start difference. First operand 541 states and 814 transitions. Second operand has 17 states, 17 states have (on average 8.411764705882353) internal successors, (143), 17 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:18:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:18:57,382 INFO L93 Difference]: Finished difference Result 1278 states and 1911 transitions. [2022-11-16 20:18:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 20:18:57,383 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.411764705882353) internal successors, (143), 17 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-16 20:18:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:18:57,386 INFO L225 Difference]: With dead ends: 1278 [2022-11-16 20:18:57,386 INFO L226 Difference]: Without dead ends: 629 [2022-11-16 20:18:57,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=542, Invalid=2428, Unknown=0, NotChecked=0, Total=2970 [2022-11-16 20:18:57,389 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 714 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:18:57,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 260 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 20:18:57,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-11-16 20:18:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 365. [2022-11-16 20:18:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 362 states have (on average 1.3453038674033149) internal successors, (487), 363 states have internal predecessors, (487), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:18:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 489 transitions. [2022-11-16 20:18:57,444 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 489 transitions. Word has length 59 [2022-11-16 20:18:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:18:57,445 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 489 transitions. [2022-11-16 20:18:57,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.411764705882353) internal successors, (143), 17 states have internal predecessors, (143), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:18:57,445 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 489 transitions. [2022-11-16 20:18:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 20:18:57,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:18:57,446 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:18:57,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 20:18:57,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:18:57,657 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:18:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:18:57,658 INFO L85 PathProgramCache]: Analyzing trace with hash -799140279, now seen corresponding path program 1 times [2022-11-16 20:18:57,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:18:57,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984695765] [2022-11-16 20:18:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:18:57,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:18:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:19:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 21 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:19:00,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:19:00,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984695765] [2022-11-16 20:19:00,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984695765] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:19:00,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595913003] [2022-11-16 20:19:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:19:00,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:19:00,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:19:00,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:19:00,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 20:19:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:19:00,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 20:19:00,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:19:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 22 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 20:19:11,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:19:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:19:22,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595913003] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:19:22,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [683772772] [2022-11-16 20:19:22,010 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-16 20:19:22,010 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:19:22,010 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:19:22,011 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:19:22,011 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:20:16,281 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 110 for LOIs [2022-11-16 20:20:16,293 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:20:27,896 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10755#(and (not (= (+ ~t_b~0 1) ~d~0)) (<= 0 ~wb_pc~0) (<= 0 ~t_b~0) (<= 0 ~e_wl~0) (<= 0 ~data~0) (<= 0 ~c1_pc~0) (not (= (+ ~t_b~0 2) ~d~0)) (<= 0 ~d~0) (<= 0 ~c_t~0) (<= ~wb_st~0 2) (= ~p_in~0 0) (<= ~c1_i~0 1) (<= 0 ~c2_pc~0) (<= 1 ~c1_i~0) (<= ~c1_pc~0 1) (<= 0 ~c~0) (<= 1 ~wl_i~0) (<= 0 ~processed~0) (<= ~e_wl~0 2) (<= 0 ~c2_st~0) (= ~wl_st~0 1) (<= ~wb_pc~0 1) (<= 1 ~c2_i~0) (<= ~e_g~0 2) (= ~e_c~0 2) (<= 0 ~r_i~0) (= ~e_f~0 2) (<= 0 ~c_req_up~0) (<= 0 ~wb_st~0) (= ~p_out~0 0) (<= 0 ~c1_st~0) (= |#NULL.offset| 0) (<= ~c2_st~0 2) (<= 2 ~e_g~0) (= 2 ~wl_pc~0) (<= ~c2_i~0 1) (= ~wb_i~0 1) (<= ~c2_pc~0 1) (= ~e_p_in~0 0) (<= ~r_st~0 2) (<= ~wl_i~0 1) (<= 0 |#StackHeapBarrier|) (<= ~c1_st~0 2) (= ~e_e~0 2) (= |#NULL.base| 0) (<= ~r_i~0 0))' at error location [2022-11-16 20:20:27,896 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 20:20:27,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:20:27,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 12] total 27 [2022-11-16 20:20:27,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287033493] [2022-11-16 20:20:27,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:20:27,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 20:20:27,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:20:27,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 20:20:27,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2756, Unknown=0, NotChecked=0, Total=3080 [2022-11-16 20:20:27,900 INFO L87 Difference]: Start difference. First operand 365 states and 489 transitions. Second operand has 28 states, 28 states have (on average 5.5) internal successors, (154), 27 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:20:32,089 INFO L93 Difference]: Finished difference Result 1328 states and 1776 transitions. [2022-11-16 20:20:32,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-16 20:20:32,090 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.5) internal successors, (154), 27 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-11-16 20:20:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:20:32,094 INFO L225 Difference]: With dead ends: 1328 [2022-11-16 20:20:32,094 INFO L226 Difference]: Without dead ends: 985 [2022-11-16 20:20:32,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 138 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3034 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=905, Invalid=6577, Unknown=0, NotChecked=0, Total=7482 [2022-11-16 20:20:32,097 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 1380 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:20:32,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 676 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-16 20:20:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2022-11-16 20:20:32,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 340. [2022-11-16 20:20:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 337 states have (on average 1.3649851632047478) internal successors, (460), 338 states have internal predecessors, (460), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 462 transitions. [2022-11-16 20:20:32,183 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 462 transitions. Word has length 63 [2022-11-16 20:20:32,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:20:32,184 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 462 transitions. [2022-11-16 20:20:32,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.5) internal successors, (154), 27 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:32,185 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 462 transitions. [2022-11-16 20:20:32,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-16 20:20:32,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:20:32,186 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:20:32,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 20:20:32,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 20:20:32,392 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:20:32,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:20:32,393 INFO L85 PathProgramCache]: Analyzing trace with hash 347496033, now seen corresponding path program 1 times [2022-11-16 20:20:32,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:20:32,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548103868] [2022-11-16 20:20:32,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:20:32,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:20:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:20:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-16 20:20:32,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:20:32,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548103868] [2022-11-16 20:20:32,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548103868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:20:32,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:20:32,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:20:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449338902] [2022-11-16 20:20:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:20:32,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:20:32,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:20:32,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:20:32,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:20:32,455 INFO L87 Difference]: Start difference. First operand 340 states and 462 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:20:32,562 INFO L93 Difference]: Finished difference Result 664 states and 904 transitions. [2022-11-16 20:20:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:20:32,563 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-11-16 20:20:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:20:32,565 INFO L225 Difference]: With dead ends: 664 [2022-11-16 20:20:32,565 INFO L226 Difference]: Without dead ends: 338 [2022-11-16 20:20:32,566 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-16 20:20:32,566 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:20:32,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 91 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:20:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-11-16 20:20:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 328. [2022-11-16 20:20:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 325 states have (on average 1.3138461538461539) internal successors, (427), 326 states have internal predecessors, (427), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 429 transitions. [2022-11-16 20:20:32,632 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 429 transitions. Word has length 68 [2022-11-16 20:20:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:20:32,632 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 429 transitions. [2022-11-16 20:20:32,632 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 429 transitions. [2022-11-16 20:20:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-16 20:20:32,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:20:32,634 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 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-16 20:20:32,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 20:20:32,634 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:20:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:20:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash 917226201, now seen corresponding path program 1 times [2022-11-16 20:20:32,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:20:32,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670157162] [2022-11-16 20:20:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:20:32,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:20:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:20:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 45 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 20:20:32,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:20:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670157162] [2022-11-16 20:20:32,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670157162] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:20:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361486936] [2022-11-16 20:20:32,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:20:32,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:20:32,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:20:32,963 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:20:32,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 20:20:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:20:33,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 20:20:33,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:20:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 20:20:33,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:20:33,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361486936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:20:33,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 20:20:33,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2022-11-16 20:20:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081169296] [2022-11-16 20:20:33,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:20:33,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 20:20:33,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:20:33,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 20:20:33,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-16 20:20:33,179 INFO L87 Difference]: Start difference. First operand 328 states and 429 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:20:33,403 INFO L93 Difference]: Finished difference Result 726 states and 949 transitions. [2022-11-16 20:20:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:20:33,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-11-16 20:20:33,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:20:33,405 INFO L225 Difference]: With dead ends: 726 [2022-11-16 20:20:33,406 INFO L226 Difference]: Without dead ends: 400 [2022-11-16 20:20:33,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-16 20:20:33,407 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 104 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:20:33,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 337 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:20:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-11-16 20:20:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 298. [2022-11-16 20:20:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 295 states have (on average 1.2372881355932204) internal successors, (365), 296 states have internal predecessors, (365), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 367 transitions. [2022-11-16 20:20:33,483 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 367 transitions. Word has length 70 [2022-11-16 20:20:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:20:33,483 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 367 transitions. [2022-11-16 20:20:33,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 367 transitions. [2022-11-16 20:20:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-16 20:20:33,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:20:33,485 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:20:33,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 20:20:33,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:20:33,690 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:20:33,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:20:33,691 INFO L85 PathProgramCache]: Analyzing trace with hash 223775033, now seen corresponding path program 1 times [2022-11-16 20:20:33,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:20:33,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324012389] [2022-11-16 20:20:33,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:20:33,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:20:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:20:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 20:20:33,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:20:33,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324012389] [2022-11-16 20:20:33,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324012389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:20:33,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:20:33,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:20:33,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44115414] [2022-11-16 20:20:33,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:20:33,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:20:33,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:20:33,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:20:33,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:20:33,777 INFO L87 Difference]: Start difference. First operand 298 states and 367 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:33,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:20:33,860 INFO L93 Difference]: Finished difference Result 423 states and 519 transitions. [2022-11-16 20:20:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:20:33,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-11-16 20:20:33,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:20:33,861 INFO L225 Difference]: With dead ends: 423 [2022-11-16 20:20:33,862 INFO L226 Difference]: Without dead ends: 139 [2022-11-16 20:20:33,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:20:33,863 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 5 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:20:33,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 139 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:20:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-16 20:20:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-11-16 20:20:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 136 states have (on average 1.2058823529411764) internal successors, (164), 137 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 166 transitions. [2022-11-16 20:20:33,908 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 166 transitions. Word has length 71 [2022-11-16 20:20:33,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:20:33,908 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 166 transitions. [2022-11-16 20:20:33,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 166 transitions. [2022-11-16 20:20:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-16 20:20:33,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:20:33,909 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:20:33,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 20:20:33,910 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:20:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:20:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1706906252, now seen corresponding path program 1 times [2022-11-16 20:20:33,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:20:33,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487936432] [2022-11-16 20:20:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:20:33,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:20:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:20:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 47 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 20:20:34,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:20:34,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487936432] [2022-11-16 20:20:34,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487936432] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:20:34,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790608004] [2022-11-16 20:20:34,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:20:34,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:20:34,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:20:34,249 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:20:34,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 20:20:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:20:34,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 20:20:34,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:20:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-16 20:20:34,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:20:34,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790608004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:20:34,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 20:20:34,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2022-11-16 20:20:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339936058] [2022-11-16 20:20:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:20:34,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 20:20:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:20:34,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 20:20:34,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-16 20:20:34,474 INFO L87 Difference]: Start difference. First operand 139 states and 166 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:20:34,615 INFO L93 Difference]: Finished difference Result 268 states and 321 transitions. [2022-11-16 20:20:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:20:34,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-11-16 20:20:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:20:34,616 INFO L225 Difference]: With dead ends: 268 [2022-11-16 20:20:34,616 INFO L226 Difference]: Without dead ends: 149 [2022-11-16 20:20:34,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-16 20:20:34,617 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 121 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:20:34,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 152 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:20:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-16 20:20:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2022-11-16 20:20:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 145 states have (on average 1.1448275862068966) internal successors, (166), 146 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2022-11-16 20:20:34,670 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 72 [2022-11-16 20:20:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:20:34,670 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2022-11-16 20:20:34,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:20:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2022-11-16 20:20:34,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 20:20:34,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:20:34,672 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:20:34,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-16 20:20:34,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 20:20:34,877 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:20:34,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:20:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1922429713, now seen corresponding path program 1 times [2022-11-16 20:20:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:20:34,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495986082] [2022-11-16 20:20:34,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:20:34,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:20:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:20:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 39 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:20:35,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:20:35,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495986082] [2022-11-16 20:20:35,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495986082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:20:35,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104310316] [2022-11-16 20:20:35,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:20:35,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:20:35,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:20:35,963 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:20:35,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 20:20:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:20:36,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 20:20:36,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:20:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 37 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:20:36,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:20:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 20:20:36,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104310316] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:20:36,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1665820545] [2022-11-16 20:20:36,984 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2022-11-16 20:20:36,985 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:20:36,987 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:20:36,987 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:20:36,988 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:23:24,136 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 93 for LOIs [2022-11-16 20:23:24,143 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:23:32,419 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '17963#(and (<= 2 ~e_e~0) (not (= (+ ~t_b~0 1) ~d~0)) (<= 0 ~wb_pc~0) (<= 0 ~t_b~0) (<= 0 ~e_wl~0) (<= 0 ~data~0) (<= 0 |#NULL.base|) (<= 0 ~c1_pc~0) (not (= (+ ~t_b~0 2) ~d~0)) (<= ~wb_i~0 1) (<= 0 ~d~0) (<= 0 ~c_t~0) (<= ~wb_st~0 2) (<= ~p_out~0 0) (<= ~c1_i~0 1) (<= 1 ~wb_i~0) (<= 0 ~c2_pc~0) (<= 1 ~c1_i~0) (<= ~c1_pc~0 1) (<= 0 ~e_p_in~0) (<= 2 ~e_f~0) (<= 0 ~c~0) (<= 1 ~wl_i~0) (<= 0 ~processed~0) (<= ~e_c~0 2) (<= 0 ~p_in~0) (<= |#NULL.offset| 0) (<= 0 ~c2_st~0) (= ~wl_st~0 1) (<= ~e_e~0 2) (<= ~wb_pc~0 1) (<= 1 ~c2_i~0) (<= ~e_g~0 2) (<= 0 ~r_i~0) (<= 0 ~c_req_up~0) (<= |#NULL.base| 0) (<= 0 ~wb_st~0) (<= ~e_f~0 2) (<= 0 ~c1_st~0) (<= ~c2_st~0 2) (<= 2 ~e_g~0) (<= 0 |#NULL.offset|) (<= 0 ~p_out~0) (= 2 ~wl_pc~0) (<= ~c2_i~0 1) (<= ~p_in~0 0) (<= ~c2_pc~0 1) (<= ~r_st~0 2) (<= ~wl_i~0 1) (<= 0 |#StackHeapBarrier|) (<= ~c1_st~0 2) (<= ~e_p_in~0 0) (<= ~r_i~0 0))' at error location [2022-11-16 20:23:32,420 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 20:23:32,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:23:32,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 11] total 29 [2022-11-16 20:23:32,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350155625] [2022-11-16 20:23:32,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:23:32,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 20:23:32,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:23:32,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 20:23:32,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=2769, Unknown=0, NotChecked=0, Total=3192 [2022-11-16 20:23:32,423 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand has 30 states, 30 states have (on average 5.2) internal successors, (156), 29 states have internal predecessors, (156), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:23:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:23:36,055 INFO L93 Difference]: Finished difference Result 479 states and 544 transitions. [2022-11-16 20:23:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-16 20:23:36,056 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 29 states have internal predecessors, (156), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-11-16 20:23:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:23:36,057 INFO L225 Difference]: With dead ends: 479 [2022-11-16 20:23:36,058 INFO L226 Difference]: Without dead ends: 365 [2022-11-16 20:23:36,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 169 SyntacticMatches, 10 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4712 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1566, Invalid=10424, Unknown=0, NotChecked=0, Total=11990 [2022-11-16 20:23:36,061 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 1492 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 20:23:36,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 484 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 20:23:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-16 20:23:36,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 121. [2022-11-16 20:23:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 118 states have (on average 1.1271186440677967) internal successors, (133), 119 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:23:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2022-11-16 20:23:36,101 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 74 [2022-11-16 20:23:36,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:23:36,102 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2022-11-16 20:23:36,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.2) internal successors, (156), 29 states have internal predecessors, (156), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:23:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2022-11-16 20:23:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-16 20:23:36,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:23:36,103 INFO L195 NwaCegarLoop]: trace histogram [6, 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-16 20:23:36,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 20:23:36,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 20:23:36,309 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:23:36,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:23:36,310 INFO L85 PathProgramCache]: Analyzing trace with hash -676016500, now seen corresponding path program 1 times [2022-11-16 20:23:36,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:23:36,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863806463] [2022-11-16 20:23:36,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:23:36,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:23:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:23:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:23:39,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:23:39,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863806463] [2022-11-16 20:23:39,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863806463] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:23:39,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82029742] [2022-11-16 20:23:39,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:23:39,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:23:39,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:23:39,207 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:23:39,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 20:23:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:23:39,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 20:23:39,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:23:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:23:41,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:23:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 8 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:23:45,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82029742] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 20:23:45,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2072795605] [2022-11-16 20:23:45,334 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2022-11-16 20:23:45,334 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:23:45,335 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:23:45,335 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:23:45,335 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:25:59,423 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 93 for LOIs [2022-11-16 20:25:59,431 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:26:09,197 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '19397#(and (<= 2 ~e_e~0) (not (= (+ ~t_b~0 1) ~d~0)) (<= 0 ~wb_pc~0) (<= 0 ~t_b~0) (<= 0 ~e_wl~0) (<= 0 ~data~0) (<= 0 |#NULL.base|) (<= 0 ~c1_pc~0) (not (= (+ ~t_b~0 2) ~d~0)) (<= ~wb_i~0 1) (<= 0 ~d~0) (<= 0 ~c_t~0) (<= ~wb_st~0 2) (<= ~p_out~0 0) (<= ~c1_i~0 1) (<= 1 ~wb_i~0) (<= 0 ~c2_pc~0) (<= 1 ~c1_i~0) (<= ~c1_pc~0 1) (<= 0 ~e_p_in~0) (<= 2 ~e_f~0) (<= 0 ~c~0) (<= 1 ~wl_i~0) (<= 0 ~processed~0) (<= ~e_c~0 2) (<= 0 ~p_in~0) (<= |#NULL.offset| 0) (<= 0 ~c2_st~0) (= ~wl_st~0 1) (<= ~e_e~0 2) (<= ~wb_pc~0 1) (<= 1 ~c2_i~0) (<= ~e_g~0 2) (<= 0 ~r_i~0) (<= 0 ~c_req_up~0) (<= |#NULL.base| 0) (<= 0 ~wb_st~0) (<= ~e_f~0 2) (<= 0 ~c1_st~0) (<= ~c2_st~0 2) (<= 2 ~e_g~0) (<= 0 |#NULL.offset|) (<= 0 ~p_out~0) (= 2 ~wl_pc~0) (<= ~c2_i~0 1) (<= ~p_in~0 0) (<= ~c2_pc~0 1) (<= ~r_st~0 2) (<= ~wl_i~0 1) (<= 0 |#StackHeapBarrier|) (<= ~c1_st~0 2) (<= ~e_p_in~0 0) (<= ~r_i~0 0))' at error location [2022-11-16 20:26:09,197 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 20:26:09,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 20:26:09,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14, 14] total 46 [2022-11-16 20:26:09,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161763401] [2022-11-16 20:26:09,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 20:26:09,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-16 20:26:09,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:26:09,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-16 20:26:09,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=4995, Unknown=0, NotChecked=0, Total=5402 [2022-11-16 20:26:09,201 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand has 47 states, 47 states have (on average 4.468085106382978) internal successors, (210), 46 states have internal predecessors, (210), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:26:18,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:26:18,355 INFO L93 Difference]: Finished difference Result 562 states and 628 transitions. [2022-11-16 20:26:18,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-11-16 20:26:18,356 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 4.468085106382978) internal successors, (210), 46 states have internal predecessors, (210), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-11-16 20:26:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:26:18,358 INFO L225 Difference]: With dead ends: 562 [2022-11-16 20:26:18,358 INFO L226 Difference]: Without dead ends: 492 [2022-11-16 20:26:18,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 165 SyntacticMatches, 12 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8754 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=2048, Invalid=21514, Unknown=0, NotChecked=0, Total=23562 [2022-11-16 20:26:18,362 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 1473 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:26:18,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1433 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-16 20:26:18,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-16 20:26:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 169. [2022-11-16 20:26:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 166 states have (on average 1.1265060240963856) internal successors, (187), 167 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:26:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 189 transitions. [2022-11-16 20:26:18,422 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 189 transitions. Word has length 76 [2022-11-16 20:26:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:26:18,422 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 189 transitions. [2022-11-16 20:26:18,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 4.468085106382978) internal successors, (210), 46 states have internal predecessors, (210), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:26:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 189 transitions. [2022-11-16 20:26:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 20:26:18,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:26:18,423 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:26:18,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 20:26:18,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 20:26:18,624 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:26:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:26:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash 517890485, now seen corresponding path program 1 times [2022-11-16 20:26:18,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:26:18,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232638036] [2022-11-16 20:26:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:26:18,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:26:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:26:18,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 20:26:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:26:18,739 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-16 20:26:18,740 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 20:26:18,741 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 20:26:18,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 20:26:18,746 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:26:18,753 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 20:26:18,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:26:18 BoogieIcfgContainer [2022-11-16 20:26:18,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 20:26:18,899 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 20:26:18,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 20:26:18,900 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 20:26:18,900 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:16:40" (3/4) ... [2022-11-16 20:26:18,902 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 20:26:18,993 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/witness.graphml [2022-11-16 20:26:18,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 20:26:18,994 INFO L158 Benchmark]: Toolchain (without parser) took 579616.01ms. Allocated memory was 144.7MB in the beginning and 989.9MB in the end (delta: 845.2MB). Free memory was 105.7MB in the beginning and 594.4MB in the end (delta: -488.7MB). Peak memory consumption was 355.1MB. Max. memory is 16.1GB. [2022-11-16 20:26:18,994 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 144.7MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:26:18,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.84ms. Allocated memory is still 144.7MB. Free memory was 105.4MB in the beginning and 115.7MB in the end (delta: -10.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 20:26:18,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.40ms. Allocated memory is still 144.7MB. Free memory was 115.7MB in the beginning and 113.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 20:26:18,995 INFO L158 Benchmark]: Boogie Preprocessor took 53.63ms. Allocated memory is still 144.7MB. Free memory was 113.6MB in the beginning and 111.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 20:26:18,996 INFO L158 Benchmark]: RCFGBuilder took 1086.14ms. Allocated memory is still 144.7MB. Free memory was 111.5MB in the beginning and 103.4MB in the end (delta: 8.1MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2022-11-16 20:26:18,996 INFO L158 Benchmark]: TraceAbstraction took 577927.29ms. Allocated memory was 144.7MB in the beginning and 989.9MB in the end (delta: 845.2MB). Free memory was 102.5MB in the beginning and 608.0MB in the end (delta: -505.6MB). Peak memory consumption was 340.4MB. Max. memory is 16.1GB. [2022-11-16 20:26:18,996 INFO L158 Benchmark]: Witness Printer took 94.15ms. Allocated memory is still 989.9MB. Free memory was 608.0MB in the beginning and 594.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 20:26:18,998 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.26ms. Allocated memory is still 144.7MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.84ms. Allocated memory is still 144.7MB. Free memory was 105.4MB in the beginning and 115.7MB in the end (delta: -10.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.40ms. Allocated memory is still 144.7MB. Free memory was 115.7MB in the beginning and 113.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.63ms. Allocated memory is still 144.7MB. Free memory was 113.6MB in the beginning and 111.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1086.14ms. Allocated memory is still 144.7MB. Free memory was 111.5MB in the beginning and 103.4MB in the end (delta: 8.1MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. * TraceAbstraction took 577927.29ms. Allocated memory was 144.7MB in the beginning and 989.9MB in the end (delta: 845.2MB). Free memory was 102.5MB in the beginning and 608.0MB in the end (delta: -505.6MB). Peak memory consumption was 340.4MB. Max. memory is 16.1GB. * Witness Printer took 94.15ms. Allocated memory is still 989.9MB. Free memory was 608.0MB in the beginning and 594.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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 - CounterExampleResult [Line: 23]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L52] int e_wl ; [L41] int wb_i ; [L59] int data ; [L38] int wl_i ; [L45] int c2_pc ; [L50] int e_c ; [L47] int e_e ; [L49] int e_g ; [L48] int e_f ; [L61] static int t_b ; [L34] int c1_st ; [L29] int c_t ; [L42] int r_i ; [L46] int wb_pc ; [L31] int p_in ; [L43] int wl_pc ; [L28] int c ; [L58] int d ; [L51] int e_p_in ; [L30] int c_req_up ; [L32] int p_out ; [L44] int c1_pc ; [L36] int wb_st ; [L60] int processed ; [L33] int wl_st ; [L40] int c2_i ; [L39] int c1_i ; [L35] int c2_st ; [L37] int r_st ; [L701] int __retres1 ; [L705] e_wl = 2 [L706] e_c = e_wl [L707] e_g = e_c [L708] e_f = e_g [L709] e_e = e_f [L710] wl_pc = 0 [L711] c1_pc = 0 [L712] c2_pc = 0 [L713] wb_pc = 0 [L714] wb_i = 1 [L715] c2_i = wb_i [L716] c1_i = c2_i [L717] wl_i = c1_i [L718] r_i = 0 [L719] c_req_up = 0 [L720] d = 0 [L721] c = 0 [L722] CALL start_simulation() [L412] int kernel_st ; [L415] kernel_st = 0 [L416] COND FALSE !((int )c_req_up == 1) [L427] COND TRUE (int )wl_i == 1 [L428] wl_st = 0 [L432] COND TRUE (int )c1_i == 1 [L433] c1_st = 0 [L437] COND TRUE (int )c2_i == 1 [L438] c2_st = 0 [L442] COND TRUE (int )wb_i == 1 [L443] wb_st = 0 [L447] COND FALSE !((int )r_i == 1) [L450] r_st = 2 [L452] COND FALSE !((int )e_f == 0) [L457] COND FALSE !((int )e_g == 0) [L462] COND FALSE !((int )e_e == 0) [L467] COND FALSE !((int )e_c == 0) [L472] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L485] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L495] COND FALSE !((int )c1_pc == 1) [L504] COND FALSE !((int )c2_pc == 1) [L513] COND FALSE !((int )wb_pc == 1) [L522] COND FALSE !((int )e_c == 1) [L527] COND FALSE !((int )e_e == 1) [L532] COND FALSE !((int )e_f == 1) [L537] COND FALSE !((int )e_g == 1) [L542] COND FALSE !((int )e_c == 1) [L547] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L553] COND TRUE 1 [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L306] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L308] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND TRUE \read(tmp) [L335] wl_st = 1 [L336] CALL write_loop() [L63] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L66] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L80] wl_st = 2 [L81] wl_pc = 1 [L82] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L336] RET write_loop() [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND TRUE \read(tmp___0) [L350] c1_st = 1 [L351] CALL compute1() [L149] COND TRUE (int )c1_pc == 0 [L160] COND TRUE 1 [L162] c1_st = 2 [L163] c1_pc = 1 [L351] RET compute1() [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND TRUE \read(tmp___1) [L365] c2_st = 1 [L366] CALL compute2() [L194] COND TRUE (int )c2_pc == 0 [L205] COND TRUE 1 [L207] c2_st = 2 [L208] c2_pc = 1 [L366] RET compute2() [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND TRUE \read(tmp___2) [L380] wb_st = 1 [L381] CALL write_back() [L239] COND TRUE (int )wb_pc == 0 [L250] COND TRUE 1 [L252] wb_st = 2 [L253] wb_pc = 1 [L381] RET write_back() [L389] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=-1, tmp___1=-2, tmp___2=-3, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L306] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=-1, tmp___1=-2, tmp___2=-3, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L308] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=-1, tmp___1=-2, tmp___2=-3, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L311] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=-1, tmp___1=-2, tmp___2=-3, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L314] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=-1, tmp___1=-2, tmp___2=-3, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L317] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=-1, tmp___1=-2, tmp___2=-3, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L320] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=-1, tmp___1=-2, tmp___2=-3, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L557] RET eval() [L559] kernel_st = 2 [L560] COND FALSE !((int )c_req_up == 1) [L571] kernel_st = 3 [L572] COND FALSE !((int )e_f == 0) [L577] COND FALSE !((int )e_g == 0) [L582] COND FALSE !((int )e_e == 0) [L587] COND FALSE !((int )e_c == 0) [L592] COND TRUE (int )e_wl == 0 [L593] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L597] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L598] COND TRUE (int )e_wl == 1 [L599] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L615] COND TRUE (int )c1_pc == 1 [L616] COND FALSE !((int )e_f == 1) [L624] COND TRUE (int )c2_pc == 1 [L625] COND FALSE !((int )e_f == 1) [L633] COND TRUE (int )wb_pc == 1 [L634] COND FALSE !((int )e_g == 1) [L642] COND FALSE !((int )e_c == 1) [L647] COND FALSE !((int )e_e == 1) [L652] COND FALSE !((int )e_f == 1) [L657] COND FALSE !((int )e_g == 1) [L662] COND FALSE !((int )e_c == 1) [L667] COND TRUE (int )e_wl == 1 [L668] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L672] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L553] COND TRUE 1 [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L306] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L308] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND TRUE \read(tmp) [L335] wl_st = 1 [L336] CALL write_loop() [L63] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L66] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L69] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L72] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L87] COND TRUE 1 [L89] t = d [L90] data = d [L91] processed = 0 [L92] e_f = 1 [L93] COND TRUE (int )c1_pc == 1 [L94] COND TRUE (int )e_f == 1 [L95] c1_st = 0 [L102] COND TRUE (int )c2_pc == 1 [L103] COND TRUE (int )e_f == 1 [L104] c2_st = 0 [L111] e_f = 2 [L112] wl_st = 2 [L113] wl_pc = 2 [L114] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L336] RET write_loop() [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND TRUE \read(tmp___0) [L350] c1_st = 1 [L351] CALL compute1() [L149] COND FALSE !((int )c1_pc == 0) [L152] COND TRUE (int )c1_pc == 1 [L167] COND TRUE ! processed [L168] data += 1 [L169] e_g = 1 [L170] COND TRUE (int )wb_pc == 1 [L171] COND TRUE (int )e_g == 1 [L172] wb_st = 0 [L179] e_g = 2 [L160] COND TRUE 1 [L162] c1_st = 2 [L163] c1_pc = 1 [L351] RET compute1() [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND TRUE \read(tmp___1) [L365] c2_st = 1 [L366] CALL compute2() [L194] COND FALSE !((int )c2_pc == 0) [L197] COND TRUE (int )c2_pc == 1 [L212] COND TRUE ! processed [L213] data += 1 [L214] e_g = 1 [L215] COND TRUE (int )wb_pc == 1 [L216] COND TRUE (int )e_g == 1 [L217] wb_st = 0 [L224] e_g = 2 [L205] COND TRUE 1 [L207] c2_st = 2 [L208] c2_pc = 1 [L366] RET compute2() [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND TRUE \read(tmp___2) [L380] wb_st = 1 [L381] CALL write_back() [L239] COND FALSE !((int )wb_pc == 0) [L242] COND TRUE (int )wb_pc == 1 [L257] c_t = data [L258] c_req_up = 1 [L259] processed = 1 [L250] COND TRUE 1 [L252] wb_st = 2 [L253] wb_pc = 1 [L381] RET write_back() [L389] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=4, tmp___1=-4, tmp___2=5, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L306] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=4, tmp___1=-4, tmp___2=5, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L308] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=4, tmp___1=-4, tmp___2=5, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L311] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=4, tmp___1=-4, tmp___2=5, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L314] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=4, tmp___1=-4, tmp___2=5, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L317] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=4, tmp___1=-4, tmp___2=5, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L320] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp=1, tmp___0=4, tmp___1=-4, tmp___2=5, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L557] RET eval() [L559] kernel_st = 2 [L560] COND TRUE (int )c_req_up == 1 [L561] COND TRUE c != c_t [L562] c = c_t [L563] e_c = 0 [L567] c_req_up = 0 [L571] kernel_st = 3 [L572] COND FALSE !((int )e_f == 0) [L577] COND FALSE !((int )e_g == 0) [L582] COND FALSE !((int )e_e == 0) [L587] COND TRUE (int )e_c == 0 [L588] e_c = 1 [L592] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L597] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L605] COND TRUE (int )wl_pc == 2 [L606] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L615] COND TRUE (int )c1_pc == 1 [L616] COND FALSE !((int )e_f == 1) [L624] COND TRUE (int )c2_pc == 1 [L625] COND FALSE !((int )e_f == 1) [L633] COND TRUE (int )wb_pc == 1 [L634] COND FALSE !((int )e_g == 1) [L642] COND TRUE (int )e_c == 1 [L643] r_st = 0 [L647] COND FALSE !((int )e_e == 1) [L652] COND FALSE !((int )e_f == 1) [L657] COND FALSE !((int )e_g == 1) [L662] COND TRUE (int )e_c == 1 [L663] e_c = 2 [L667] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L672] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L675] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L678] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L681] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L684] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=3, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L553] COND TRUE 1 [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L306] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L308] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L311] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L314] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L317] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L320] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L329] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L344] COND FALSE !((int )c1_st == 0) [L359] COND FALSE !((int )c2_st == 0) [L374] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, tmp___0=-5, tmp___1=6, tmp___2=-6, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L389] COND TRUE (int )r_st == 0 [L391] tmp___3 = __VERIFIER_nondet_int() [L393] COND TRUE \read(tmp___3) [L395] r_st = 1 [L396] CALL read() [L271] d = c [L272] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L273] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L281] COND TRUE (int )wl_pc == 2 [L282] COND TRUE (int )e_e == 1 [L283] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L291] e_e = 2 [L292] r_st = 2 [L396] RET read() [L306] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp___0=-5, tmp___1=6, tmp___2=-6, tmp___3=7, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L308] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, tmp___0=-5, tmp___1=6, tmp___2=-6, tmp___3=7, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND TRUE \read(tmp) [L335] wl_st = 1 [L336] CALL write_loop() [L63] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L66] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L69] COND TRUE (int )wl_pc == 2 [L118] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L119] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L122] COND TRUE d == t + 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L130] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L134] CALL error() VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L23] reach_error() VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 577.7s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9777 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9777 mSDsluCounter, 7027 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5836 mSDsCounter, 1576 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6462 IncrementalHoareTripleChecker+Invalid, 8038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1576 mSolverCounterUnsat, 1191 mSDtfsCounter, 6462 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1592 GetRequests, 941 SyntacticMatches, 31 SemanticMatches, 620 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31988 ImplicationChecksByTransitivity, 74.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=541occurred in iteration=8, InterpolantAutomatonStates: 383, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 3130 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 44.1s InterpolantComputationTime, 1460 NumberOfCodeBlocks, 1460 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1676 ConstructedInterpolants, 0 QuantifiedInterpolants, 19277 SizeOfPredicates, 144 NumberOfNonLiveVariables, 2133 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 786/1346 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 20:26:19,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f076c9fe-f278-4c9d-a490-5f4ee1124def/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE