./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8 --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 602ea7c33e3d58a05b038901c89b84d09b02e08d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:49:24,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:49:24,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:49:24,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:49:24,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:49:24,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:49:24,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:49:24,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:49:24,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:49:24,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:49:24,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:49:24,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:49:24,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:49:24,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:49:24,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:49:24,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:49:24,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:49:24,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:49:24,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:49:24,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:49:24,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:49:24,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:49:24,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:49:24,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:49:24,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:49:24,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:49:24,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:49:24,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:49:24,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:49:24,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:49:24,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:49:24,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:49:24,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:49:24,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:49:24,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:49:24,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:49:24,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:49:24,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:49:24,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:49:24,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:49:24,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:49:24,263 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:49:24,295 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:49:24,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:49:24,297 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:49:24,297 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:49:24,298 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:49:24,298 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:49:24,298 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:49:24,299 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:49:24,299 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:49:24,299 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:49:24,299 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:49:24,300 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:49:24,300 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:49:24,300 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:49:24,301 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:49:24,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:49:24,302 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:49:24,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:49:24,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:49:24,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:49:24,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:49:24,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:49:24,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:49:24,304 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:49:24,305 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:49:24,305 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:49:24,305 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:49:24,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:49:24,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:49:24,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:49:24,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:49:24,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:49:24,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:49:24,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:49:24,308 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:49:24,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:49:24,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:49:24,309 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:49:24,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:49:24,309 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/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_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8 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 -> 602ea7c33e3d58a05b038901c89b84d09b02e08d [2021-10-13 07:49:24,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:49:24,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:49:24,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:49:24,742 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:49:24,743 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:49:24,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-13 07:49:24,843 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/data/d9f59d0f1/d8c88439e5124210b2be9a2e1a9b2e0b/FLAG9eb643aa1 [2021-10-13 07:49:25,606 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:49:25,607 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-13 07:49:25,630 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/data/d9f59d0f1/d8c88439e5124210b2be9a2e1a9b2e0b/FLAG9eb643aa1 [2021-10-13 07:49:25,748 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/data/d9f59d0f1/d8c88439e5124210b2be9a2e1a9b2e0b [2021-10-13 07:49:25,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:49:25,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:49:25,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:49:25,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:49:25,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:49:25,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:49:25" (1/1) ... [2021-10-13 07:49:25,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce28e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:49:25, skipping insertion in model container [2021-10-13 07:49:25,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:49:25" (1/1) ... [2021-10-13 07:49:25,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:49:25,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:49:26,239 WARN L228 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_8836187e-2f44-4450-a7db-8a05577b7a59/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-13 07:49:26,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:49:26,543 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:49:26,573 WARN L228 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_8836187e-2f44-4450-a7db-8a05577b7a59/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-13 07:49:26,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:49:26,729 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:49:26,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:49:26 WrapperNode [2021-10-13 07:49:26,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:49:26,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:49:26,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:49:26,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:49:26,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:49:26" (1/1) ... [2021-10-13 07:49:26,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:49:26" (1/1) ... [2021-10-13 07:49:26,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:49:26,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:49:26,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:49:26,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:49:27,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:49:26" (1/1) ... [2021-10-13 07:49:27,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:49:26" (1/1) ... [2021-10-13 07:49:27,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:49:26" (1/1) ... [2021-10-13 07:49:27,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:49:26" (1/1) ... [2021-10-13 07:49:27,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:49:26" (1/1) ... [2021-10-13 07:49:27,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:49:26" (1/1) ... [2021-10-13 07:49:27,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:49:26" (1/1) ... [2021-10-13 07:49:27,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:49:27,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:49:27,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:49:27,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:49:27,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:49:26" (1/1) ... [2021-10-13 07:49:27,193 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:49:27,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:49:27,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:49:27,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:49:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:49:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:49:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:49:27,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:49:27,669 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,672 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,680 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,722 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,730 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,741 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,766 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,777 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,782 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,784 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,786 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,789 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,792 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,795 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,797 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,799 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,801 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,803 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,805 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,807 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,809 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,813 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,815 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,817 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,818 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,821 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,824 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,826 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,829 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,833 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,836 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,840 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,841 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,845 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,846 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,849 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,850 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,854 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,857 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,860 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,862 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,864 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:27,867 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 07:49:29,971 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1271: assume false; [2021-10-13 07:49:29,971 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1272: assume !false; [2021-10-13 07:49:29,971 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-13 07:49:29,972 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-13 07:49:29,972 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1230: assume !false; [2021-10-13 07:49:29,973 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##287: assume false; [2021-10-13 07:49:29,973 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##288: assume !false; [2021-10-13 07:49:29,973 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1229: assume false; [2021-10-13 07:49:29,973 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1210: assume false; [2021-10-13 07:49:29,973 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1211: assume !false; [2021-10-13 07:49:29,974 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##319: assume false; [2021-10-13 07:49:29,974 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##320: assume !false; [2021-10-13 07:49:29,974 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1160: assume !false; [2021-10-13 07:49:29,975 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1159: assume false; [2021-10-13 07:49:29,975 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##371: assume false; [2021-10-13 07:49:29,975 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##372: assume !false; [2021-10-13 07:49:29,975 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1108: assume false; [2021-10-13 07:49:29,975 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1109: assume !false; [2021-10-13 07:49:29,976 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##346: assume false; [2021-10-13 07:49:29,976 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##347: assume !false; [2021-10-13 07:49:29,976 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume false; [2021-10-13 07:49:29,976 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##417: assume !false; [2021-10-13 07:49:29,976 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1050: assume !false; [2021-10-13 07:49:29,977 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res := 0; [2021-10-13 07:49:29,977 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1049: assume false; [2021-10-13 07:49:29,977 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1003: assume false; [2021-10-13 07:49:29,977 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1004: assume !false; [2021-10-13 07:49:29,977 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##461: assume !false; [2021-10-13 07:49:29,978 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##460: assume false; [2021-10-13 07:49:29,978 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##487: assume !false; [2021-10-13 07:49:29,978 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##486: assume false; [2021-10-13 07:49:29,978 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##526: assume !false; [2021-10-13 07:49:29,978 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##525: assume false; [2021-10-13 07:49:29,979 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume !false; [2021-10-13 07:49:29,979 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##70: assume false; [2021-10-13 07:49:29,979 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2021-10-13 07:49:29,979 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2021-10-13 07:49:29,979 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2021-10-13 07:49:29,980 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2021-10-13 07:49:29,981 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-10-13 07:49:29,981 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-10-13 07:49:29,982 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##573: assume !false; [2021-10-13 07:49:29,982 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##572: assume false; [2021-10-13 07:49:29,982 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !false; [2021-10-13 07:49:29,983 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume false; [2021-10-13 07:49:29,983 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-10-13 07:49:29,983 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-10-13 07:49:29,984 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume !false; [2021-10-13 07:49:29,984 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##638: assume false; [2021-10-13 07:49:29,984 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1612: assume false; [2021-10-13 07:49:29,984 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1613: assume !false; [2021-10-13 07:49:29,984 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##757: assume !false; [2021-10-13 07:49:29,985 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##756: assume false; [2021-10-13 07:49:29,985 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##717: assume !false; [2021-10-13 07:49:29,985 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##716: assume false; [2021-10-13 07:49:29,985 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1506: assume false; [2021-10-13 07:49:29,986 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1507: assume !false; [2021-10-13 07:49:29,986 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1564: assume false; [2021-10-13 07:49:29,986 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1565: assume !false; [2021-10-13 07:49:29,987 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##856: assume false; [2021-10-13 07:49:29,987 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##857: assume !false; [2021-10-13 07:49:29,987 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##801: assume false; [2021-10-13 07:49:29,987 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##802: assume !false; [2021-10-13 07:49:29,988 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##832: assume !false; [2021-10-13 07:49:29,989 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##831: assume false; [2021-10-13 07:49:29,991 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1426: assume false; [2021-10-13 07:49:29,992 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1427: assume !false; [2021-10-13 07:49:29,992 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1476: assume false; [2021-10-13 07:49:29,992 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1477: assume !false; [2021-10-13 07:49:29,993 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1398: assume false; [2021-10-13 07:49:29,994 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1399: assume !false; [2021-10-13 07:49:29,994 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##961: assume !false; [2021-10-13 07:49:29,994 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##960: assume false; [2021-10-13 07:49:29,994 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##909: assume false; [2021-10-13 07:49:30,000 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##910: assume !false; [2021-10-13 07:49:30,001 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1301: assume false; [2021-10-13 07:49:30,002 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1302: assume !false; [2021-10-13 07:49:30,002 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##188: assume !false; [2021-10-13 07:49:30,002 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume false; [2021-10-13 07:49:30,002 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##148: assume false; [2021-10-13 07:49:30,003 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##149: assume !false; [2021-10-13 07:49:30,003 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1354: assume false; [2021-10-13 07:49:30,003 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1355: assume !false; [2021-10-13 07:49:30,003 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1341: assume false; [2021-10-13 07:49:30,003 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1342: assume !false; [2021-10-13 07:49:30,003 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume false; [2021-10-13 07:49:30,004 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !false; [2021-10-13 07:49:32,899 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:49:32,900 INFO L299 CfgBuilder]: Removed 555 assume(true) statements. [2021-10-13 07:49:32,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:49:32 BoogieIcfgContainer [2021-10-13 07:49:32,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:49:32,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:49:32,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:49:32,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:49:32,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:49:25" (1/3) ... [2021-10-13 07:49:32,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303dedf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:49:32, skipping insertion in model container [2021-10-13 07:49:32,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:49:26" (2/3) ... [2021-10-13 07:49:32,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303dedf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:49:32, skipping insertion in model container [2021-10-13 07:49:32,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:49:32" (3/3) ... [2021-10-13 07:49:32,914 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2021-10-13 07:49:32,921 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:49:32,921 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2021-10-13 07:49:33,002 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:49:33,013 INFO L339 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, mConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:49:33,014 INFO L340 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2021-10-13 07:49:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 779 states, 675 states have (on average 1.7377777777777779) internal successors, (1173), 778 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-13 07:49:33,076 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:33,077 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:33,077 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1428884645, now seen corresponding path program 1 times [2021-10-13 07:49:33,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:33,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005552301] [2021-10-13 07:49:33,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:33,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:33,383 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:33,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005552301] [2021-10-13 07:49:33,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005552301] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:33,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:33,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:33,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312146299] [2021-10-13 07:49:33,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:33,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:33,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:33,417 INFO L87 Difference]: Start difference. First operand has 779 states, 675 states have (on average 1.7377777777777779) internal successors, (1173), 778 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2021-10-13 07:49:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:33,889 INFO L93 Difference]: Finished difference Result 1301 states and 1928 transitions. [2021-10-13 07:49:33,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:33,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 [2021-10-13 07:49:33,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:33,919 INFO L225 Difference]: With dead ends: 1301 [2021-10-13 07:49:33,919 INFO L226 Difference]: Without dead ends: 736 [2021-10-13 07:49:33,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2021-10-13 07:49:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 734. [2021-10-13 07:49:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 667 states have (on average 1.5412293853073464) internal successors, (1028), 733 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1028 transitions. [2021-10-13 07:49:34,027 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1028 transitions. Word has length 8 [2021-10-13 07:49:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:34,027 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1028 transitions. [2021-10-13 07:49:34,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2021-10-13 07:49:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1028 transitions. [2021-10-13 07:49:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 07:49:34,029 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:34,029 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:34,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:49:34,030 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:34,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:34,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1293410765, now seen corresponding path program 1 times [2021-10-13 07:49:34,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:34,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199506641] [2021-10-13 07:49:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:34,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:34,149 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:34,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199506641] [2021-10-13 07:49:34,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199506641] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:34,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:34,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:34,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597019883] [2021-10-13 07:49:34,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:34,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:34,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:34,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:34,153 INFO L87 Difference]: Start difference. First operand 734 states and 1028 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2021-10-13 07:49:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:34,213 INFO L93 Difference]: Finished difference Result 931 states and 1280 transitions. [2021-10-13 07:49:34,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:34,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 [2021-10-13 07:49:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:34,220 INFO L225 Difference]: With dead ends: 931 [2021-10-13 07:49:34,220 INFO L226 Difference]: Without dead ends: 734 [2021-10-13 07:49:34,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:34,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2021-10-13 07:49:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 629. [2021-10-13 07:49:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 583 states have (on average 1.5214408233276158) internal successors, (887), 628 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 887 transitions. [2021-10-13 07:49:34,263 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 887 transitions. Word has length 9 [2021-10-13 07:49:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:34,264 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 887 transitions. [2021-10-13 07:49:34,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2021-10-13 07:49:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 887 transitions. [2021-10-13 07:49:34,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 07:49:34,270 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:34,270 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:34,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:49:34,272 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:34,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:34,280 INFO L82 PathProgramCache]: Analyzing trace with hash -224003595, now seen corresponding path program 1 times [2021-10-13 07:49:34,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:34,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727462021] [2021-10-13 07:49:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:34,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:34,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:34,321 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:34,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727462021] [2021-10-13 07:49:34,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727462021] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:34,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:34,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:49:34,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414720041] [2021-10-13 07:49:34,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:34,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:34,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:34,324 INFO L87 Difference]: Start difference. First operand 629 states and 887 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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) [2021-10-13 07:49:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:34,583 INFO L93 Difference]: Finished difference Result 651 states and 912 transitions. [2021-10-13 07:49:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:34,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 [2021-10-13 07:49:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:34,587 INFO L225 Difference]: With dead ends: 651 [2021-10-13 07:49:34,588 INFO L226 Difference]: Without dead ends: 629 [2021-10-13 07:49:34,588 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:34,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-10-13 07:49:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2021-10-13 07:49:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 583 states have (on average 1.5197255574614066) internal successors, (886), 628 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 886 transitions. [2021-10-13 07:49:34,614 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 886 transitions. Word has length 10 [2021-10-13 07:49:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:34,614 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 886 transitions. [2021-10-13 07:49:34,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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) [2021-10-13 07:49:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 886 transitions. [2021-10-13 07:49:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 07:49:34,618 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:34,618 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:34,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:49:34,619 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:34,620 INFO L82 PathProgramCache]: Analyzing trace with hash 725022092, now seen corresponding path program 1 times [2021-10-13 07:49:34,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:34,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003330050] [2021-10-13 07:49:34,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:34,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:34,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:34,686 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:34,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003330050] [2021-10-13 07:49:34,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003330050] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:34,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:34,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:34,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581959412] [2021-10-13 07:49:34,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:34,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:34,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:34,689 INFO L87 Difference]: Start difference. First operand 629 states and 886 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2021-10-13 07:49:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:35,111 INFO L93 Difference]: Finished difference Result 1041 states and 1426 transitions. [2021-10-13 07:49:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:35,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 [2021-10-13 07:49:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:35,117 INFO L225 Difference]: With dead ends: 1041 [2021-10-13 07:49:35,117 INFO L226 Difference]: Without dead ends: 874 [2021-10-13 07:49:35,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-10-13 07:49:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 742. [2021-10-13 07:49:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 696 states have (on average 1.5172413793103448) internal successors, (1056), 741 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1056 transitions. [2021-10-13 07:49:35,149 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1056 transitions. Word has length 12 [2021-10-13 07:49:35,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:35,150 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1056 transitions. [2021-10-13 07:49:35,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2021-10-13 07:49:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1056 transitions. [2021-10-13 07:49:35,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 07:49:35,151 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:35,151 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:35,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:49:35,152 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:35,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:35,153 INFO L82 PathProgramCache]: Analyzing trace with hash 993192964, now seen corresponding path program 1 times [2021-10-13 07:49:35,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:35,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765767200] [2021-10-13 07:49:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:35,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:35,200 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:35,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765767200] [2021-10-13 07:49:35,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765767200] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:35,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:35,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:35,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386197502] [2021-10-13 07:49:35,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:35,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:35,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:35,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:35,203 INFO L87 Difference]: Start difference. First operand 742 states and 1056 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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) [2021-10-13 07:49:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:35,571 INFO L93 Difference]: Finished difference Result 1044 states and 1448 transitions. [2021-10-13 07:49:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:35,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 [2021-10-13 07:49:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:35,576 INFO L225 Difference]: With dead ends: 1044 [2021-10-13 07:49:35,576 INFO L226 Difference]: Without dead ends: 629 [2021-10-13 07:49:35,577 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-10-13 07:49:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 580. [2021-10-13 07:49:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 556 states have (on average 1.4388489208633093) internal successors, (800), 579 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 800 transitions. [2021-10-13 07:49:35,606 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 800 transitions. Word has length 13 [2021-10-13 07:49:35,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:35,606 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 800 transitions. [2021-10-13 07:49:35,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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) [2021-10-13 07:49:35,606 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 800 transitions. [2021-10-13 07:49:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 07:49:35,608 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:35,608 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:35,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:49:35,608 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:35,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:35,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1649645807, now seen corresponding path program 1 times [2021-10-13 07:49:35,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:35,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448363220] [2021-10-13 07:49:35,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:35,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:35,661 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:35,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448363220] [2021-10-13 07:49:35,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448363220] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:35,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:35,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:35,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377221015] [2021-10-13 07:49:35,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:35,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:35,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:35,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:35,663 INFO L87 Difference]: Start difference. First operand 580 states and 800 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2021-10-13 07:49:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:35,888 INFO L93 Difference]: Finished difference Result 580 states and 800 transitions. [2021-10-13 07:49:35,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:35,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 [2021-10-13 07:49:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:35,892 INFO L225 Difference]: With dead ends: 580 [2021-10-13 07:49:35,892 INFO L226 Difference]: Without dead ends: 562 [2021-10-13 07:49:35,893 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:35,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-10-13 07:49:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-10-13 07:49:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 547 states have (on average 1.429616087751371) internal successors, (782), 561 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 782 transitions. [2021-10-13 07:49:35,921 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 782 transitions. Word has length 14 [2021-10-13 07:49:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:35,922 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 782 transitions. [2021-10-13 07:49:35,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2021-10-13 07:49:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 782 transitions. [2021-10-13 07:49:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 07:49:35,924 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:35,924 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:35,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:49:35,925 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:35,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1629262432, now seen corresponding path program 1 times [2021-10-13 07:49:35,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:35,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841270536] [2021-10-13 07:49:35,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:35,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:35,995 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:35,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841270536] [2021-10-13 07:49:35,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841270536] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:35,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:35,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:49:35,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065183398] [2021-10-13 07:49:35,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:35,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:35,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:35,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:35,997 INFO L87 Difference]: Start difference. First operand 562 states and 782 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) [2021-10-13 07:49:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:36,072 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2021-10-13 07:49:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:49:36,073 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 [2021-10-13 07:49:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:36,077 INFO L225 Difference]: With dead ends: 758 [2021-10-13 07:49:36,077 INFO L226 Difference]: Without dead ends: 613 [2021-10-13 07:49:36,078 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-10-13 07:49:36,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 552. [2021-10-13 07:49:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 539 states have (on average 1.4211502782931353) internal successors, (766), 551 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 766 transitions. [2021-10-13 07:49:36,118 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 766 transitions. Word has length 14 [2021-10-13 07:49:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:36,118 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 766 transitions. [2021-10-13 07:49:36,118 INFO L471 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) [2021-10-13 07:49:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 766 transitions. [2021-10-13 07:49:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 07:49:36,120 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:36,121 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:36,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:49:36,121 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:36,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1145033940, now seen corresponding path program 1 times [2021-10-13 07:49:36,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:36,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346049170] [2021-10-13 07:49:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:36,123 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:36,181 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:36,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346049170] [2021-10-13 07:49:36,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346049170] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:36,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:36,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:36,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826610345] [2021-10-13 07:49:36,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:36,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:36,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:36,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:36,185 INFO L87 Difference]: Start difference. First operand 552 states and 766 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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) [2021-10-13 07:49:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:36,233 INFO L93 Difference]: Finished difference Result 606 states and 829 transitions. [2021-10-13 07:49:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:36,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 [2021-10-13 07:49:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:36,239 INFO L225 Difference]: With dead ends: 606 [2021-10-13 07:49:36,239 INFO L226 Difference]: Without dead ends: 583 [2021-10-13 07:49:36,240 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-10-13 07:49:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 572. [2021-10-13 07:49:36,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 560 states have (on average 1.4160714285714286) internal successors, (793), 571 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 793 transitions. [2021-10-13 07:49:36,286 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 793 transitions. Word has length 17 [2021-10-13 07:49:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:36,287 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 793 transitions. [2021-10-13 07:49:36,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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) [2021-10-13 07:49:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 793 transitions. [2021-10-13 07:49:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 07:49:36,289 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:36,289 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:36,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:49:36,290 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:36,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:36,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1721362675, now seen corresponding path program 1 times [2021-10-13 07:49:36,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:36,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168578071] [2021-10-13 07:49:36,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:36,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:36,364 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:36,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168578071] [2021-10-13 07:49:36,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168578071] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:36,365 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:36,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:36,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085358144] [2021-10-13 07:49:36,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:36,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:36,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:36,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:36,373 INFO L87 Difference]: Start difference. First operand 572 states and 793 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) [2021-10-13 07:49:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:36,651 INFO L93 Difference]: Finished difference Result 700 states and 965 transitions. [2021-10-13 07:49:36,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:36,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 [2021-10-13 07:49:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:36,655 INFO L225 Difference]: With dead ends: 700 [2021-10-13 07:49:36,655 INFO L226 Difference]: Without dead ends: 562 [2021-10-13 07:49:36,656 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-10-13 07:49:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-10-13 07:49:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 553 states have (on average 1.406871609403255) internal successors, (778), 561 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 778 transitions. [2021-10-13 07:49:36,683 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 778 transitions. Word has length 19 [2021-10-13 07:49:36,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:36,685 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 778 transitions. [2021-10-13 07:49:36,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) [2021-10-13 07:49:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 778 transitions. [2021-10-13 07:49:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 07:49:36,687 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:36,687 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:36,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:49:36,688 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:36,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1713187916, now seen corresponding path program 1 times [2021-10-13 07:49:36,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:36,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004601523] [2021-10-13 07:49:36,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:36,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:36,732 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:36,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004601523] [2021-10-13 07:49:36,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004601523] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:36,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:36,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:36,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927451530] [2021-10-13 07:49:36,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:36,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:36,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:36,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:36,735 INFO L87 Difference]: Start difference. First operand 562 states and 778 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:36,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:36,962 INFO L93 Difference]: Finished difference Result 689 states and 939 transitions. [2021-10-13 07:49:36,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:36,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-10-13 07:49:36,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:36,967 INFO L225 Difference]: With dead ends: 689 [2021-10-13 07:49:36,967 INFO L226 Difference]: Without dead ends: 673 [2021-10-13 07:49:36,967 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:36,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-10-13 07:49:36,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 597. [2021-10-13 07:49:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 588 states have (on average 1.3894557823129252) internal successors, (817), 596 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 817 transitions. [2021-10-13 07:49:36,998 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 817 transitions. Word has length 21 [2021-10-13 07:49:36,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:36,999 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 817 transitions. [2021-10-13 07:49:36,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 817 transitions. [2021-10-13 07:49:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 07:49:37,001 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:37,001 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:37,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 07:49:37,001 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:37,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:37,002 INFO L82 PathProgramCache]: Analyzing trace with hash -884532789, now seen corresponding path program 1 times [2021-10-13 07:49:37,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:37,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593813674] [2021-10-13 07:49:37,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:37,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:37,033 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:37,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593813674] [2021-10-13 07:49:37,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593813674] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:37,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:37,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:37,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914346023] [2021-10-13 07:49:37,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:37,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:37,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:37,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:37,036 INFO L87 Difference]: Start difference. First operand 597 states and 817 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:37,257 INFO L93 Difference]: Finished difference Result 621 states and 843 transitions. [2021-10-13 07:49:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:37,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-13 07:49:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:37,262 INFO L225 Difference]: With dead ends: 621 [2021-10-13 07:49:37,262 INFO L226 Difference]: Without dead ends: 616 [2021-10-13 07:49:37,262 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2021-10-13 07:49:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2021-10-13 07:49:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 604 states have (on average 1.3841059602649006) internal successors, (836), 612 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 836 transitions. [2021-10-13 07:49:37,292 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 836 transitions. Word has length 22 [2021-10-13 07:49:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:37,292 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 836 transitions. [2021-10-13 07:49:37,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 836 transitions. [2021-10-13 07:49:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 07:49:37,294 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:37,294 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:37,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:49:37,295 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:37,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1586442508, now seen corresponding path program 1 times [2021-10-13 07:49:37,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:37,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510658011] [2021-10-13 07:49:37,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:37,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:37,328 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:37,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510658011] [2021-10-13 07:49:37,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510658011] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:37,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:37,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:37,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142405381] [2021-10-13 07:49:37,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:37,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:37,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:37,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:37,330 INFO L87 Difference]: Start difference. First operand 613 states and 836 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:37,620 INFO L93 Difference]: Finished difference Result 703 states and 953 transitions. [2021-10-13 07:49:37,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:37,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-13 07:49:37,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:37,625 INFO L225 Difference]: With dead ends: 703 [2021-10-13 07:49:37,625 INFO L226 Difference]: Without dead ends: 691 [2021-10-13 07:49:37,626 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-10-13 07:49:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 613. [2021-10-13 07:49:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 604 states have (on average 1.380794701986755) internal successors, (834), 612 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 834 transitions. [2021-10-13 07:49:37,658 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 834 transitions. Word has length 22 [2021-10-13 07:49:37,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:37,659 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 834 transitions. [2021-10-13 07:49:37,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 834 transitions. [2021-10-13 07:49:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 07:49:37,661 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:37,661 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:37,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 07:49:37,662 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:37,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:37,662 INFO L82 PathProgramCache]: Analyzing trace with hash 640427871, now seen corresponding path program 1 times [2021-10-13 07:49:37,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:37,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711239763] [2021-10-13 07:49:37,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:37,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:37,692 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:37,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711239763] [2021-10-13 07:49:37,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711239763] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:37,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:37,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:37,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729596593] [2021-10-13 07:49:37,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:37,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:37,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:37,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:37,695 INFO L87 Difference]: Start difference. First operand 613 states and 834 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:37,938 INFO L93 Difference]: Finished difference Result 648 states and 870 transitions. [2021-10-13 07:49:37,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:37,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-13 07:49:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:37,943 INFO L225 Difference]: With dead ends: 648 [2021-10-13 07:49:37,943 INFO L226 Difference]: Without dead ends: 613 [2021-10-13 07:49:37,943 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-10-13 07:49:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2021-10-13 07:49:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 604 states have (on average 1.3658940397350994) internal successors, (825), 612 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 825 transitions. [2021-10-13 07:49:38,016 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 825 transitions. Word has length 22 [2021-10-13 07:49:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:38,017 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 825 transitions. [2021-10-13 07:49:38,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 825 transitions. [2021-10-13 07:49:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 07:49:38,021 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:38,021 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:38,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 07:49:38,022 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:38,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:38,022 INFO L82 PathProgramCache]: Analyzing trace with hash 162403822, now seen corresponding path program 1 times [2021-10-13 07:49:38,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:38,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472950180] [2021-10-13 07:49:38,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:38,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:38,069 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:38,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472950180] [2021-10-13 07:49:38,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472950180] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:38,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:38,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:38,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590751284] [2021-10-13 07:49:38,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:38,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:38,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:38,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:38,072 INFO L87 Difference]: Start difference. First operand 613 states and 825 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:38,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:38,139 INFO L93 Difference]: Finished difference Result 665 states and 890 transitions. [2021-10-13 07:49:38,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:38,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-13 07:49:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:38,143 INFO L225 Difference]: With dead ends: 665 [2021-10-13 07:49:38,144 INFO L226 Difference]: Without dead ends: 596 [2021-10-13 07:49:38,145 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-10-13 07:49:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2021-10-13 07:49:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 588 states have (on average 1.3537414965986394) internal successors, (796), 595 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 796 transitions. [2021-10-13 07:49:38,194 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 796 transitions. Word has length 22 [2021-10-13 07:49:38,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:38,194 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 796 transitions. [2021-10-13 07:49:38,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 796 transitions. [2021-10-13 07:49:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 07:49:38,200 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:38,200 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:38,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 07:49:38,201 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:38,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2130497339, now seen corresponding path program 1 times [2021-10-13 07:49:38,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:38,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816918955] [2021-10-13 07:49:38,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:38,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:38,266 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:38,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816918955] [2021-10-13 07:49:38,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816918955] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:38,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:38,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:49:38,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889714306] [2021-10-13 07:49:38,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:38,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:38,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:38,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:38,270 INFO L87 Difference]: Start difference. First operand 596 states and 796 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:38,350 INFO L93 Difference]: Finished difference Result 712 states and 942 transitions. [2021-10-13 07:49:38,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:38,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-13 07:49:38,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:38,357 INFO L225 Difference]: With dead ends: 712 [2021-10-13 07:49:38,357 INFO L226 Difference]: Without dead ends: 638 [2021-10-13 07:49:38,360 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:38,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-10-13 07:49:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 588. [2021-10-13 07:49:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 582 states have (on average 1.3470790378006874) internal successors, (784), 587 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 784 transitions. [2021-10-13 07:49:38,405 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 784 transitions. Word has length 22 [2021-10-13 07:49:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:38,405 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 784 transitions. [2021-10-13 07:49:38,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:38,406 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 784 transitions. [2021-10-13 07:49:38,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 07:49:38,408 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:38,409 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:38,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 07:49:38,409 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:38,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:38,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1633499935, now seen corresponding path program 1 times [2021-10-13 07:49:38,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:38,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805889437] [2021-10-13 07:49:38,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:38,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:38,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:38,474 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:38,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805889437] [2021-10-13 07:49:38,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805889437] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:38,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:38,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:38,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103203719] [2021-10-13 07:49:38,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:38,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:38,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:38,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:38,480 INFO L87 Difference]: Start difference. First operand 588 states and 784 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:38,730 INFO L93 Difference]: Finished difference Result 596 states and 790 transitions. [2021-10-13 07:49:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:38,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-10-13 07:49:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:38,734 INFO L225 Difference]: With dead ends: 596 [2021-10-13 07:49:38,734 INFO L226 Difference]: Without dead ends: 591 [2021-10-13 07:49:38,735 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:38,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-10-13 07:49:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 588. [2021-10-13 07:49:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 582 states have (on average 1.3453608247422681) internal successors, (783), 587 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 783 transitions. [2021-10-13 07:49:38,771 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 783 transitions. Word has length 23 [2021-10-13 07:49:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:38,771 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 783 transitions. [2021-10-13 07:49:38,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 783 transitions. [2021-10-13 07:49:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 07:49:38,773 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:38,773 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:38,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 07:49:38,774 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:38,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:38,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1412842791, now seen corresponding path program 1 times [2021-10-13 07:49:38,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:38,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833580794] [2021-10-13 07:49:38,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:38,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:38,805 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:38,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833580794] [2021-10-13 07:49:38,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833580794] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:38,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:38,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:38,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875406961] [2021-10-13 07:49:38,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:38,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:38,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:38,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:38,807 INFO L87 Difference]: Start difference. First operand 588 states and 783 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:39,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:39,058 INFO L93 Difference]: Finished difference Result 605 states and 799 transitions. [2021-10-13 07:49:39,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:39,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-10-13 07:49:39,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:39,061 INFO L225 Difference]: With dead ends: 605 [2021-10-13 07:49:39,062 INFO L226 Difference]: Without dead ends: 575 [2021-10-13 07:49:39,062 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:39,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-10-13 07:49:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2021-10-13 07:49:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 569 states have (on average 1.3374340949033392) internal successors, (761), 574 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 761 transitions. [2021-10-13 07:49:39,098 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 761 transitions. Word has length 23 [2021-10-13 07:49:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:39,098 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 761 transitions. [2021-10-13 07:49:39,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 761 transitions. [2021-10-13 07:49:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 07:49:39,100 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:39,100 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:39,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 07:49:39,100 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:39,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1360030513, now seen corresponding path program 1 times [2021-10-13 07:49:39,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:39,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314574069] [2021-10-13 07:49:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:39,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:39,124 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:39,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314574069] [2021-10-13 07:49:39,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314574069] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:39,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:39,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:39,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444794287] [2021-10-13 07:49:39,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:39,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:39,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:39,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:39,127 INFO L87 Difference]: Start difference. First operand 575 states and 761 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:39,324 INFO L93 Difference]: Finished difference Result 609 states and 795 transitions. [2021-10-13 07:49:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:39,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-10-13 07:49:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:39,328 INFO L225 Difference]: With dead ends: 609 [2021-10-13 07:49:39,329 INFO L226 Difference]: Without dead ends: 595 [2021-10-13 07:49:39,329 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-10-13 07:49:39,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 583. [2021-10-13 07:49:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 577 states have (on average 1.3327556325823224) internal successors, (769), 582 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 769 transitions. [2021-10-13 07:49:39,368 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 769 transitions. Word has length 23 [2021-10-13 07:49:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:39,368 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 769 transitions. [2021-10-13 07:49:39,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 769 transitions. [2021-10-13 07:49:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 07:49:39,369 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:39,370 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:39,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 07:49:39,370 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:39,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:39,370 INFO L82 PathProgramCache]: Analyzing trace with hash 379232346, now seen corresponding path program 1 times [2021-10-13 07:49:39,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:39,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996758484] [2021-10-13 07:49:39,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:39,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:39,403 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:39,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996758484] [2021-10-13 07:49:39,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996758484] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:39,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:39,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:39,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731245498] [2021-10-13 07:49:39,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:39,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:39,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:39,405 INFO L87 Difference]: Start difference. First operand 583 states and 769 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:39,636 INFO L93 Difference]: Finished difference Result 591 states and 775 transitions. [2021-10-13 07:49:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:39,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 07:49:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:39,640 INFO L225 Difference]: With dead ends: 591 [2021-10-13 07:49:39,640 INFO L226 Difference]: Without dead ends: 586 [2021-10-13 07:49:39,641 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-10-13 07:49:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 583. [2021-10-13 07:49:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 577 states have (on average 1.3310225303292895) internal successors, (768), 582 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 768 transitions. [2021-10-13 07:49:39,682 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 768 transitions. Word has length 24 [2021-10-13 07:49:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:39,683 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 768 transitions. [2021-10-13 07:49:39,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 768 transitions. [2021-10-13 07:49:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 07:49:39,684 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:39,684 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:39,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 07:49:39,685 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:39,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash -771502393, now seen corresponding path program 1 times [2021-10-13 07:49:39,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:39,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919919037] [2021-10-13 07:49:39,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:39,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:39,761 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:39,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919919037] [2021-10-13 07:49:39,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919919037] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:39,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:39,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:49:39,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354028731] [2021-10-13 07:49:39,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:39,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:39,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:39,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:39,762 INFO L87 Difference]: Start difference. First operand 583 states and 768 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:39,850 INFO L93 Difference]: Finished difference Result 597 states and 781 transitions. [2021-10-13 07:49:39,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:39,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 07:49:39,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:39,854 INFO L225 Difference]: With dead ends: 597 [2021-10-13 07:49:39,854 INFO L226 Difference]: Without dead ends: 594 [2021-10-13 07:49:39,855 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-10-13 07:49:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 589. [2021-10-13 07:49:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 583 states have (on average 1.3276157804459692) internal successors, (774), 588 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 774 transitions. [2021-10-13 07:49:39,894 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 774 transitions. Word has length 24 [2021-10-13 07:49:39,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:39,895 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 774 transitions. [2021-10-13 07:49:39,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 774 transitions. [2021-10-13 07:49:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 07:49:39,896 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:39,896 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:39,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 07:49:39,897 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:39,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:39,897 INFO L82 PathProgramCache]: Analyzing trace with hash -771514309, now seen corresponding path program 1 times [2021-10-13 07:49:39,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:39,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856911576] [2021-10-13 07:49:39,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:39,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:39,933 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:39,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856911576] [2021-10-13 07:49:39,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856911576] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:39,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:39,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:39,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824033028] [2021-10-13 07:49:39,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:39,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:39,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:39,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:39,935 INFO L87 Difference]: Start difference. First operand 589 states and 774 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:40,174 INFO L93 Difference]: Finished difference Result 603 states and 787 transitions. [2021-10-13 07:49:40,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:40,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 07:49:40,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:40,178 INFO L225 Difference]: With dead ends: 603 [2021-10-13 07:49:40,179 INFO L226 Difference]: Without dead ends: 583 [2021-10-13 07:49:40,179 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-10-13 07:49:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 577. [2021-10-13 07:49:40,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 571 states have (on average 1.3345008756567425) internal successors, (762), 576 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 762 transitions. [2021-10-13 07:49:40,217 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 762 transitions. Word has length 24 [2021-10-13 07:49:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:40,217 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 762 transitions. [2021-10-13 07:49:40,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 762 transitions. [2021-10-13 07:49:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 07:49:40,219 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:40,219 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:40,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 07:49:40,220 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:40,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1481572040, now seen corresponding path program 1 times [2021-10-13 07:49:40,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:40,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860372320] [2021-10-13 07:49:40,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:40,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:40,292 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:40,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860372320] [2021-10-13 07:49:40,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860372320] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:40,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:40,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:49:40,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697760952] [2021-10-13 07:49:40,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:49:40,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:40,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:49:40,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:49:40,294 INFO L87 Difference]: Start difference. First operand 577 states and 762 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:40,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:40,476 INFO L93 Difference]: Finished difference Result 595 states and 779 transitions. [2021-10-13 07:49:40,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:49:40,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-13 07:49:40,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:40,480 INFO L225 Difference]: With dead ends: 595 [2021-10-13 07:49:40,480 INFO L226 Difference]: Without dead ends: 572 [2021-10-13 07:49:40,482 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.6ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:49:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-10-13 07:49:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2021-10-13 07:49:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 566 states have (on average 1.3197879858657244) internal successors, (747), 571 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 747 transitions. [2021-10-13 07:49:40,521 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 747 transitions. Word has length 25 [2021-10-13 07:49:40,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:40,521 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 747 transitions. [2021-10-13 07:49:40,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 747 transitions. [2021-10-13 07:49:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 07:49:40,523 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:40,523 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:40,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 07:49:40,523 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:40,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:40,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1652194093, now seen corresponding path program 1 times [2021-10-13 07:49:40,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:40,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720241429] [2021-10-13 07:49:40,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:40,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:40,609 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:40,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720241429] [2021-10-13 07:49:40,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720241429] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:40,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:40,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 07:49:40,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076924853] [2021-10-13 07:49:40,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:49:40,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:40,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:49:40,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:49:40,614 INFO L87 Difference]: Start difference. First operand 572 states and 747 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:40,772 INFO L93 Difference]: Finished difference Result 590 states and 764 transitions. [2021-10-13 07:49:40,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:49:40,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-13 07:49:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:40,776 INFO L225 Difference]: With dead ends: 590 [2021-10-13 07:49:40,777 INFO L226 Difference]: Without dead ends: 569 [2021-10-13 07:49:40,777 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.3ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 07:49:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-10-13 07:49:40,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2021-10-13 07:49:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 563 states have (on average 1.3019538188277087) internal successors, (733), 568 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 733 transitions. [2021-10-13 07:49:40,815 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 733 transitions. Word has length 25 [2021-10-13 07:49:40,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:40,816 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 733 transitions. [2021-10-13 07:49:40,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:40,816 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 733 transitions. [2021-10-13 07:49:40,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:49:40,817 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:40,818 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:40,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 07:49:40,818 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:40,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:40,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1306896656, now seen corresponding path program 1 times [2021-10-13 07:49:40,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:40,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835082063] [2021-10-13 07:49:40,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:40,819 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:40,864 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:40,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835082063] [2021-10-13 07:49:40,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835082063] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:40,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:40,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:49:40,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399764689] [2021-10-13 07:49:40,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:49:40,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:40,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:49:40,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:49:40,866 INFO L87 Difference]: Start difference. First operand 569 states and 733 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:40,969 INFO L93 Difference]: Finished difference Result 584 states and 747 transitions. [2021-10-13 07:49:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:49:40,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 07:49:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:40,973 INFO L225 Difference]: With dead ends: 584 [2021-10-13 07:49:40,973 INFO L226 Difference]: Without dead ends: 563 [2021-10-13 07:49:40,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:49:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-10-13 07:49:41,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2021-10-13 07:49:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 557 states have (on average 1.2998204667863555) internal successors, (724), 562 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 724 transitions. [2021-10-13 07:49:41,012 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 724 transitions. Word has length 26 [2021-10-13 07:49:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:41,012 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 724 transitions. [2021-10-13 07:49:41,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:41,013 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 724 transitions. [2021-10-13 07:49:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:49:41,014 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:41,015 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:41,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 07:49:41,015 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:41,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:41,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2107388639, now seen corresponding path program 1 times [2021-10-13 07:49:41,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:41,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926778088] [2021-10-13 07:49:41,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:41,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:41,111 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:41,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926778088] [2021-10-13 07:49:41,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926778088] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:41,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:41,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:49:41,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88867724] [2021-10-13 07:49:41,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:49:41,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:41,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:49:41,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:41,113 INFO L87 Difference]: Start difference. First operand 563 states and 724 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:41,237 INFO L93 Difference]: Finished difference Result 654 states and 835 transitions. [2021-10-13 07:49:41,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:49:41,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 07:49:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:41,241 INFO L225 Difference]: With dead ends: 654 [2021-10-13 07:49:41,241 INFO L226 Difference]: Without dead ends: 572 [2021-10-13 07:49:41,242 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:49:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-10-13 07:49:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 559. [2021-10-13 07:49:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 553 states have (on average 1.298372513562387) internal successors, (718), 558 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 718 transitions. [2021-10-13 07:49:41,288 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 718 transitions. Word has length 26 [2021-10-13 07:49:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:41,289 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 718 transitions. [2021-10-13 07:49:41,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 718 transitions. [2021-10-13 07:49:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:49:41,290 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:41,290 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:41,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 07:49:41,291 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:41,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1658430507, now seen corresponding path program 1 times [2021-10-13 07:49:41,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:41,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635549180] [2021-10-13 07:49:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:41,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:41,323 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:41,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635549180] [2021-10-13 07:49:41,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635549180] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:41,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:41,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:49:41,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700019197] [2021-10-13 07:49:41,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:49:41,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:41,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:49:41,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:41,326 INFO L87 Difference]: Start difference. First operand 559 states and 718 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:41,475 INFO L93 Difference]: Finished difference Result 583 states and 740 transitions. [2021-10-13 07:49:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:49:41,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 07:49:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:41,479 INFO L225 Difference]: With dead ends: 583 [2021-10-13 07:49:41,479 INFO L226 Difference]: Without dead ends: 555 [2021-10-13 07:49:41,480 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:49:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-10-13 07:49:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 542. [2021-10-13 07:49:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 536 states have (on average 1.3041044776119404) internal successors, (699), 541 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 699 transitions. [2021-10-13 07:49:41,523 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 699 transitions. Word has length 26 [2021-10-13 07:49:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:41,524 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 699 transitions. [2021-10-13 07:49:41,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 699 transitions. [2021-10-13 07:49:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 07:49:41,525 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:41,525 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:41,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 07:49:41,526 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:41,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:41,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1504423283, now seen corresponding path program 1 times [2021-10-13 07:49:41,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:41,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9244288] [2021-10-13 07:49:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:41,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:41,581 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:41,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9244288] [2021-10-13 07:49:41,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9244288] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:41,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:41,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:49:41,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707523456] [2021-10-13 07:49:41,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:49:41,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:41,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:49:41,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:41,584 INFO L87 Difference]: Start difference. First operand 542 states and 699 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:41,744 INFO L93 Difference]: Finished difference Result 567 states and 722 transitions. [2021-10-13 07:49:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:49:41,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-10-13 07:49:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:41,747 INFO L225 Difference]: With dead ends: 567 [2021-10-13 07:49:41,747 INFO L226 Difference]: Without dead ends: 547 [2021-10-13 07:49:41,748 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:49:41,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-10-13 07:49:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 534. [2021-10-13 07:49:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 528 states have (on average 1.3068181818181819) internal successors, (690), 533 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 690 transitions. [2021-10-13 07:49:41,789 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 690 transitions. Word has length 27 [2021-10-13 07:49:41,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:41,790 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 690 transitions. [2021-10-13 07:49:41,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 690 transitions. [2021-10-13 07:49:41,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 07:49:41,791 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:41,792 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:41,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 07:49:41,792 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:41,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:41,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1155960076, now seen corresponding path program 1 times [2021-10-13 07:49:41,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:41,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677074901] [2021-10-13 07:49:41,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:41,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:41,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:41,873 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:41,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677074901] [2021-10-13 07:49:41,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677074901] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:41,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:41,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:49:41,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978964196] [2021-10-13 07:49:41,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:49:41,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:41,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:49:41,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:49:41,875 INFO L87 Difference]: Start difference. First operand 534 states and 690 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:41,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:41,968 INFO L93 Difference]: Finished difference Result 549 states and 704 transitions. [2021-10-13 07:49:41,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:49:41,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-10-13 07:49:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:41,971 INFO L225 Difference]: With dead ends: 549 [2021-10-13 07:49:41,971 INFO L226 Difference]: Without dead ends: 532 [2021-10-13 07:49:41,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:49:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-10-13 07:49:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2021-10-13 07:49:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 526 states have (on average 1.306083650190114) internal successors, (687), 531 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 687 transitions. [2021-10-13 07:49:42,012 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 687 transitions. Word has length 27 [2021-10-13 07:49:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:42,012 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 687 transitions. [2021-10-13 07:49:42,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 687 transitions. [2021-10-13 07:49:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 07:49:42,013 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:42,013 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:42,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 07:49:42,014 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:42,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1611200436, now seen corresponding path program 1 times [2021-10-13 07:49:42,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:42,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002873123] [2021-10-13 07:49:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:42,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:42,039 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:42,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002873123] [2021-10-13 07:49:42,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002873123] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:42,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:42,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:49:42,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606616266] [2021-10-13 07:49:42,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:42,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:42,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:42,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:42,041 INFO L87 Difference]: Start difference. First operand 532 states and 687 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:42,210 INFO L93 Difference]: Finished difference Result 634 states and 803 transitions. [2021-10-13 07:49:42,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:42,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-10-13 07:49:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:42,214 INFO L225 Difference]: With dead ends: 634 [2021-10-13 07:49:42,214 INFO L226 Difference]: Without dead ends: 615 [2021-10-13 07:49:42,215 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-10-13 07:49:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 532. [2021-10-13 07:49:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 526 states have (on average 1.3041825095057034) internal successors, (686), 531 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 686 transitions. [2021-10-13 07:49:42,257 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 686 transitions. Word has length 27 [2021-10-13 07:49:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:42,258 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 686 transitions. [2021-10-13 07:49:42,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 686 transitions. [2021-10-13 07:49:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 07:49:42,259 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:42,259 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:42,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 07:49:42,260 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1713212070, now seen corresponding path program 1 times [2021-10-13 07:49:42,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:42,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726989037] [2021-10-13 07:49:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:42,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:42,294 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:42,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726989037] [2021-10-13 07:49:42,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726989037] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:42,294 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:42,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:42,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12059384] [2021-10-13 07:49:42,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:42,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:42,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:42,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:42,296 INFO L87 Difference]: Start difference. First operand 532 states and 686 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:42,503 INFO L93 Difference]: Finished difference Result 641 states and 818 transitions. [2021-10-13 07:49:42,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:42,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-10-13 07:49:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:42,506 INFO L225 Difference]: With dead ends: 641 [2021-10-13 07:49:42,506 INFO L226 Difference]: Without dead ends: 532 [2021-10-13 07:49:42,507 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-10-13 07:49:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2021-10-13 07:49:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 526 states have (on average 1.296577946768061) internal successors, (682), 531 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 682 transitions. [2021-10-13 07:49:42,551 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 682 transitions. Word has length 27 [2021-10-13 07:49:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:42,551 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 682 transitions. [2021-10-13 07:49:42,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 682 transitions. [2021-10-13 07:49:42,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 07:49:42,553 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:42,553 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:42,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 07:49:42,553 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:42,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:42,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1843803493, now seen corresponding path program 1 times [2021-10-13 07:49:42,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:42,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40502827] [2021-10-13 07:49:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:42,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:42,590 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:42,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40502827] [2021-10-13 07:49:42,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40502827] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:42,591 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:42,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:49:42,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899307746] [2021-10-13 07:49:42,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:49:42,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:42,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:49:42,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:42,592 INFO L87 Difference]: Start difference. First operand 532 states and 682 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:42,696 INFO L93 Difference]: Finished difference Result 616 states and 769 transitions. [2021-10-13 07:49:42,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:49:42,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-10-13 07:49:42,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:42,699 INFO L225 Difference]: With dead ends: 616 [2021-10-13 07:49:42,699 INFO L226 Difference]: Without dead ends: 599 [2021-10-13 07:49:42,700 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:49:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-10-13 07:49:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 542. [2021-10-13 07:49:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 536 states have (on average 1.296641791044776) internal successors, (695), 541 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 695 transitions. [2021-10-13 07:49:42,746 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 695 transitions. Word has length 28 [2021-10-13 07:49:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:42,746 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 695 transitions. [2021-10-13 07:49:42,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 695 transitions. [2021-10-13 07:49:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 07:49:42,747 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:42,748 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:42,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 07:49:42,748 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:42,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:42,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1622268006, now seen corresponding path program 1 times [2021-10-13 07:49:42,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:42,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697302936] [2021-10-13 07:49:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:42,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:42,790 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:42,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697302936] [2021-10-13 07:49:42,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697302936] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:42,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:42,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:49:42,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426722748] [2021-10-13 07:49:42,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:49:42,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:42,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:49:42,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:49:42,792 INFO L87 Difference]: Start difference. First operand 542 states and 695 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:42,956 INFO L93 Difference]: Finished difference Result 557 states and 709 transitions. [2021-10-13 07:49:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:49:42,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-10-13 07:49:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:42,960 INFO L225 Difference]: With dead ends: 557 [2021-10-13 07:49:42,960 INFO L226 Difference]: Without dead ends: 536 [2021-10-13 07:49:42,961 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:49:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-10-13 07:49:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2021-10-13 07:49:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 530 states have (on average 1.2943396226415094) internal successors, (686), 535 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 686 transitions. [2021-10-13 07:49:43,017 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 686 transitions. Word has length 28 [2021-10-13 07:49:43,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:43,017 INFO L470 AbstractCegarLoop]: Abstraction has 536 states and 686 transitions. [2021-10-13 07:49:43,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 686 transitions. [2021-10-13 07:49:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 07:49:43,019 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:43,019 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:43,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 07:49:43,020 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:43,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:43,020 INFO L82 PathProgramCache]: Analyzing trace with hash -453382508, now seen corresponding path program 1 times [2021-10-13 07:49:43,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:43,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672162882] [2021-10-13 07:49:43,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:43,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:43,089 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:43,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672162882] [2021-10-13 07:49:43,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672162882] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:43,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:43,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:49:43,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096625879] [2021-10-13 07:49:43,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:49:43,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:43,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:49:43,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:49:43,091 INFO L87 Difference]: Start difference. First operand 536 states and 686 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:43,296 INFO L93 Difference]: Finished difference Result 561 states and 709 transitions. [2021-10-13 07:49:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:49:43,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-10-13 07:49:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:43,300 INFO L225 Difference]: With dead ends: 561 [2021-10-13 07:49:43,300 INFO L226 Difference]: Without dead ends: 540 [2021-10-13 07:49:43,301 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.7ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:49:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-10-13 07:49:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 527. [2021-10-13 07:49:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 521 states have (on average 1.2975047984644914) internal successors, (676), 526 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 676 transitions. [2021-10-13 07:49:43,359 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 676 transitions. Word has length 28 [2021-10-13 07:49:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:43,359 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 676 transitions. [2021-10-13 07:49:43,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 676 transitions. [2021-10-13 07:49:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 07:49:43,361 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:43,361 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:43,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-13 07:49:43,362 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:43,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:43,362 INFO L82 PathProgramCache]: Analyzing trace with hash 695346116, now seen corresponding path program 1 times [2021-10-13 07:49:43,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:43,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274422965] [2021-10-13 07:49:43,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:43,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:43,398 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:43,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274422965] [2021-10-13 07:49:43,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274422965] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:43,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:43,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:49:43,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582556298] [2021-10-13 07:49:43,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:43,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:43,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:43,400 INFO L87 Difference]: Start difference. First operand 527 states and 676 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:43,598 INFO L93 Difference]: Finished difference Result 565 states and 716 transitions. [2021-10-13 07:49:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:43,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-10-13 07:49:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:43,602 INFO L225 Difference]: With dead ends: 565 [2021-10-13 07:49:43,602 INFO L226 Difference]: Without dead ends: 561 [2021-10-13 07:49:43,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-10-13 07:49:43,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 500. [2021-10-13 07:49:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 496 states have (on average 1.2903225806451613) internal successors, (640), 499 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 640 transitions. [2021-10-13 07:49:43,644 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 640 transitions. Word has length 28 [2021-10-13 07:49:43,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:43,644 INFO L470 AbstractCegarLoop]: Abstraction has 500 states and 640 transitions. [2021-10-13 07:49:43,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 640 transitions. [2021-10-13 07:49:43,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 07:49:43,646 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:43,646 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:43,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 07:49:43,646 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:43,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:43,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1529539768, now seen corresponding path program 1 times [2021-10-13 07:49:43,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:43,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303303163] [2021-10-13 07:49:43,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:43,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:43,696 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:43,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303303163] [2021-10-13 07:49:43,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303303163] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:43,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:43,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 07:49:43,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279953571] [2021-10-13 07:49:43,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:49:43,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:43,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:49:43,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:49:43,698 INFO L87 Difference]: Start difference. First operand 500 states and 640 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:44,023 INFO L93 Difference]: Finished difference Result 631 states and 789 transitions. [2021-10-13 07:49:44,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:49:44,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-13 07:49:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:44,027 INFO L225 Difference]: With dead ends: 631 [2021-10-13 07:49:44,027 INFO L226 Difference]: Without dead ends: 565 [2021-10-13 07:49:44,028 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 07:49:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-10-13 07:49:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 503. [2021-10-13 07:49:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 499 states have (on average 1.2745490981963927) internal successors, (636), 502 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 636 transitions. [2021-10-13 07:49:44,069 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 636 transitions. Word has length 29 [2021-10-13 07:49:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:44,069 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 636 transitions. [2021-10-13 07:49:44,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 636 transitions. [2021-10-13 07:49:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 07:49:44,070 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:44,070 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:44,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-13 07:49:44,071 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:44,071 INFO L82 PathProgramCache]: Analyzing trace with hash -120439325, now seen corresponding path program 1 times [2021-10-13 07:49:44,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:44,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71771012] [2021-10-13 07:49:44,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:44,072 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:44,117 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:44,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71771012] [2021-10-13 07:49:44,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71771012] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:44,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:44,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:49:44,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306412241] [2021-10-13 07:49:44,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:49:44,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:44,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:49:44,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:49:44,119 INFO L87 Difference]: Start difference. First operand 503 states and 636 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:44,244 INFO L93 Difference]: Finished difference Result 522 states and 654 transitions. [2021-10-13 07:49:44,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:49:44,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-13 07:49:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:44,247 INFO L225 Difference]: With dead ends: 522 [2021-10-13 07:49:44,247 INFO L226 Difference]: Without dead ends: 496 [2021-10-13 07:49:44,248 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:49:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-10-13 07:49:44,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2021-10-13 07:49:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 492 states have (on average 1.2682926829268293) internal successors, (624), 495 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 624 transitions. [2021-10-13 07:49:44,289 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 624 transitions. Word has length 29 [2021-10-13 07:49:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:44,289 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 624 transitions. [2021-10-13 07:49:44,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 624 transitions. [2021-10-13 07:49:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 07:49:44,291 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:44,291 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:44,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-13 07:49:44,291 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:44,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:44,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1964448463, now seen corresponding path program 1 times [2021-10-13 07:49:44,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:44,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487688642] [2021-10-13 07:49:44,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:44,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:44,311 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:44,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487688642] [2021-10-13 07:49:44,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487688642] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:44,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:44,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:44,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292200127] [2021-10-13 07:49:44,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:44,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:44,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:44,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:44,313 INFO L87 Difference]: Start difference. First operand 496 states and 624 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:44,364 INFO L93 Difference]: Finished difference Result 534 states and 659 transitions. [2021-10-13 07:49:44,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:44,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-13 07:49:44,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:44,368 INFO L225 Difference]: With dead ends: 534 [2021-10-13 07:49:44,368 INFO L226 Difference]: Without dead ends: 514 [2021-10-13 07:49:44,368 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:44,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-10-13 07:49:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 496. [2021-10-13 07:49:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 492 states have (on average 1.266260162601626) internal successors, (623), 495 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 623 transitions. [2021-10-13 07:49:44,443 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 623 transitions. Word has length 29 [2021-10-13 07:49:44,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:44,443 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 623 transitions. [2021-10-13 07:49:44,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 623 transitions. [2021-10-13 07:49:44,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 07:49:44,445 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:44,445 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:44,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-13 07:49:44,445 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:44,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:44,446 INFO L82 PathProgramCache]: Analyzing trace with hash 644489272, now seen corresponding path program 1 times [2021-10-13 07:49:44,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:44,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236683607] [2021-10-13 07:49:44,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:44,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:44,497 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:44,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236683607] [2021-10-13 07:49:44,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236683607] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:44,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:44,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:49:44,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850603787] [2021-10-13 07:49:44,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:49:44,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:44,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:49:44,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:49:44,499 INFO L87 Difference]: Start difference. First operand 496 states and 623 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:44,648 INFO L93 Difference]: Finished difference Result 526 states and 650 transitions. [2021-10-13 07:49:44,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:49:44,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-13 07:49:44,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:44,651 INFO L225 Difference]: With dead ends: 526 [2021-10-13 07:49:44,651 INFO L226 Difference]: Without dead ends: 505 [2021-10-13 07:49:44,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:49:44,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-13 07:49:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 484. [2021-10-13 07:49:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 480 states have (on average 1.2625) internal successors, (606), 483 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 606 transitions. [2021-10-13 07:49:44,693 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 606 transitions. Word has length 29 [2021-10-13 07:49:44,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:44,694 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 606 transitions. [2021-10-13 07:49:44,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,694 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 606 transitions. [2021-10-13 07:49:44,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 07:49:44,695 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:44,695 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:44,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-13 07:49:44,696 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:44,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:44,696 INFO L82 PathProgramCache]: Analyzing trace with hash 692479088, now seen corresponding path program 1 times [2021-10-13 07:49:44,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:44,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842409431] [2021-10-13 07:49:44,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:44,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:44,717 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:44,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842409431] [2021-10-13 07:49:44,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842409431] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:44,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:44,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:44,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900244674] [2021-10-13 07:49:44,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:44,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:44,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:44,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:44,719 INFO L87 Difference]: Start difference. First operand 484 states and 606 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:44,795 INFO L93 Difference]: Finished difference Result 555 states and 686 transitions. [2021-10-13 07:49:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-13 07:49:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:44,797 INFO L225 Difference]: With dead ends: 555 [2021-10-13 07:49:44,797 INFO L226 Difference]: Without dead ends: 328 [2021-10-13 07:49:44,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-10-13 07:49:44,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 306. [2021-10-13 07:49:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 302 states have (on average 1.2086092715231789) internal successors, (365), 305 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 365 transitions. [2021-10-13 07:49:44,827 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 365 transitions. Word has length 29 [2021-10-13 07:49:44,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:44,827 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 365 transitions. [2021-10-13 07:49:44,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 365 transitions. [2021-10-13 07:49:44,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 07:49:44,828 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:44,829 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:44,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-13 07:49:44,829 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:44,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:44,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1090089878, now seen corresponding path program 1 times [2021-10-13 07:49:44,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:44,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326137368] [2021-10-13 07:49:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:44,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:44,892 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:44,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326137368] [2021-10-13 07:49:44,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326137368] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:44,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:44,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 07:49:44,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069617329] [2021-10-13 07:49:44,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:49:44,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:44,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:49:44,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:49:44,894 INFO L87 Difference]: Start difference. First operand 306 states and 365 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:45,092 INFO L93 Difference]: Finished difference Result 362 states and 423 transitions. [2021-10-13 07:49:45,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:49:45,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-13 07:49:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:45,093 INFO L225 Difference]: With dead ends: 362 [2021-10-13 07:49:45,093 INFO L226 Difference]: Without dead ends: 270 [2021-10-13 07:49:45,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.2ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-13 07:49:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-13 07:49:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 248. [2021-10-13 07:49:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 244 states have (on average 1.1762295081967213) internal successors, (287), 247 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 287 transitions. [2021-10-13 07:49:45,122 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 287 transitions. Word has length 29 [2021-10-13 07:49:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:45,123 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 287 transitions. [2021-10-13 07:49:45,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 287 transitions. [2021-10-13 07:49:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 07:49:45,124 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:45,124 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:45,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-13 07:49:45,125 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:45,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:45,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1241673930, now seen corresponding path program 1 times [2021-10-13 07:49:45,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:45,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221478031] [2021-10-13 07:49:45,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:45,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:45,146 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:45,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221478031] [2021-10-13 07:49:45,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221478031] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:45,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:45,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:45,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120534270] [2021-10-13 07:49:45,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:45,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:45,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:45,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:45,148 INFO L87 Difference]: Start difference. First operand 248 states and 287 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:45,183 INFO L93 Difference]: Finished difference Result 289 states and 328 transitions. [2021-10-13 07:49:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:45,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2021-10-13 07:49:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:45,185 INFO L225 Difference]: With dead ends: 289 [2021-10-13 07:49:45,185 INFO L226 Difference]: Without dead ends: 253 [2021-10-13 07:49:45,186 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-10-13 07:49:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2021-10-13 07:49:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 244 states have (on average 1.1721311475409837) internal successors, (286), 247 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 286 transitions. [2021-10-13 07:49:45,212 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 286 transitions. Word has length 32 [2021-10-13 07:49:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:45,212 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 286 transitions. [2021-10-13 07:49:45,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2021-10-13 07:49:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 07:49:45,213 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:45,213 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:45,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-13 07:49:45,214 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:45,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:45,214 INFO L82 PathProgramCache]: Analyzing trace with hash 156718672, now seen corresponding path program 1 times [2021-10-13 07:49:45,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:45,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564414540] [2021-10-13 07:49:45,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:45,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:45,250 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:45,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564414540] [2021-10-13 07:49:45,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564414540] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:45,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:45,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:45,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370143770] [2021-10-13 07:49:45,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:49:45,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:45,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:49:45,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:49:45,253 INFO L87 Difference]: Start difference. First operand 248 states and 286 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:45,384 INFO L93 Difference]: Finished difference Result 257 states and 294 transitions. [2021-10-13 07:49:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:49:45,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2021-10-13 07:49:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:45,386 INFO L225 Difference]: With dead ends: 257 [2021-10-13 07:49:45,386 INFO L226 Difference]: Without dead ends: 240 [2021-10-13 07:49:45,387 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-10-13 07:49:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2021-10-13 07:49:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 232 states have (on average 1.1724137931034482) internal successors, (272), 235 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 272 transitions. [2021-10-13 07:49:45,418 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 272 transitions. Word has length 34 [2021-10-13 07:49:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:45,418 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 272 transitions. [2021-10-13 07:49:45,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 272 transitions. [2021-10-13 07:49:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 07:49:45,420 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:45,420 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:45,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-13 07:49:45,421 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:45,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash -856105982, now seen corresponding path program 1 times [2021-10-13 07:49:45,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:45,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63274371] [2021-10-13 07:49:45,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:45,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:45,553 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:45,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63274371] [2021-10-13 07:49:45,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63274371] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:45,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:45,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:49:45,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524066839] [2021-10-13 07:49:45,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:49:45,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:45,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:49:45,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:49:45,558 INFO L87 Difference]: Start difference. First operand 236 states and 272 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:45,717 INFO L93 Difference]: Finished difference Result 259 states and 292 transitions. [2021-10-13 07:49:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:49:45,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2021-10-13 07:49:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:45,719 INFO L225 Difference]: With dead ends: 259 [2021-10-13 07:49:45,719 INFO L226 Difference]: Without dead ends: 212 [2021-10-13 07:49:45,720 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 103.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:49:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-10-13 07:49:45,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 198. [2021-10-13 07:49:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 195 states have (on average 1.158974358974359) internal successors, (226), 197 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 226 transitions. [2021-10-13 07:49:45,752 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 226 transitions. Word has length 34 [2021-10-13 07:49:45,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:45,752 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 226 transitions. [2021-10-13 07:49:45,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2021-10-13 07:49:45,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 07:49:45,753 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:45,754 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:45,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-13 07:49:45,754 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:45,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:45,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1806263113, now seen corresponding path program 1 times [2021-10-13 07:49:45,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:45,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640954755] [2021-10-13 07:49:45,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:45,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:49:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:49:45,784 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:49:45,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640954755] [2021-10-13 07:49:45,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640954755] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:49:45,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:49:45,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:49:45,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366796751] [2021-10-13 07:49:45,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:49:45,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:49:45,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:49:45,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:45,786 INFO L87 Difference]: Start difference. First operand 198 states and 226 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:49:45,828 INFO L93 Difference]: Finished difference Result 208 states and 236 transitions. [2021-10-13 07:49:45,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:49:45,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2021-10-13 07:49:45,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:49:45,830 INFO L225 Difference]: With dead ends: 208 [2021-10-13 07:49:45,830 INFO L226 Difference]: Without dead ends: 198 [2021-10-13 07:49:45,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:49:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-13 07:49:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-10-13 07:49:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 195 states have (on average 1.1487179487179486) internal successors, (224), 197 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 224 transitions. [2021-10-13 07:49:45,895 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 224 transitions. Word has length 34 [2021-10-13 07:49:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:49:45,895 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 224 transitions. [2021-10-13 07:49:45,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:49:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 224 transitions. [2021-10-13 07:49:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 07:49:45,896 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:49:45,897 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:49:45,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-13 07:49:45,897 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-13 07:49:45,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:49:45,898 INFO L82 PathProgramCache]: Analyzing trace with hash -829704437, now seen corresponding path program 1 times [2021-10-13 07:49:45,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:49:45,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117855650] [2021-10-13 07:49:45,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:49:45,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:49:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:49:45,924 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 07:49:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:49:45,992 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-13 07:49:45,992 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 07:49:45,994 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:45,996 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:45,997 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:45,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:45,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:45,998 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:45,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:45,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:45,999 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,000 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,007 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,008 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,009 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,010 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,011 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,012 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,012 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,012 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,012 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,013 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,013 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,013 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,013 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,014 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,014 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,014 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,014 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,015 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,015 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,015 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,015 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,015 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,016 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,016 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,016 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,016 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,017 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,017 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,017 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,018 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,018 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,018 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,018 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,019 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,022 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,023 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,024 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:49:46,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-13 07:49:46,032 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:49:46,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:49:46 BoogieIcfgContainer [2021-10-13 07:49:46,153 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:49:46,153 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:49:46,154 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:49:46,154 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:49:46,155 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:49:32" (3/4) ... [2021-10-13 07:49:46,157 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 07:49:46,304 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:49:46,304 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:49:46,307 INFO L168 Benchmark]: Toolchain (without parser) took 20552.03 ms. Allocated memory was 86.0 MB in the beginning and 534.8 MB in the end (delta: 448.8 MB). Free memory was 45.2 MB in the beginning and 434.0 MB in the end (delta: -388.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 16.1 GB. [2021-10-13 07:49:46,307 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 86.0 MB. Free memory is still 63.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:49:46,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 959.42 ms. Allocated memory was 86.0 MB in the beginning and 146.8 MB in the end (delta: 60.8 MB). Free memory was 45.0 MB in the beginning and 102.8 MB in the end (delta: -57.8 MB). Peak memory consumption was 4.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:49:46,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 264.12 ms. Allocated memory is still 146.8 MB. Free memory was 102.8 MB in the beginning and 82.4 MB in the end (delta: 20.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-13 07:49:46,309 INFO L168 Benchmark]: Boogie Preprocessor took 186.22 ms. Allocated memory is still 146.8 MB. Free memory was 82.4 MB in the beginning and 69.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:49:46,310 INFO L168 Benchmark]: RCFGBuilder took 5721.08 ms. Allocated memory was 146.8 MB in the beginning and 327.2 MB in the end (delta: 180.4 MB). Free memory was 69.9 MB in the beginning and 261.4 MB in the end (delta: -191.5 MB). Peak memory consumption was 101.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:49:46,315 INFO L168 Benchmark]: TraceAbstraction took 13246.80 ms. Allocated memory was 327.2 MB in the beginning and 534.8 MB in the end (delta: 207.6 MB). Free memory was 260.3 MB in the beginning and 444.5 MB in the end (delta: -184.2 MB). Peak memory consumption was 22.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:49:46,315 INFO L168 Benchmark]: Witness Printer took 151.27 ms. Allocated memory is still 534.8 MB. Free memory was 444.5 MB in the beginning and 434.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 07:49:46,317 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.27 ms. Allocated memory is still 86.0 MB. Free memory is still 63.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 959.42 ms. Allocated memory was 86.0 MB in the beginning and 146.8 MB in the end (delta: 60.8 MB). Free memory was 45.0 MB in the beginning and 102.8 MB in the end (delta: -57.8 MB). Peak memory consumption was 4.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 264.12 ms. Allocated memory is still 146.8 MB. Free memory was 102.8 MB in the beginning and 82.4 MB in the end (delta: 20.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 186.22 ms. Allocated memory is still 146.8 MB. Free memory was 82.4 MB in the beginning and 69.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 5721.08 ms. Allocated memory was 146.8 MB in the beginning and 327.2 MB in the end (delta: 180.4 MB). Free memory was 69.9 MB in the beginning and 261.4 MB in the end (delta: -191.5 MB). Peak memory consumption was 101.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13246.80 ms. Allocated memory was 327.2 MB in the beginning and 534.8 MB in the end (delta: 207.6 MB). Free memory was 260.3 MB in the beginning and 444.5 MB in the end (delta: -184.2 MB). Peak memory consumption was 22.4 MB. Max. memory is 16.1 GB. * Witness Printer took 151.27 ms. Allocated memory is still 534.8 MB. Free memory was 444.5 MB in the beginning and 434.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 59]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 [L1767] COND TRUE irp_choice == 0 [L1768] pirp__IoStatus__Status = -1073741637 [L1769] myStatus = -1073741637 [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND FALSE !(myStatus >= 0) [L1587] return (myStatus); [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 [L1944] returnVal2 = 0 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1981] return (returnVal2); [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND FALSE !(\read(we_should_unload)) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1825] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1826] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1833] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1834] COND FALSE !(s == MPR3) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1841] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1842] COND TRUE status != -1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1843] COND TRUE s != SKIP2 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1844] COND FALSE !(s != IPC) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1857] COND FALSE !(pended != 1) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1869] COND TRUE status != 259 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L59] reach_error() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 779 locations, 103 error locations. Started 1 CEGAR loops. OverallTime: 13029.4ms, OverallIterations: 45, TraceHistogramMax: 1, EmptinessCheckTime: 96.7ms, AutomataDifference: 8212.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 35.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 25841 SDtfs, 12280 SDslu, 43843 SDs, 0 SdLazy, 5346 SolverSat, 764 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4098.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 767.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=779occurred in iteration=0, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1810.6ms AutomataMinimizationTime, 44 MinimizatonAttempts, 1017 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 126.5ms SsaConstructionTime, 551.7ms SatisfiabilityAnalysisTime, 1510.3ms InterpolantComputationTime, 1080 NumberOfCodeBlocks, 1080 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1000 ConstructedInterpolants, 0 QuantifiedInterpolants, 2967 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 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 RESULT: Ultimate proved your program to be incorrect! [2021-10-13 07:49:46,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8836187e-2f44-4450-a7db-8a05577b7a59/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...