./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur --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 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- 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-38b53e6 [2022-11-26 00:39:26,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:39:26,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:39:26,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:39:26,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:39:26,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:39:26,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:39:26,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:39:26,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:39:26,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:39:26,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:39:26,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:39:26,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:39:26,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:39:26,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:39:26,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:39:26,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:39:26,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:39:26,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:39:26,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:39:26,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:39:26,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:39:26,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:39:26,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:39:26,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:39:26,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:39:26,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:39:26,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:39:26,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:39:26,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:39:26,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:39:26,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:39:26,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:39:26,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:39:26,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:39:26,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:39:26,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:39:26,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:39:26,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:39:26,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:39:26,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:39:26,246 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:39:26,286 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:39:26,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:39:26,287 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:39:26,287 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:39:26,288 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:39:26,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:39:26,289 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:39:26,289 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:39:26,289 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:39:26,289 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:39:26,290 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:39:26,291 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:39:26,291 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:39:26,291 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:39:26,291 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:39:26,292 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:39:26,292 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:39:26,292 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:39:26,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:39:26,293 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:39:26,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:39:26,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:39:26,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:39:26,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:39:26,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:39:26,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:39:26,295 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:39:26,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:39:26,295 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:39:26,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:39:26,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:39:26,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:39:26,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:39:26,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:39:26,297 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:39:26,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:39:26,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:39:26,297 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:39:26,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:39:26,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:39:26,298 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:39:26,298 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_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/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_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur 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 -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2022-11-26 00:39:26,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:39:26,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:39:26,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:39:26,650 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:39:26,651 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:39:26,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/locks/test_locks_14-1.c [2022-11-26 00:39:29,683 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:39:29,855 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:39:29,856 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/sv-benchmarks/c/locks/test_locks_14-1.c [2022-11-26 00:39:29,863 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/data/3f8a0ae73/ac80da61bda44c2786850c82b0135053/FLAG375516804 [2022-11-26 00:39:29,881 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/data/3f8a0ae73/ac80da61bda44c2786850c82b0135053 [2022-11-26 00:39:29,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:39:29,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:39:29,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:39:29,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:39:29,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:39:29,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:39:29" (1/1) ... [2022-11-26 00:39:29,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@168d7804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:29, skipping insertion in model container [2022-11-26 00:39:29,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:39:29" (1/1) ... [2022-11-26 00:39:29,900 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:39:29,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:39:30,089 WARN L237 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_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2022-11-26 00:39:30,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:39:30,104 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:39:30,133 WARN L237 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_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2022-11-26 00:39:30,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:39:30,148 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:39:30,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:30 WrapperNode [2022-11-26 00:39:30,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:39:30,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:39:30,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:39:30,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:39:30,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:30" (1/1) ... [2022-11-26 00:39:30,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:30" (1/1) ... [2022-11-26 00:39:30,186 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 182 [2022-11-26 00:39:30,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:39:30,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:39:30,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:39:30,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:39:30,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:30" (1/1) ... [2022-11-26 00:39:30,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:30" (1/1) ... [2022-11-26 00:39:30,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:30" (1/1) ... [2022-11-26 00:39:30,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:30" (1/1) ... [2022-11-26 00:39:30,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:30" (1/1) ... [2022-11-26 00:39:30,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:30" (1/1) ... [2022-11-26 00:39:30,209 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:30" (1/1) ... [2022-11-26 00:39:30,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:30" (1/1) ... [2022-11-26 00:39:30,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:39:30,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:39:30,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:39:30,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:39:30,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:30" (1/1) ... [2022-11-26 00:39:30,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:39:30,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:39:30,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:39:30,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:39:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:39:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:39:30,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:39:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:39:30,426 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:39:30,428 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:39:30,787 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:39:30,958 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:39:30,959 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-26 00:39:30,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:39:30 BoogieIcfgContainer [2022-11-26 00:39:30,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:39:30,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:39:30,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:39:30,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:39:30,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:39:29" (1/3) ... [2022-11-26 00:39:30,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0e3b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:39:30, skipping insertion in model container [2022-11-26 00:39:30,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:39:30" (2/3) ... [2022-11-26 00:39:30,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0e3b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:39:30, skipping insertion in model container [2022-11-26 00:39:30,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:39:30" (3/3) ... [2022-11-26 00:39:30,975 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2022-11-26 00:39:30,996 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:39:30,996 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:39:31,043 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:39:31,049 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;@302bfe48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:39:31,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 00:39:31,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 34 states have (on average 1.911764705882353) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:39:31,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:31,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:39:31,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:31,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:31,066 INFO L85 PathProgramCache]: Analyzing trace with hash -96656291, now seen corresponding path program 1 times [2022-11-26 00:39:31,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:31,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025025275] [2022-11-26 00:39:31,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:31,382 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-26 00:39:31,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:31,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025025275] [2022-11-26 00:39:31,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025025275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:31,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:31,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:31,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186774153] [2022-11-26 00:39:31,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:31,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:31,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:31,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:31,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:31,422 INFO L87 Difference]: Start difference. First operand has 36 states, 34 states have (on average 1.911764705882353) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:31,481 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2022-11-26 00:39:31,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:31,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:39:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:31,492 INFO L225 Difference]: With dead ends: 74 [2022-11-26 00:39:31,493 INFO L226 Difference]: Without dead ends: 63 [2022-11-26 00:39:31,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:31,499 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 58 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:31,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 174 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-26 00:39:31,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 33. [2022-11-26 00:39:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:31,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 59 transitions. [2022-11-26 00:39:31,533 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 59 transitions. Word has length 6 [2022-11-26 00:39:31,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:31,534 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 59 transitions. [2022-11-26 00:39:31,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2022-11-26 00:39:31,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 00:39:31,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:31,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:31,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:39:31,536 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:31,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:31,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1298834327, now seen corresponding path program 1 times [2022-11-26 00:39:31,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:31,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058071431] [2022-11-26 00:39:31,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:31,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:31,617 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-26 00:39:31,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:31,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058071431] [2022-11-26 00:39:31,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058071431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:31,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:31,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:31,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361596127] [2022-11-26 00:39:31,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:31,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:31,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:31,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:31,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:31,621 INFO L87 Difference]: Start difference. First operand 33 states and 59 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:31,649 INFO L93 Difference]: Finished difference Result 63 states and 111 transitions. [2022-11-26 00:39:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:31,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-26 00:39:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:31,651 INFO L225 Difference]: With dead ends: 63 [2022-11-26 00:39:31,651 INFO L226 Difference]: Without dead ends: 61 [2022-11-26 00:39:31,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:31,653 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 53 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:31,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 157 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-26 00:39:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 33. [2022-11-26 00:39:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.8125) internal successors, (58), 32 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 58 transitions. [2022-11-26 00:39:31,665 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 58 transitions. Word has length 7 [2022-11-26 00:39:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:31,666 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 58 transitions. [2022-11-26 00:39:31,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 58 transitions. [2022-11-26 00:39:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:39:31,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:31,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:31,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:39:31,670 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:31,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:31,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1609370866, now seen corresponding path program 1 times [2022-11-26 00:39:31,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:31,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550841723] [2022-11-26 00:39:31,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:31,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:31,749 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-26 00:39:31,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:31,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550841723] [2022-11-26 00:39:31,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550841723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:31,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:31,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:31,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775676338] [2022-11-26 00:39:31,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:31,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:31,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:31,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:31,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:31,752 INFO L87 Difference]: Start difference. First operand 33 states and 58 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:31,779 INFO L93 Difference]: Finished difference Result 61 states and 106 transitions. [2022-11-26 00:39:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:31,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-26 00:39:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:31,781 INFO L225 Difference]: With dead ends: 61 [2022-11-26 00:39:31,784 INFO L226 Difference]: Without dead ends: 59 [2022-11-26 00:39:31,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:31,786 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 51 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:31,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 151 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-26 00:39:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 33. [2022-11-26 00:39:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 57 transitions. [2022-11-26 00:39:31,790 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 57 transitions. Word has length 8 [2022-11-26 00:39:31,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:31,790 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 57 transitions. [2022-11-26 00:39:31,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 57 transitions. [2022-11-26 00:39:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:39:31,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:31,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:31,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:39:31,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:31,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1648897972, now seen corresponding path program 1 times [2022-11-26 00:39:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:31,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706608243] [2022-11-26 00:39:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:31,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:31,871 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-26 00:39:31,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:31,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706608243] [2022-11-26 00:39:31,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706608243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:31,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:31,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:31,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055519313] [2022-11-26 00:39:31,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:31,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:31,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:31,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:31,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:31,874 INFO L87 Difference]: Start difference. First operand 33 states and 57 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:31,899 INFO L93 Difference]: Finished difference Result 59 states and 101 transitions. [2022-11-26 00:39:31,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:31,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:39:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:31,900 INFO L225 Difference]: With dead ends: 59 [2022-11-26 00:39:31,900 INFO L226 Difference]: Without dead ends: 57 [2022-11-26 00:39:31,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:31,902 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 49 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:31,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 146 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-26 00:39:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2022-11-26 00:39:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.75) internal successors, (56), 32 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 56 transitions. [2022-11-26 00:39:31,909 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 56 transitions. Word has length 9 [2022-11-26 00:39:31,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:31,910 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 56 transitions. [2022-11-26 00:39:31,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 56 transitions. [2022-11-26 00:39:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:39:31,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:31,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:31,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:39:31,911 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:31,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash 423983495, now seen corresponding path program 1 times [2022-11-26 00:39:31,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:31,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824385170] [2022-11-26 00:39:31,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:31,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:31,984 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-26 00:39:31,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:31,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824385170] [2022-11-26 00:39:31,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824385170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:31,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:31,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:31,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211280099] [2022-11-26 00:39:31,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:31,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:31,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:31,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:31,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:31,987 INFO L87 Difference]: Start difference. First operand 33 states and 56 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:32,015 INFO L93 Difference]: Finished difference Result 57 states and 96 transitions. [2022-11-26 00:39:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:32,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 00:39:32,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:32,019 INFO L225 Difference]: With dead ends: 57 [2022-11-26 00:39:32,019 INFO L226 Difference]: Without dead ends: 55 [2022-11-26 00:39:32,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,020 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 47 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:32,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 139 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-26 00:39:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2022-11-26 00:39:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.71875) internal successors, (55), 32 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 55 transitions. [2022-11-26 00:39:32,025 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 55 transitions. Word has length 10 [2022-11-26 00:39:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:32,025 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 55 transitions. [2022-11-26 00:39:32,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2022-11-26 00:39:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:39:32,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:32,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:32,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:39:32,027 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash 258799873, now seen corresponding path program 1 times [2022-11-26 00:39:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:32,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898958620] [2022-11-26 00:39:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:39:32,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:32,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898958620] [2022-11-26 00:39:32,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898958620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:32,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:32,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:32,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576946850] [2022-11-26 00:39:32,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:32,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:32,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:32,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:32,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,140 INFO L87 Difference]: Start difference. First operand 33 states and 55 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:32,174 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-11-26 00:39:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:32,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-26 00:39:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:32,175 INFO L225 Difference]: With dead ends: 55 [2022-11-26 00:39:32,175 INFO L226 Difference]: Without dead ends: 53 [2022-11-26 00:39:32,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,177 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:32,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 134 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:32,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-26 00:39:32,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-11-26 00:39:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 54 transitions. [2022-11-26 00:39:32,183 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 54 transitions. Word has length 11 [2022-11-26 00:39:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:32,183 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 54 transitions. [2022-11-26 00:39:32,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 54 transitions. [2022-11-26 00:39:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:39:32,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:32,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:32,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:39:32,185 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:32,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:32,185 INFO L85 PathProgramCache]: Analyzing trace with hash -566924772, now seen corresponding path program 1 times [2022-11-26 00:39:32,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:32,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328756419] [2022-11-26 00:39:32,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:32,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:32,276 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-26 00:39:32,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:32,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328756419] [2022-11-26 00:39:32,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328756419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:32,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:32,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538624040] [2022-11-26 00:39:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:32,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:32,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:32,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:32,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,282 INFO L87 Difference]: Start difference. First operand 33 states and 54 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:32,313 INFO L93 Difference]: Finished difference Result 53 states and 86 transitions. [2022-11-26 00:39:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:32,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-26 00:39:32,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:32,317 INFO L225 Difference]: With dead ends: 53 [2022-11-26 00:39:32,317 INFO L226 Difference]: Without dead ends: 51 [2022-11-26 00:39:32,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,320 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 43 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:32,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 128 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-26 00:39:32,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2022-11-26 00:39:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions. [2022-11-26 00:39:32,334 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 12 [2022-11-26 00:39:32,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:32,334 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 53 transitions. [2022-11-26 00:39:32,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 53 transitions. [2022-11-26 00:39:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:39:32,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:32,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:32,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:39:32,336 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:32,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:32,336 INFO L85 PathProgramCache]: Analyzing trace with hash -394584650, now seen corresponding path program 1 times [2022-11-26 00:39:32,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:32,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104658323] [2022-11-26 00:39:32,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:32,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:32,407 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-26 00:39:32,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:32,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104658323] [2022-11-26 00:39:32,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104658323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:32,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:32,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:32,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421062910] [2022-11-26 00:39:32,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:32,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:32,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:32,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:32,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,409 INFO L87 Difference]: Start difference. First operand 33 states and 53 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:32,428 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2022-11-26 00:39:32,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:32,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:39:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:32,429 INFO L225 Difference]: With dead ends: 51 [2022-11-26 00:39:32,429 INFO L226 Difference]: Without dead ends: 49 [2022-11-26 00:39:32,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,431 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 41 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:32,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 122 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-26 00:39:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2022-11-26 00:39:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.625) internal successors, (52), 32 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2022-11-26 00:39:32,434 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 13 [2022-11-26 00:39:32,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:32,434 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 52 transitions. [2022-11-26 00:39:32,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 52 transitions. [2022-11-26 00:39:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:39:32,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:32,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:32,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:39:32,436 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:32,437 INFO L85 PathProgramCache]: Analyzing trace with hash 652992177, now seen corresponding path program 1 times [2022-11-26 00:39:32,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:32,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271078823] [2022-11-26 00:39:32,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:32,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:32,516 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-26 00:39:32,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:32,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271078823] [2022-11-26 00:39:32,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271078823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:32,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:32,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450251592] [2022-11-26 00:39:32,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:32,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:32,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:32,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:32,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,522 INFO L87 Difference]: Start difference. First operand 33 states and 52 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:32,551 INFO L93 Difference]: Finished difference Result 49 states and 76 transitions. [2022-11-26 00:39:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:32,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-26 00:39:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:32,552 INFO L225 Difference]: With dead ends: 49 [2022-11-26 00:39:32,552 INFO L226 Difference]: Without dead ends: 47 [2022-11-26 00:39:32,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,555 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 39 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:32,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 115 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:32,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-26 00:39:32,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2022-11-26 00:39:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.59375) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. [2022-11-26 00:39:32,561 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 51 transitions. Word has length 14 [2022-11-26 00:39:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:32,562 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 51 transitions. [2022-11-26 00:39:32,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 51 transitions. [2022-11-26 00:39:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 00:39:32,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:32,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:32,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:39:32,566 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:32,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:32,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1231864213, now seen corresponding path program 1 times [2022-11-26 00:39:32,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:32,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150551524] [2022-11-26 00:39:32,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:32,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:32,666 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-26 00:39:32,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:32,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150551524] [2022-11-26 00:39:32,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150551524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:32,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:32,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:32,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079732278] [2022-11-26 00:39:32,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:32,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:32,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:32,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:32,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,670 INFO L87 Difference]: Start difference. First operand 33 states and 51 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:32,696 INFO L93 Difference]: Finished difference Result 47 states and 71 transitions. [2022-11-26 00:39:32,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:32,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-26 00:39:32,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:32,698 INFO L225 Difference]: With dead ends: 47 [2022-11-26 00:39:32,698 INFO L226 Difference]: Without dead ends: 45 [2022-11-26 00:39:32,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,700 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 37 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:32,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 110 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-26 00:39:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2022-11-26 00:39:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2022-11-26 00:39:32,709 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 15 [2022-11-26 00:39:32,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:32,710 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 50 transitions. [2022-11-26 00:39:32,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,710 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2022-11-26 00:39:32,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-26 00:39:32,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:32,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:32,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:39:32,711 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:32,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:32,713 INFO L85 PathProgramCache]: Analyzing trace with hash 467130182, now seen corresponding path program 1 times [2022-11-26 00:39:32,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:32,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19982878] [2022-11-26 00:39:32,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:32,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:32,790 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-26 00:39:32,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:32,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19982878] [2022-11-26 00:39:32,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19982878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:32,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:32,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:32,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858707768] [2022-11-26 00:39:32,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:32,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:32,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:32,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:32,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,796 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:32,818 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions. [2022-11-26 00:39:32,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:32,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-26 00:39:32,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:32,821 INFO L225 Difference]: With dead ends: 45 [2022-11-26 00:39:32,821 INFO L226 Difference]: Without dead ends: 43 [2022-11-26 00:39:32,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,824 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:32,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 104 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-26 00:39:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-11-26 00:39:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2022-11-26 00:39:32,835 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 16 [2022-11-26 00:39:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:32,836 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2022-11-26 00:39:32,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2022-11-26 00:39:32,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:39:32,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:32,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:32,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:39:32,840 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:32,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:32,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1596349216, now seen corresponding path program 1 times [2022-11-26 00:39:32,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:32,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782260505] [2022-11-26 00:39:32,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:32,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:32,903 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-26 00:39:32,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:32,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782260505] [2022-11-26 00:39:32,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782260505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:32,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:32,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:32,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94527234] [2022-11-26 00:39:32,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:32,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:32,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:32,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:32,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,906 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:32,926 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-11-26 00:39:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:32,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-26 00:39:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:32,927 INFO L225 Difference]: With dead ends: 43 [2022-11-26 00:39:32,927 INFO L226 Difference]: Without dead ends: 41 [2022-11-26 00:39:32,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:32,928 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 33 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:32,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 98 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-26 00:39:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2022-11-26 00:39:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2022-11-26 00:39:32,942 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 17 [2022-11-26 00:39:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:32,942 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-11-26 00:39:32,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2022-11-26 00:39:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 00:39:32,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:32,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:32,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-26 00:39:32,944 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:32,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:32,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2052566053, now seen corresponding path program 1 times [2022-11-26 00:39:32,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:32,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379067545] [2022-11-26 00:39:32,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:32,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:33,020 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-26 00:39:33,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:33,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379067545] [2022-11-26 00:39:33,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379067545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:33,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:33,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:33,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743220679] [2022-11-26 00:39:33,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:33,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:33,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:33,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:33,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:33,024 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:33,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:33,042 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-11-26 00:39:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:33,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-26 00:39:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:33,044 INFO L225 Difference]: With dead ends: 41 [2022-11-26 00:39:33,044 INFO L226 Difference]: Without dead ends: 39 [2022-11-26 00:39:33,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:33,046 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 31 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:33,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 92 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-26 00:39:33,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-11-26 00:39:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-11-26 00:39:33,052 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 18 [2022-11-26 00:39:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:33,052 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2022-11-26 00:39:33,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2022-11-26 00:39:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:39:33,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:39:33,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:33,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-26 00:39:33,053 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:39:33,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:39:33,054 INFO L85 PathProgramCache]: Analyzing trace with hash 795177941, now seen corresponding path program 1 times [2022-11-26 00:39:33,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:39:33,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666224232] [2022-11-26 00:39:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:39:33,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:39:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:39:33,099 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-26 00:39:33,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:39:33,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666224232] [2022-11-26 00:39:33,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666224232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:39:33,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:39:33,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:39:33,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996221019] [2022-11-26 00:39:33,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:39:33,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:39:33,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:39:33,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:39:33,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:33,104 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:39:33,120 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-11-26 00:39:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:39:33,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-26 00:39:33,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:39:33,121 INFO L225 Difference]: With dead ends: 35 [2022-11-26 00:39:33,122 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:39:33,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:39:33,124 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 28 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:39:33,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 83 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:39:33,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:39:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:39:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:39:33,126 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-11-26 00:39:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:39:33,126 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:39:33,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:39:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:39:33,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:39:33,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-26 00:39:33,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-26 00:39:33,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:39:33,140 INFO L902 garLoopResultBuilder]: At program point L217(lines 7 221) the Hoare annotation is: true [2022-11-26 00:39:33,140 INFO L899 garLoopResultBuilder]: For program point L151-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,140 INFO L899 garLoopResultBuilder]: For program point L201-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,140 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:39:33,141 INFO L899 garLoopResultBuilder]: For program point L152(line 152) no Hoare annotation was computed. [2022-11-26 00:39:33,141 INFO L899 garLoopResultBuilder]: For program point L202(line 202) no Hoare annotation was computed. [2022-11-26 00:39:33,141 INFO L899 garLoopResultBuilder]: For program point L186-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,141 INFO L902 garLoopResultBuilder]: At program point L220(lines 6 221) the Hoare annotation is: true [2022-11-26 00:39:33,141 INFO L899 garLoopResultBuilder]: For program point L187(line 187) no Hoare annotation was computed. [2022-11-26 00:39:33,141 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 57) no Hoare annotation was computed. [2022-11-26 00:39:33,141 INFO L899 garLoopResultBuilder]: For program point L171-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,141 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-11-26 00:39:33,142 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,142 INFO L899 garLoopResultBuilder]: For program point L206-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,142 INFO L899 garLoopResultBuilder]: For program point L140-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,142 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:39:33,142 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-11-26 00:39:33,142 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-11-26 00:39:33,142 INFO L899 garLoopResultBuilder]: For program point L191-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,142 INFO L899 garLoopResultBuilder]: For program point L192(line 192) no Hoare annotation was computed. [2022-11-26 00:39:33,143 INFO L899 garLoopResultBuilder]: For program point L176-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,143 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-11-26 00:39:33,143 INFO L899 garLoopResultBuilder]: For program point L161-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,143 INFO L902 garLoopResultBuilder]: At program point L211-1(lines 53 216) the Hoare annotation is: true [2022-11-26 00:39:33,143 INFO L899 garLoopResultBuilder]: For program point L162(line 162) no Hoare annotation was computed. [2022-11-26 00:39:33,143 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-11-26 00:39:33,144 INFO L895 garLoopResultBuilder]: At program point L212-1(lines 7 221) the Hoare annotation is: false [2022-11-26 00:39:33,144 INFO L899 garLoopResultBuilder]: For program point L146-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,144 INFO L899 garLoopResultBuilder]: For program point L196-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,144 INFO L899 garLoopResultBuilder]: For program point L147(line 147) no Hoare annotation was computed. [2022-11-26 00:39:33,144 INFO L899 garLoopResultBuilder]: For program point L197(line 197) no Hoare annotation was computed. [2022-11-26 00:39:33,144 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2022-11-26 00:39:33,145 INFO L899 garLoopResultBuilder]: For program point L181-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,145 INFO L899 garLoopResultBuilder]: For program point L182(line 182) no Hoare annotation was computed. [2022-11-26 00:39:33,145 INFO L899 garLoopResultBuilder]: For program point L166-1(lines 53 216) no Hoare annotation was computed. [2022-11-26 00:39:33,145 INFO L899 garLoopResultBuilder]: For program point L167(line 167) no Hoare annotation was computed. [2022-11-26 00:39:33,148 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:39:33,151 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:39:33,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:39:33 BoogieIcfgContainer [2022-11-26 00:39:33,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:39:33,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:39:33,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:39:33,160 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:39:33,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:39:30" (3/4) ... [2022-11-26 00:39:33,164 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:39:33,175 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-26 00:39:33,175 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-26 00:39:33,176 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-26 00:39:33,176 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:39:33,221 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:39:33,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:39:33,222 INFO L158 Benchmark]: Toolchain (without parser) took 3337.23ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 110.5MB in the beginning and 103.0MB in the end (delta: 7.5MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2022-11-26 00:39:33,223 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory was 86.2MB in the beginning and 86.2MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:39:33,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.76ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 98.8MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-26 00:39:33,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.25ms. Allocated memory is still 155.2MB. Free memory was 98.8MB in the beginning and 96.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:39:33,224 INFO L158 Benchmark]: Boogie Preprocessor took 25.73ms. Allocated memory is still 155.2MB. Free memory was 96.7MB in the beginning and 95.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:39:33,224 INFO L158 Benchmark]: RCFGBuilder took 748.12ms. Allocated memory is still 155.2MB. Free memory was 95.3MB in the beginning and 114.6MB in the end (delta: -19.4MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2022-11-26 00:39:33,224 INFO L158 Benchmark]: TraceAbstraction took 2196.24ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 113.7MB in the beginning and 107.3MB in the end (delta: 6.4MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2022-11-26 00:39:33,225 INFO L158 Benchmark]: Witness Printer took 61.74ms. Allocated memory is still 197.1MB. Free memory was 107.3MB in the beginning and 103.0MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:39:33,227 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 121.6MB. Free memory was 86.2MB in the beginning and 86.2MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.76ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 98.8MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.25ms. Allocated memory is still 155.2MB. Free memory was 98.8MB in the beginning and 96.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.73ms. Allocated memory is still 155.2MB. Free memory was 96.7MB in the beginning and 95.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 748.12ms. Allocated memory is still 155.2MB. Free memory was 95.3MB in the beginning and 114.6MB in the end (delta: -19.4MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2196.24ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 113.7MB in the beginning and 107.3MB in the end (delta: 6.4MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * Witness Printer took 61.74ms. Allocated memory is still 197.1MB. Free memory was 107.3MB in the beginning and 103.0MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 590 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 590 mSDsluCounter, 1753 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1071 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 682 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 234 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 9 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-26 00:39:33,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fd103e2-779b-4c67-b931-7f96b3d4ca1e/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE