./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/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_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG --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 bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-b2eff8b [2021-10-29 05:24:47,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 05:24:47,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 05:24:47,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 05:24:47,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 05:24:47,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 05:24:47,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 05:24:47,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 05:24:47,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 05:24:47,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 05:24:47,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 05:24:47,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 05:24:47,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 05:24:47,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 05:24:47,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 05:24:47,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 05:24:47,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 05:24:47,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 05:24:47,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 05:24:47,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 05:24:47,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 05:24:47,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 05:24:47,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 05:24:47,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 05:24:47,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 05:24:47,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 05:24:47,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 05:24:47,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 05:24:47,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 05:24:47,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 05:24:47,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 05:24:47,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 05:24:47,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 05:24:47,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 05:24:47,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 05:24:47,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 05:24:47,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 05:24:47,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 05:24:47,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 05:24:47,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 05:24:47,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 05:24:47,681 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 05:24:47,723 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 05:24:47,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 05:24:47,729 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 05:24:47,729 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 05:24:47,730 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 05:24:47,730 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 05:24:47,730 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 05:24:47,730 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 05:24:47,737 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 05:24:47,737 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 05:24:47,738 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 05:24:47,739 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 05:24:47,739 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 05:24:47,739 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 05:24:47,739 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 05:24:47,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 05:24:47,740 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 05:24:47,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 05:24:47,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 05:24:47,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 05:24:47,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 05:24:47,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 05:24:47,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 05:24:47,742 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 05:24:47,742 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 05:24:47,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 05:24:47,743 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 05:24:47,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 05:24:47,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 05:24:47,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 05:24:47,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:24:47,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 05:24:47,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 05:24:47,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 05:24:47,746 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 05:24:47,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 05:24:47,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 05:24:47,747 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 05:24:47,747 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 05:24:47,747 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_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/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_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG 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 -> bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 [2021-10-29 05:24:48,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 05:24:48,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 05:24:48,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 05:24:48,069 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 05:24:48,070 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 05:24:48,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-29 05:24:48,132 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/data/0071d3a45/3635c0e53df64bdfa21705f427c63535/FLAGab330ed02 [2021-10-29 05:24:48,798 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 05:24:48,807 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-29 05:24:48,839 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/data/0071d3a45/3635c0e53df64bdfa21705f427c63535/FLAGab330ed02 [2021-10-29 05:24:48,991 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/data/0071d3a45/3635c0e53df64bdfa21705f427c63535 [2021-10-29 05:24:48,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 05:24:48,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 05:24:49,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 05:24:49,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 05:24:49,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 05:24:49,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:24:48" (1/1) ... [2021-10-29 05:24:49,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7537a252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:24:49, skipping insertion in model container [2021-10-29 05:24:49,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:24:48" (1/1) ... [2021-10-29 05:24:49,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 05:24:49,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 05:24:49,339 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_fda8796c-7d92-4792-9844-607777014ece/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-29 05:24:49,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:24:49,579 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 05:24:49,603 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_fda8796c-7d92-4792-9844-607777014ece/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-29 05:24:49,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:24:49,752 INFO L208 MainTranslator]: Completed translation [2021-10-29 05:24:49,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:24:49 WrapperNode [2021-10-29 05:24:49,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 05:24:49,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 05:24:49,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 05:24:49,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 05:24:49,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:24:49" (1/1) ... [2021-10-29 05:24:49,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:24:49" (1/1) ... [2021-10-29 05:24:50,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 05:24:50,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 05:24:50,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 05:24:50,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 05:24:50,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:24:49" (1/1) ... [2021-10-29 05:24:50,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:24:49" (1/1) ... [2021-10-29 05:24:50,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:24:49" (1/1) ... [2021-10-29 05:24:50,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:24:49" (1/1) ... [2021-10-29 05:24:50,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:24:49" (1/1) ... [2021-10-29 05:24:50,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:24:49" (1/1) ... [2021-10-29 05:24:50,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:24:49" (1/1) ... [2021-10-29 05:24:50,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 05:24:50,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 05:24:50,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 05:24:50,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 05:24:50,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:24:49" (1/1) ... [2021-10-29 05:24:50,222 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:24:50,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:24:50,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 05:24:50,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 05:24:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 05:24:50,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 05:24:50,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 05:24:50,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 05:24:50,572 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,574 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,590 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,612 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,625 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,635 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,646 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,662 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,670 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,687 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,707 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,726 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,735 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,745 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,751 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,762 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,765 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,775 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,777 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,780 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,782 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,785 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,788 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,794 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,796 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,804 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,807 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,809 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,811 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,815 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,819 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,822 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,823 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,849 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,851 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,853 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,854 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,856 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,859 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,861 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,862 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,865 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:50,869 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:24:52,905 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1271: assume false; [2021-10-29 05:24:52,905 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1272: assume !false; [2021-10-29 05:24:52,906 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-29 05:24:52,907 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-29 05:24:52,907 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1230: assume !false; [2021-10-29 05:24:52,907 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##287: assume false; [2021-10-29 05:24:52,908 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##288: assume !false; [2021-10-29 05:24:52,908 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1229: assume false; [2021-10-29 05:24:52,909 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1210: assume false; [2021-10-29 05:24:52,909 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1211: assume !false; [2021-10-29 05:24:52,909 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##319: assume false; [2021-10-29 05:24:52,910 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##320: assume !false; [2021-10-29 05:24:52,910 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1160: assume !false; [2021-10-29 05:24:52,910 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1159: assume false; [2021-10-29 05:24:52,910 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##371: assume false; [2021-10-29 05:24:52,910 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##372: assume !false; [2021-10-29 05:24:52,911 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1108: assume false; [2021-10-29 05:24:52,911 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1109: assume !false; [2021-10-29 05:24:52,911 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##346: assume false; [2021-10-29 05:24:52,911 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##347: assume !false; [2021-10-29 05:24:52,911 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume false; [2021-10-29 05:24:52,912 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##417: assume !false; [2021-10-29 05:24:52,912 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1050: assume !false; [2021-10-29 05:24:52,912 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res := 0; [2021-10-29 05:24:52,912 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1049: assume false; [2021-10-29 05:24:52,913 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1003: assume false; [2021-10-29 05:24:52,913 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1004: assume !false; [2021-10-29 05:24:52,913 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##461: assume !false; [2021-10-29 05:24:52,913 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##460: assume false; [2021-10-29 05:24:52,914 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##487: assume !false; [2021-10-29 05:24:52,914 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##486: assume false; [2021-10-29 05:24:52,914 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##526: assume !false; [2021-10-29 05:24:52,914 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##525: assume false; [2021-10-29 05:24:52,914 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume !false; [2021-10-29 05:24:52,915 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##70: assume false; [2021-10-29 05:24:52,915 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2021-10-29 05:24:52,915 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2021-10-29 05:24:52,915 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2021-10-29 05:24:52,916 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2021-10-29 05:24:52,917 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-10-29 05:24:52,917 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-10-29 05:24:52,918 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##573: assume !false; [2021-10-29 05:24:52,919 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##572: assume false; [2021-10-29 05:24:52,919 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !false; [2021-10-29 05:24:52,920 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume false; [2021-10-29 05:24:52,920 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-10-29 05:24:52,921 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-10-29 05:24:52,921 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume !false; [2021-10-29 05:24:52,921 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##638: assume false; [2021-10-29 05:24:52,921 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1612: assume false; [2021-10-29 05:24:52,921 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1613: assume !false; [2021-10-29 05:24:52,922 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##757: assume !false; [2021-10-29 05:24:52,922 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##756: assume false; [2021-10-29 05:24:52,922 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##717: assume !false; [2021-10-29 05:24:52,922 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##716: assume false; [2021-10-29 05:24:52,923 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1506: assume false; [2021-10-29 05:24:52,923 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1507: assume !false; [2021-10-29 05:24:52,923 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1564: assume false; [2021-10-29 05:24:52,924 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1565: assume !false; [2021-10-29 05:24:52,924 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##856: assume false; [2021-10-29 05:24:52,924 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##857: assume !false; [2021-10-29 05:24:52,924 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##801: assume false; [2021-10-29 05:24:52,924 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##802: assume !false; [2021-10-29 05:24:52,925 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##832: assume !false; [2021-10-29 05:24:52,926 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##831: assume false; [2021-10-29 05:24:52,929 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1426: assume false; [2021-10-29 05:24:52,929 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1427: assume !false; [2021-10-29 05:24:52,930 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1476: assume false; [2021-10-29 05:24:52,931 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1477: assume !false; [2021-10-29 05:24:52,931 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1398: assume false; [2021-10-29 05:24:52,932 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1399: assume !false; [2021-10-29 05:24:52,932 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##961: assume !false; [2021-10-29 05:24:52,932 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##960: assume false; [2021-10-29 05:24:52,932 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##909: assume false; [2021-10-29 05:24:52,941 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##910: assume !false; [2021-10-29 05:24:52,942 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1301: assume false; [2021-10-29 05:24:52,942 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1302: assume !false; [2021-10-29 05:24:52,942 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##188: assume !false; [2021-10-29 05:24:52,943 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume false; [2021-10-29 05:24:52,943 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##148: assume false; [2021-10-29 05:24:52,943 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##149: assume !false; [2021-10-29 05:24:52,943 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1354: assume false; [2021-10-29 05:24:52,943 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1355: assume !false; [2021-10-29 05:24:52,944 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1341: assume false; [2021-10-29 05:24:52,944 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1342: assume !false; [2021-10-29 05:24:52,944 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume false; [2021-10-29 05:24:52,944 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !false; [2021-10-29 05:24:55,937 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 05:24:55,937 INFO L299 CfgBuilder]: Removed 555 assume(true) statements. [2021-10-29 05:24:55,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:24:55 BoogieIcfgContainer [2021-10-29 05:24:55,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 05:24:55,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 05:24:55,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 05:24:55,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 05:24:55,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 05:24:48" (1/3) ... [2021-10-29 05:24:55,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29816149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:24:55, skipping insertion in model container [2021-10-29 05:24:55,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:24:49" (2/3) ... [2021-10-29 05:24:55,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29816149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:24:55, skipping insertion in model container [2021-10-29 05:24:55,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:24:55" (3/3) ... [2021-10-29 05:24:55,953 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2021-10-29 05:24:55,960 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 05:24:55,960 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2021-10-29 05:24:56,029 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 05:24:56,037 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 05:24:56,037 INFO L340 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2021-10-29 05:24:56,080 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-29 05:24:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 05:24:56,088 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:24:56,089 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:24:56,090 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-29 05:24:56,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:24:56,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1428884645, now seen corresponding path program 1 times [2021-10-29 05:24:56,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:24:56,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116129093] [2021-10-29 05:24:56,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:24:56,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:24:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:24:56,351 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-29 05:24:56,351 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:24:56,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116129093] [2021-10-29 05:24:56,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116129093] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:24:56,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:24:56,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:24:56,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512419198] [2021-10-29 05:24:56,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:24:56,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:24:56,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:24:56,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:56,388 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-29 05:24:57,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:24:57,054 INFO L93 Difference]: Finished difference Result 1301 states and 1928 transitions. [2021-10-29 05:24:57,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:24:57,056 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-29 05:24:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:24:57,077 INFO L225 Difference]: With dead ends: 1301 [2021-10-29 05:24:57,077 INFO L226 Difference]: Without dead ends: 736 [2021-10-29 05:24:57,084 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2021-10-29 05:24:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 734. [2021-10-29 05:24:57,172 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-29 05:24:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1028 transitions. [2021-10-29 05:24:57,183 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1028 transitions. Word has length 8 [2021-10-29 05:24:57,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:24:57,184 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1028 transitions. [2021-10-29 05:24:57,184 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-29 05:24:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1028 transitions. [2021-10-29 05:24:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 05:24:57,187 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:24:57,187 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:24:57,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 05:24:57,188 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-29 05:24:57,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:24:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1293410765, now seen corresponding path program 1 times [2021-10-29 05:24:57,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:24:57,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814321426] [2021-10-29 05:24:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:24:57,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:24:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:24:57,313 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-29 05:24:57,314 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:24:57,314 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814321426] [2021-10-29 05:24:57,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814321426] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:24:57,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:24:57,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:24:57,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647043142] [2021-10-29 05:24:57,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:24:57,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:24:57,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:24:57,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:57,319 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-29 05:24:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:24:57,376 INFO L93 Difference]: Finished difference Result 931 states and 1280 transitions. [2021-10-29 05:24:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:24:57,377 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-29 05:24:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:24:57,384 INFO L225 Difference]: With dead ends: 931 [2021-10-29 05:24:57,385 INFO L226 Difference]: Without dead ends: 734 [2021-10-29 05:24:57,386 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2021-10-29 05:24:57,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 629. [2021-10-29 05:24:57,424 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-29 05:24:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 887 transitions. [2021-10-29 05:24:57,430 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 887 transitions. Word has length 9 [2021-10-29 05:24:57,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:24:57,430 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 887 transitions. [2021-10-29 05:24:57,430 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-29 05:24:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 887 transitions. [2021-10-29 05:24:57,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 05:24:57,438 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:24:57,438 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:24:57,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 05:24:57,440 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-29 05:24:57,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:24:57,445 INFO L85 PathProgramCache]: Analyzing trace with hash -224003595, now seen corresponding path program 1 times [2021-10-29 05:24:57,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:24:57,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229493910] [2021-10-29 05:24:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:24:57,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:24:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:24:57,523 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-29 05:24:57,523 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:24:57,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229493910] [2021-10-29 05:24:57,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229493910] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:24:57,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:24:57,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:24:57,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328465183] [2021-10-29 05:24:57,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:24:57,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:24:57,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:24:57,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:57,526 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-29 05:24:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:24:57,798 INFO L93 Difference]: Finished difference Result 651 states and 912 transitions. [2021-10-29 05:24:57,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:24:57,799 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-29 05:24:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:24:57,803 INFO L225 Difference]: With dead ends: 651 [2021-10-29 05:24:57,803 INFO L226 Difference]: Without dead ends: 629 [2021-10-29 05:24:57,803 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:57,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-10-29 05:24:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2021-10-29 05:24:57,824 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-29 05:24:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 886 transitions. [2021-10-29 05:24:57,827 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 886 transitions. Word has length 10 [2021-10-29 05:24:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:24:57,827 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 886 transitions. [2021-10-29 05:24:57,828 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-29 05:24:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 886 transitions. [2021-10-29 05:24:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-29 05:24:57,829 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:24:57,829 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:24:57,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 05:24:57,830 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-29 05:24:57,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:24:57,830 INFO L85 PathProgramCache]: Analyzing trace with hash 725022092, now seen corresponding path program 1 times [2021-10-29 05:24:57,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:24:57,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562271563] [2021-10-29 05:24:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:24:57,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:24:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:24:57,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-29 05:24:57,892 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:24:57,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562271563] [2021-10-29 05:24:57,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562271563] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:24:57,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:24:57,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:24:57,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071228673] [2021-10-29 05:24:57,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:24:57,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:24:57,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:24:57,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:57,894 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-29 05:24:58,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:24:58,223 INFO L93 Difference]: Finished difference Result 1041 states and 1426 transitions. [2021-10-29 05:24:58,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:24:58,224 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-29 05:24:58,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:24:58,229 INFO L225 Difference]: With dead ends: 1041 [2021-10-29 05:24:58,230 INFO L226 Difference]: Without dead ends: 874 [2021-10-29 05:24:58,231 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-10-29 05:24:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 742. [2021-10-29 05:24:58,261 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-29 05:24:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1056 transitions. [2021-10-29 05:24:58,265 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1056 transitions. Word has length 12 [2021-10-29 05:24:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:24:58,265 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 1056 transitions. [2021-10-29 05:24:58,265 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-29 05:24:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1056 transitions. [2021-10-29 05:24:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 05:24:58,267 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:24:58,267 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:24:58,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 05:24:58,267 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-29 05:24:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:24:58,268 INFO L85 PathProgramCache]: Analyzing trace with hash 993192964, now seen corresponding path program 1 times [2021-10-29 05:24:58,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:24:58,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348998808] [2021-10-29 05:24:58,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:24:58,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:24:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:24:58,381 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-29 05:24:58,381 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:24:58,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348998808] [2021-10-29 05:24:58,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348998808] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:24:58,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:24:58,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:24:58,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087201497] [2021-10-29 05:24:58,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:24:58,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:24:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:24:58,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:24:58,383 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-29 05:24:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:24:58,789 INFO L93 Difference]: Finished difference Result 1044 states and 1448 transitions. [2021-10-29 05:24:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:24:58,790 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-29 05:24:58,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:24:58,794 INFO L225 Difference]: With dead ends: 1044 [2021-10-29 05:24:58,794 INFO L226 Difference]: Without dead ends: 629 [2021-10-29 05:24:58,795 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:24:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-10-29 05:24:58,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 580. [2021-10-29 05:24:58,821 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-29 05:24:58,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 800 transitions. [2021-10-29 05:24:58,825 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 800 transitions. Word has length 13 [2021-10-29 05:24:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:24:58,825 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 800 transitions. [2021-10-29 05:24:58,826 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-29 05:24:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 800 transitions. [2021-10-29 05:24:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 05:24:58,827 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:24:58,827 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:24:58,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 05:24:58,828 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-29 05:24:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:24:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1649645807, now seen corresponding path program 1 times [2021-10-29 05:24:58,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:24:58,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78363724] [2021-10-29 05:24:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:24:58,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:24:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:24:58,902 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-29 05:24:58,902 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:24:58,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78363724] [2021-10-29 05:24:58,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78363724] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:24:58,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:24:58,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:24:58,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828427175] [2021-10-29 05:24:58,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:24:58,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:24:58,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:24:58,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:58,904 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-29 05:24:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:24:59,124 INFO L93 Difference]: Finished difference Result 580 states and 800 transitions. [2021-10-29 05:24:59,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:24:59,125 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-29 05:24:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:24:59,128 INFO L225 Difference]: With dead ends: 580 [2021-10-29 05:24:59,128 INFO L226 Difference]: Without dead ends: 562 [2021-10-29 05:24:59,129 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:59,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-10-29 05:24:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-10-29 05:24:59,158 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-29 05:24:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 782 transitions. [2021-10-29 05:24:59,161 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 782 transitions. Word has length 14 [2021-10-29 05:24:59,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:24:59,161 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 782 transitions. [2021-10-29 05:24:59,162 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-29 05:24:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 782 transitions. [2021-10-29 05:24:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 05:24:59,163 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:24:59,163 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:24:59,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 05:24:59,164 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-29 05:24:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:24:59,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1629262432, now seen corresponding path program 1 times [2021-10-29 05:24:59,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:24:59,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193917486] [2021-10-29 05:24:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:24:59,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:24:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:24:59,245 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-29 05:24:59,245 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:24:59,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193917486] [2021-10-29 05:24:59,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193917486] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:24:59,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:24:59,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:24:59,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511788046] [2021-10-29 05:24:59,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:24:59,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:24:59,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:24:59,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:24:59,247 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-29 05:24:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:24:59,335 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2021-10-29 05:24:59,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:24:59,335 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-29 05:24:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:24:59,339 INFO L225 Difference]: With dead ends: 758 [2021-10-29 05:24:59,339 INFO L226 Difference]: Without dead ends: 613 [2021-10-29 05:24:59,340 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:24:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-10-29 05:24:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 552. [2021-10-29 05:24:59,375 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-29 05:24:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 766 transitions. [2021-10-29 05:24:59,378 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 766 transitions. Word has length 14 [2021-10-29 05:24:59,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:24:59,378 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 766 transitions. [2021-10-29 05:24:59,379 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-29 05:24:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 766 transitions. [2021-10-29 05:24:59,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-29 05:24:59,380 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:24:59,380 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:24:59,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 05:24:59,381 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-29 05:24:59,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:24:59,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1145033940, now seen corresponding path program 1 times [2021-10-29 05:24:59,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:24:59,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655349275] [2021-10-29 05:24:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:24:59,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:24:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:24:59,447 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-29 05:24:59,447 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:24:59,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655349275] [2021-10-29 05:24:59,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655349275] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:24:59,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:24:59,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:24:59,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043133096] [2021-10-29 05:24:59,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:24:59,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:24:59,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:24:59,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:59,450 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-29 05:24:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:24:59,493 INFO L93 Difference]: Finished difference Result 606 states and 829 transitions. [2021-10-29 05:24:59,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:24:59,493 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-29 05:24:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:24:59,498 INFO L225 Difference]: With dead ends: 606 [2021-10-29 05:24:59,499 INFO L226 Difference]: Without dead ends: 583 [2021-10-29 05:24:59,499 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-10-29 05:24:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 572. [2021-10-29 05:24:59,531 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-29 05:24:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 793 transitions. [2021-10-29 05:24:59,534 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 793 transitions. Word has length 17 [2021-10-29 05:24:59,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:24:59,534 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 793 transitions. [2021-10-29 05:24:59,535 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-29 05:24:59,535 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 793 transitions. [2021-10-29 05:24:59,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 05:24:59,536 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:24:59,536 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:24:59,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 05:24:59,537 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-29 05:24:59,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:24:59,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1721362675, now seen corresponding path program 1 times [2021-10-29 05:24:59,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:24:59,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562102674] [2021-10-29 05:24:59,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:24:59,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:24:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:24:59,600 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-29 05:24:59,600 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:24:59,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562102674] [2021-10-29 05:24:59,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562102674] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:24:59,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:24:59,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:24:59,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74973767] [2021-10-29 05:24:59,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:24:59,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:24:59,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:24:59,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:59,607 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-29 05:24:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:24:59,800 INFO L93 Difference]: Finished difference Result 700 states and 965 transitions. [2021-10-29 05:24:59,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:24:59,800 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-29 05:24:59,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:24:59,804 INFO L225 Difference]: With dead ends: 700 [2021-10-29 05:24:59,804 INFO L226 Difference]: Without dead ends: 562 [2021-10-29 05:24:59,805 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:59,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-10-29 05:24:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-10-29 05:24:59,837 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-29 05:24:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 778 transitions. [2021-10-29 05:24:59,840 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 778 transitions. Word has length 19 [2021-10-29 05:24:59,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:24:59,840 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 778 transitions. [2021-10-29 05:24:59,840 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-29 05:24:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 778 transitions. [2021-10-29 05:24:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 05:24:59,842 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:24:59,842 INFO L513 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-29 05:24:59,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 05:24:59,844 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-29 05:24:59,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:24:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1713187916, now seen corresponding path program 1 times [2021-10-29 05:24:59,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:24:59,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671597841] [2021-10-29 05:24:59,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:24:59,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:24:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:24:59,895 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-29 05:24:59,896 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:24:59,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671597841] [2021-10-29 05:24:59,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671597841] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:24:59,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:24:59,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:24:59,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072332581] [2021-10-29 05:24:59,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:24:59,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:24:59,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:24:59,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:24:59,898 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-29 05:25:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:00,137 INFO L93 Difference]: Finished difference Result 689 states and 939 transitions. [2021-10-29 05:25:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:00,137 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-29 05:25:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:00,141 INFO L225 Difference]: With dead ends: 689 [2021-10-29 05:25:00,141 INFO L226 Difference]: Without dead ends: 673 [2021-10-29 05:25:00,142 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:00,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-10-29 05:25:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 597. [2021-10-29 05:25:00,173 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-29 05:25:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 817 transitions. [2021-10-29 05:25:00,176 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 817 transitions. Word has length 21 [2021-10-29 05:25:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:00,176 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 817 transitions. [2021-10-29 05:25:00,176 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-29 05:25:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 817 transitions. [2021-10-29 05:25:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:25:00,178 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:00,178 INFO L513 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-29 05:25:00,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 05:25:00,179 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-29 05:25:00,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:00,179 INFO L85 PathProgramCache]: Analyzing trace with hash -884532789, now seen corresponding path program 1 times [2021-10-29 05:25:00,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:00,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28156452] [2021-10-29 05:25:00,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:00,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:00,218 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-29 05:25:00,219 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:00,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28156452] [2021-10-29 05:25:00,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28156452] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:00,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:00,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:00,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216175042] [2021-10-29 05:25:00,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:00,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:00,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:00,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:00,222 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-29 05:25:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:00,409 INFO L93 Difference]: Finished difference Result 621 states and 843 transitions. [2021-10-29 05:25:00,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:00,410 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-29 05:25:00,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:00,415 INFO L225 Difference]: With dead ends: 621 [2021-10-29 05:25:00,415 INFO L226 Difference]: Without dead ends: 616 [2021-10-29 05:25:00,416 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2021-10-29 05:25:00,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2021-10-29 05:25:00,446 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-29 05:25:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 836 transitions. [2021-10-29 05:25:00,449 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 836 transitions. Word has length 22 [2021-10-29 05:25:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:00,450 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 836 transitions. [2021-10-29 05:25:00,450 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-29 05:25:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 836 transitions. [2021-10-29 05:25:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:25:00,452 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:00,452 INFO L513 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-29 05:25:00,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 05:25:00,453 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-29 05:25:00,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1586442508, now seen corresponding path program 1 times [2021-10-29 05:25:00,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:00,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412474143] [2021-10-29 05:25:00,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:00,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:00,494 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-29 05:25:00,494 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:00,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412474143] [2021-10-29 05:25:00,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412474143] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:00,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:00,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:00,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816723525] [2021-10-29 05:25:00,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:00,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:00,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:00,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:00,496 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-29 05:25:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:00,762 INFO L93 Difference]: Finished difference Result 703 states and 953 transitions. [2021-10-29 05:25:00,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:00,763 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-29 05:25:00,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:00,767 INFO L225 Difference]: With dead ends: 703 [2021-10-29 05:25:00,767 INFO L226 Difference]: Without dead ends: 691 [2021-10-29 05:25:00,768 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-10-29 05:25:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 613. [2021-10-29 05:25:00,808 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-29 05:25:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 834 transitions. [2021-10-29 05:25:00,811 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 834 transitions. Word has length 22 [2021-10-29 05:25:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:00,812 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 834 transitions. [2021-10-29 05:25:00,812 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-29 05:25:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 834 transitions. [2021-10-29 05:25:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:25:00,815 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:00,815 INFO L513 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-29 05:25:00,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 05:25:00,815 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-29 05:25:00,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:00,816 INFO L85 PathProgramCache]: Analyzing trace with hash 640427871, now seen corresponding path program 1 times [2021-10-29 05:25:00,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:00,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796975294] [2021-10-29 05:25:00,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:00,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:00,869 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-29 05:25:00,870 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:00,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796975294] [2021-10-29 05:25:00,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796975294] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:00,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:00,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:00,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306510460] [2021-10-29 05:25:00,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:00,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:00,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:00,872 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-29 05:25:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:01,207 INFO L93 Difference]: Finished difference Result 648 states and 870 transitions. [2021-10-29 05:25:01,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:01,207 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-29 05:25:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:01,212 INFO L225 Difference]: With dead ends: 648 [2021-10-29 05:25:01,212 INFO L226 Difference]: Without dead ends: 613 [2021-10-29 05:25:01,213 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-10-29 05:25:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2021-10-29 05:25:01,260 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-29 05:25:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 825 transitions. [2021-10-29 05:25:01,263 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 825 transitions. Word has length 22 [2021-10-29 05:25:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:01,264 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 825 transitions. [2021-10-29 05:25:01,264 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-29 05:25:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 825 transitions. [2021-10-29 05:25:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:25:01,268 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:01,268 INFO L513 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-29 05:25:01,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 05:25:01,268 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-29 05:25:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:01,269 INFO L85 PathProgramCache]: Analyzing trace with hash 162403822, now seen corresponding path program 1 times [2021-10-29 05:25:01,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:01,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351538660] [2021-10-29 05:25:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:01,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:01,315 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-29 05:25:01,315 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:01,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351538660] [2021-10-29 05:25:01,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351538660] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:01,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:01,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:01,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902035145] [2021-10-29 05:25:01,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:01,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:01,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:01,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:01,318 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-29 05:25:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:01,420 INFO L93 Difference]: Finished difference Result 665 states and 890 transitions. [2021-10-29 05:25:01,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:01,421 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-29 05:25:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:01,425 INFO L225 Difference]: With dead ends: 665 [2021-10-29 05:25:01,425 INFO L226 Difference]: Without dead ends: 596 [2021-10-29 05:25:01,427 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-10-29 05:25:01,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2021-10-29 05:25:01,484 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-29 05:25:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 796 transitions. [2021-10-29 05:25:01,487 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 796 transitions. Word has length 22 [2021-10-29 05:25:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:01,490 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 796 transitions. [2021-10-29 05:25:01,490 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-29 05:25:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 796 transitions. [2021-10-29 05:25:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:25:01,494 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:01,494 INFO L513 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-29 05:25:01,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 05:25:01,494 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-29 05:25:01,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:01,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2130497339, now seen corresponding path program 1 times [2021-10-29 05:25:01,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:01,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035379643] [2021-10-29 05:25:01,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:01,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:01,563 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-29 05:25:01,563 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:01,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035379643] [2021-10-29 05:25:01,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035379643] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:01,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:01,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:25:01,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146210057] [2021-10-29 05:25:01,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:01,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:01,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:01,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:01,566 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-29 05:25:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:01,660 INFO L93 Difference]: Finished difference Result 712 states and 942 transitions. [2021-10-29 05:25:01,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:01,661 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-29 05:25:01,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:01,665 INFO L225 Difference]: With dead ends: 712 [2021-10-29 05:25:01,665 INFO L226 Difference]: Without dead ends: 638 [2021-10-29 05:25:01,668 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-10-29 05:25:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 588. [2021-10-29 05:25:01,724 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-29 05:25:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 784 transitions. [2021-10-29 05:25:01,727 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 784 transitions. Word has length 22 [2021-10-29 05:25:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:01,728 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 784 transitions. [2021-10-29 05:25:01,728 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-29 05:25:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 784 transitions. [2021-10-29 05:25:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 05:25:01,731 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:01,732 INFO L513 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-29 05:25:01,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-29 05:25:01,732 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-29 05:25:01,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1633499935, now seen corresponding path program 1 times [2021-10-29 05:25:01,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:01,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880702532] [2021-10-29 05:25:01,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:01,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:01,814 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-29 05:25:01,814 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:01,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880702532] [2021-10-29 05:25:01,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880702532] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:01,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:01,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:01,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343188917] [2021-10-29 05:25:01,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:01,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:01,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:01,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:01,820 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-29 05:25:02,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:02,154 INFO L93 Difference]: Finished difference Result 596 states and 790 transitions. [2021-10-29 05:25:02,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:02,155 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-29 05:25:02,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:02,159 INFO L225 Difference]: With dead ends: 596 [2021-10-29 05:25:02,160 INFO L226 Difference]: Without dead ends: 591 [2021-10-29 05:25:02,160 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2021-10-29 05:25:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 588. [2021-10-29 05:25:02,218 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-29 05:25:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 783 transitions. [2021-10-29 05:25:02,222 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 783 transitions. Word has length 23 [2021-10-29 05:25:02,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:02,222 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 783 transitions. [2021-10-29 05:25:02,224 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-29 05:25:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 783 transitions. [2021-10-29 05:25:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 05:25:02,225 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:02,226 INFO L513 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-29 05:25:02,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-29 05:25:02,226 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-29 05:25:02,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:02,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1412842791, now seen corresponding path program 1 times [2021-10-29 05:25:02,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:02,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814801698] [2021-10-29 05:25:02,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:02,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:02,275 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-29 05:25:02,275 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:02,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814801698] [2021-10-29 05:25:02,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814801698] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:02,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:02,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:02,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976434036] [2021-10-29 05:25:02,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:02,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:02,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:02,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:02,278 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-29 05:25:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:02,579 INFO L93 Difference]: Finished difference Result 605 states and 799 transitions. [2021-10-29 05:25:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:02,580 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-29 05:25:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:02,584 INFO L225 Difference]: With dead ends: 605 [2021-10-29 05:25:02,584 INFO L226 Difference]: Without dead ends: 575 [2021-10-29 05:25:02,585 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:02,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-10-29 05:25:02,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2021-10-29 05:25:02,631 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-29 05:25:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 761 transitions. [2021-10-29 05:25:02,634 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 761 transitions. Word has length 23 [2021-10-29 05:25:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:02,634 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 761 transitions. [2021-10-29 05:25:02,634 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-29 05:25:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 761 transitions. [2021-10-29 05:25:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 05:25:02,636 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:02,636 INFO L513 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-29 05:25:02,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 05:25:02,637 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-29 05:25:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1360030513, now seen corresponding path program 1 times [2021-10-29 05:25:02,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:02,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047661781] [2021-10-29 05:25:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:02,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:02,671 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-29 05:25:02,671 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:02,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047661781] [2021-10-29 05:25:02,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047661781] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:02,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:02,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:02,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005135346] [2021-10-29 05:25:02,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:02,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:02,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:02,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:02,675 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-29 05:25:02,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:02,890 INFO L93 Difference]: Finished difference Result 609 states and 795 transitions. [2021-10-29 05:25:02,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:02,891 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-29 05:25:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:02,896 INFO L225 Difference]: With dead ends: 609 [2021-10-29 05:25:02,897 INFO L226 Difference]: Without dead ends: 595 [2021-10-29 05:25:02,897 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2021-10-29 05:25:02,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 583. [2021-10-29 05:25:02,949 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-29 05:25:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 769 transitions. [2021-10-29 05:25:02,953 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 769 transitions. Word has length 23 [2021-10-29 05:25:02,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:02,953 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 769 transitions. [2021-10-29 05:25:02,953 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-29 05:25:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 769 transitions. [2021-10-29 05:25:02,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 05:25:02,955 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:02,955 INFO L513 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-29 05:25:02,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-29 05:25:02,956 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-29 05:25:02,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:02,956 INFO L85 PathProgramCache]: Analyzing trace with hash 379232346, now seen corresponding path program 1 times [2021-10-29 05:25:02,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:02,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894684398] [2021-10-29 05:25:02,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:02,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:03,012 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-29 05:25:03,012 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:03,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894684398] [2021-10-29 05:25:03,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894684398] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:03,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:03,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:03,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393168811] [2021-10-29 05:25:03,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:03,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:03,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:03,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:03,015 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-29 05:25:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:03,368 INFO L93 Difference]: Finished difference Result 591 states and 775 transitions. [2021-10-29 05:25:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:03,369 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-29 05:25:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:03,373 INFO L225 Difference]: With dead ends: 591 [2021-10-29 05:25:03,373 INFO L226 Difference]: Without dead ends: 586 [2021-10-29 05:25:03,374 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-10-29 05:25:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 583. [2021-10-29 05:25:03,425 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-29 05:25:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 768 transitions. [2021-10-29 05:25:03,429 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 768 transitions. Word has length 24 [2021-10-29 05:25:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:03,430 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 768 transitions. [2021-10-29 05:25:03,430 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-29 05:25:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 768 transitions. [2021-10-29 05:25:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 05:25:03,432 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:03,432 INFO L513 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-29 05:25:03,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-29 05:25:03,433 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-29 05:25:03,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:03,433 INFO L85 PathProgramCache]: Analyzing trace with hash -771502393, now seen corresponding path program 1 times [2021-10-29 05:25:03,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:03,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510705274] [2021-10-29 05:25:03,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:03,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:03,522 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-29 05:25:03,522 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:03,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510705274] [2021-10-29 05:25:03,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510705274] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:03,523 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:03,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:25:03,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049362491] [2021-10-29 05:25:03,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:03,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:03,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:03,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:03,524 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-29 05:25:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:03,641 INFO L93 Difference]: Finished difference Result 597 states and 781 transitions. [2021-10-29 05:25:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:03,641 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-29 05:25:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:03,646 INFO L225 Difference]: With dead ends: 597 [2021-10-29 05:25:03,646 INFO L226 Difference]: Without dead ends: 594 [2021-10-29 05:25:03,646 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-10-29 05:25:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 589. [2021-10-29 05:25:03,700 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-29 05:25:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 774 transitions. [2021-10-29 05:25:03,703 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 774 transitions. Word has length 24 [2021-10-29 05:25:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:03,704 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 774 transitions. [2021-10-29 05:25:03,704 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-29 05:25:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 774 transitions. [2021-10-29 05:25:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-29 05:25:03,707 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:03,707 INFO L513 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-29 05:25:03,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-29 05:25:03,707 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-29 05:25:03,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:03,708 INFO L85 PathProgramCache]: Analyzing trace with hash -771514309, now seen corresponding path program 1 times [2021-10-29 05:25:03,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:03,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407790479] [2021-10-29 05:25:03,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:03,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:03,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-29 05:25:03,760 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:03,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407790479] [2021-10-29 05:25:03,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407790479] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:03,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:03,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:03,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309471908] [2021-10-29 05:25:03,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:03,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:03,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:03,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:03,763 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-29 05:25:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:04,026 INFO L93 Difference]: Finished difference Result 603 states and 787 transitions. [2021-10-29 05:25:04,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:04,027 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-29 05:25:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:04,031 INFO L225 Difference]: With dead ends: 603 [2021-10-29 05:25:04,031 INFO L226 Difference]: Without dead ends: 583 [2021-10-29 05:25:04,032 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:04,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2021-10-29 05:25:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 577. [2021-10-29 05:25:04,084 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-29 05:25:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 762 transitions. [2021-10-29 05:25:04,086 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 762 transitions. Word has length 24 [2021-10-29 05:25:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:04,087 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 762 transitions. [2021-10-29 05:25:04,087 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-29 05:25:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 762 transitions. [2021-10-29 05:25:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 05:25:04,089 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:04,089 INFO L513 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-29 05:25:04,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-29 05:25:04,089 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-29 05:25:04,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:04,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1481572040, now seen corresponding path program 1 times [2021-10-29 05:25:04,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:04,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536932858] [2021-10-29 05:25:04,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:04,090 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:04,176 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-29 05:25:04,176 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:04,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536932858] [2021-10-29 05:25:04,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536932858] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:04,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:04,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:25:04,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293164627] [2021-10-29 05:25:04,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:25:04,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:04,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:25:04,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:25:04,179 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-29 05:25:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:04,409 INFO L93 Difference]: Finished difference Result 595 states and 779 transitions. [2021-10-29 05:25:04,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:25:04,410 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-29 05:25:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:04,414 INFO L225 Difference]: With dead ends: 595 [2021-10-29 05:25:04,415 INFO L226 Difference]: Without dead ends: 572 [2021-10-29 05:25:04,416 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:25:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-10-29 05:25:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2021-10-29 05:25:04,466 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-29 05:25:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 747 transitions. [2021-10-29 05:25:04,469 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 747 transitions. Word has length 25 [2021-10-29 05:25:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:04,469 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 747 transitions. [2021-10-29 05:25:04,469 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-29 05:25:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 747 transitions. [2021-10-29 05:25:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 05:25:04,471 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:04,472 INFO L513 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-29 05:25:04,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-29 05:25:04,472 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-29 05:25:04,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:04,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1652194093, now seen corresponding path program 1 times [2021-10-29 05:25:04,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:04,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016132769] [2021-10-29 05:25:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:04,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:04,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-29 05:25:04,582 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:04,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016132769] [2021-10-29 05:25:04,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016132769] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:04,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:04,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-29 05:25:04,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406064379] [2021-10-29 05:25:04,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-29 05:25:04,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:04,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-29 05:25:04,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:25:04,587 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-29 05:25:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:04,793 INFO L93 Difference]: Finished difference Result 590 states and 764 transitions. [2021-10-29 05:25:04,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 05:25:04,793 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-29 05:25:04,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:04,797 INFO L225 Difference]: With dead ends: 590 [2021-10-29 05:25:04,798 INFO L226 Difference]: Without dead ends: 569 [2021-10-29 05:25:04,798 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-29 05:25:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-10-29 05:25:04,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2021-10-29 05:25:04,847 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-29 05:25:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 733 transitions. [2021-10-29 05:25:04,850 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 733 transitions. Word has length 25 [2021-10-29 05:25:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:04,850 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 733 transitions. [2021-10-29 05:25:04,851 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-29 05:25:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 733 transitions. [2021-10-29 05:25:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 05:25:04,853 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:04,853 INFO L513 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-29 05:25:04,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-29 05:25:04,854 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-29 05:25:04,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:04,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1306896656, now seen corresponding path program 1 times [2021-10-29 05:25:04,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:04,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48654806] [2021-10-29 05:25:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:04,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:04,937 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-29 05:25:04,937 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:04,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48654806] [2021-10-29 05:25:04,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48654806] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:04,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:04,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:25:04,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935903618] [2021-10-29 05:25:04,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:25:04,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:04,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:25:04,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:25:04,940 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-29 05:25:05,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:05,069 INFO L93 Difference]: Finished difference Result 584 states and 747 transitions. [2021-10-29 05:25:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:25:05,070 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-29 05:25:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:05,074 INFO L225 Difference]: With dead ends: 584 [2021-10-29 05:25:05,074 INFO L226 Difference]: Without dead ends: 563 [2021-10-29 05:25:05,075 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:25:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2021-10-29 05:25:05,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2021-10-29 05:25:05,120 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-29 05:25:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 724 transitions. [2021-10-29 05:25:05,122 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 724 transitions. Word has length 26 [2021-10-29 05:25:05,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:05,123 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 724 transitions. [2021-10-29 05:25:05,123 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-29 05:25:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 724 transitions. [2021-10-29 05:25:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 05:25:05,125 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:05,125 INFO L513 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-29 05:25:05,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-29 05:25:05,127 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-29 05:25:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2107388639, now seen corresponding path program 1 times [2021-10-29 05:25:05,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:05,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735449003] [2021-10-29 05:25:05,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:05,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:05,306 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-29 05:25:05,306 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:05,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735449003] [2021-10-29 05:25:05,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735449003] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:05,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:05,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:25:05,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656036840] [2021-10-29 05:25:05,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:25:05,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:05,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:25:05,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:05,309 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-29 05:25:05,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:05,490 INFO L93 Difference]: Finished difference Result 654 states and 835 transitions. [2021-10-29 05:25:05,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:25:05,491 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-29 05:25:05,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:05,495 INFO L225 Difference]: With dead ends: 654 [2021-10-29 05:25:05,496 INFO L226 Difference]: Without dead ends: 572 [2021-10-29 05:25:05,496 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:25:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-10-29 05:25:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 559. [2021-10-29 05:25:05,561 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-29 05:25:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 718 transitions. [2021-10-29 05:25:05,564 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 718 transitions. Word has length 26 [2021-10-29 05:25:05,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:05,564 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 718 transitions. [2021-10-29 05:25:05,565 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-29 05:25:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 718 transitions. [2021-10-29 05:25:05,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-29 05:25:05,567 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:05,567 INFO L513 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-29 05:25:05,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-29 05:25:05,568 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-29 05:25:05,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:05,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1658430507, now seen corresponding path program 1 times [2021-10-29 05:25:05,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:05,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948819344] [2021-10-29 05:25:05,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:05,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:05,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-29 05:25:05,609 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:05,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948819344] [2021-10-29 05:25:05,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948819344] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:05,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:05,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:25:05,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418506983] [2021-10-29 05:25:05,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:25:05,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:05,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:25:05,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:05,612 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-29 05:25:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:05,817 INFO L93 Difference]: Finished difference Result 583 states and 740 transitions. [2021-10-29 05:25:05,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:25:05,818 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-29 05:25:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:05,822 INFO L225 Difference]: With dead ends: 583 [2021-10-29 05:25:05,822 INFO L226 Difference]: Without dead ends: 555 [2021-10-29 05:25:05,823 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:25:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-10-29 05:25:05,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 542. [2021-10-29 05:25:05,881 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-29 05:25:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 699 transitions. [2021-10-29 05:25:05,883 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 699 transitions. Word has length 26 [2021-10-29 05:25:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:05,883 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 699 transitions. [2021-10-29 05:25:05,884 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-29 05:25:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 699 transitions. [2021-10-29 05:25:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 05:25:05,885 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:05,886 INFO L513 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-29 05:25:05,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-29 05:25:05,886 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-29 05:25:05,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1504423283, now seen corresponding path program 1 times [2021-10-29 05:25:05,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:05,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510948798] [2021-10-29 05:25:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:05,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:05,958 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-29 05:25:05,959 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:05,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510948798] [2021-10-29 05:25:05,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510948798] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:05,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:05,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:25:05,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895458988] [2021-10-29 05:25:05,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:25:05,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:05,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:25:05,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:05,961 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-29 05:25:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:06,166 INFO L93 Difference]: Finished difference Result 567 states and 722 transitions. [2021-10-29 05:25:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:25:06,166 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-29 05:25:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:06,170 INFO L225 Difference]: With dead ends: 567 [2021-10-29 05:25:06,170 INFO L226 Difference]: Without dead ends: 547 [2021-10-29 05:25:06,170 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:25:06,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-10-29 05:25:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 534. [2021-10-29 05:25:06,250 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-29 05:25:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 690 transitions. [2021-10-29 05:25:06,252 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 690 transitions. Word has length 27 [2021-10-29 05:25:06,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:06,252 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 690 transitions. [2021-10-29 05:25:06,252 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-29 05:25:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 690 transitions. [2021-10-29 05:25:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 05:25:06,254 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:06,254 INFO L513 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-29 05:25:06,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-29 05:25:06,254 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-29 05:25:06,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:06,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1155960076, now seen corresponding path program 1 times [2021-10-29 05:25:06,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:06,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295715434] [2021-10-29 05:25:06,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:06,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:06,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-29 05:25:06,311 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:06,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295715434] [2021-10-29 05:25:06,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295715434] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:06,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:06,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:25:06,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719785991] [2021-10-29 05:25:06,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:25:06,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:06,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:25:06,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:25:06,313 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-29 05:25:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:06,416 INFO L93 Difference]: Finished difference Result 549 states and 704 transitions. [2021-10-29 05:25:06,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:25:06,417 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-29 05:25:06,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:06,420 INFO L225 Difference]: With dead ends: 549 [2021-10-29 05:25:06,420 INFO L226 Difference]: Without dead ends: 532 [2021-10-29 05:25:06,421 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:25:06,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-10-29 05:25:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2021-10-29 05:25:06,465 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-29 05:25:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 687 transitions. [2021-10-29 05:25:06,467 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 687 transitions. Word has length 27 [2021-10-29 05:25:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:06,467 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 687 transitions. [2021-10-29 05:25:06,468 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-29 05:25:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 687 transitions. [2021-10-29 05:25:06,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 05:25:06,469 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:06,469 INFO L513 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-29 05:25:06,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-29 05:25:06,470 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-29 05:25:06,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:06,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1611200436, now seen corresponding path program 1 times [2021-10-29 05:25:06,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:06,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077412097] [2021-10-29 05:25:06,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:06,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:06,498 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-29 05:25:06,498 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:06,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077412097] [2021-10-29 05:25:06,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077412097] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:06,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:06,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:25:06,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670051833] [2021-10-29 05:25:06,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:06,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:06,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:06,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:06,500 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-29 05:25:06,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:06,684 INFO L93 Difference]: Finished difference Result 634 states and 803 transitions. [2021-10-29 05:25:06,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:06,684 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-29 05:25:06,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:06,688 INFO L225 Difference]: With dead ends: 634 [2021-10-29 05:25:06,688 INFO L226 Difference]: Without dead ends: 615 [2021-10-29 05:25:06,690 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-10-29 05:25:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 532. [2021-10-29 05:25:06,737 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-29 05:25:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 686 transitions. [2021-10-29 05:25:06,739 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 686 transitions. Word has length 27 [2021-10-29 05:25:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:06,740 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 686 transitions. [2021-10-29 05:25:06,740 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-29 05:25:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 686 transitions. [2021-10-29 05:25:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-29 05:25:06,742 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:06,742 INFO L513 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-29 05:25:06,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-29 05:25:06,742 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-29 05:25:06,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1713212070, now seen corresponding path program 1 times [2021-10-29 05:25:06,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:06,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183530606] [2021-10-29 05:25:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:06,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:06,795 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-29 05:25:06,797 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:06,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183530606] [2021-10-29 05:25:06,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183530606] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:06,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:06,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:06,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836857412] [2021-10-29 05:25:06,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:06,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:06,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:06,799 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-29 05:25:07,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:07,040 INFO L93 Difference]: Finished difference Result 641 states and 818 transitions. [2021-10-29 05:25:07,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:07,040 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-29 05:25:07,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:07,043 INFO L225 Difference]: With dead ends: 641 [2021-10-29 05:25:07,044 INFO L226 Difference]: Without dead ends: 532 [2021-10-29 05:25:07,045 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:07,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-10-29 05:25:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2021-10-29 05:25:07,090 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-29 05:25:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 682 transitions. [2021-10-29 05:25:07,092 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 682 transitions. Word has length 27 [2021-10-29 05:25:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:07,092 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 682 transitions. [2021-10-29 05:25:07,093 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-29 05:25:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 682 transitions. [2021-10-29 05:25:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 05:25:07,094 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:07,094 INFO L513 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-29 05:25:07,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-29 05:25:07,095 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-29 05:25:07,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1843803493, now seen corresponding path program 1 times [2021-10-29 05:25:07,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:07,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668854957] [2021-10-29 05:25:07,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:07,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:07,138 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-29 05:25:07,138 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:07,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668854957] [2021-10-29 05:25:07,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668854957] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:07,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:07,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:25:07,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719013710] [2021-10-29 05:25:07,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:25:07,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:07,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:25:07,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:07,140 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-29 05:25:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:07,253 INFO L93 Difference]: Finished difference Result 616 states and 769 transitions. [2021-10-29 05:25:07,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:25:07,254 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-29 05:25:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:07,257 INFO L225 Difference]: With dead ends: 616 [2021-10-29 05:25:07,258 INFO L226 Difference]: Without dead ends: 599 [2021-10-29 05:25:07,258 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:25:07,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-10-29 05:25:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 542. [2021-10-29 05:25:07,349 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-29 05:25:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 695 transitions. [2021-10-29 05:25:07,351 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 695 transitions. Word has length 28 [2021-10-29 05:25:07,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:07,352 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 695 transitions. [2021-10-29 05:25:07,352 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-29 05:25:07,352 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 695 transitions. [2021-10-29 05:25:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 05:25:07,354 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:07,354 INFO L513 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-29 05:25:07,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-29 05:25:07,355 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-29 05:25:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:07,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1622268006, now seen corresponding path program 1 times [2021-10-29 05:25:07,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:07,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888009202] [2021-10-29 05:25:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:07,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:07,417 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-29 05:25:07,417 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:07,417 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888009202] [2021-10-29 05:25:07,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888009202] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:07,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:07,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:25:07,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060120908] [2021-10-29 05:25:07,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:25:07,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:07,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:25:07,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:25:07,420 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-29 05:25:07,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:07,589 INFO L93 Difference]: Finished difference Result 557 states and 709 transitions. [2021-10-29 05:25:07,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:25:07,590 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-29 05:25:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:07,593 INFO L225 Difference]: With dead ends: 557 [2021-10-29 05:25:07,593 INFO L226 Difference]: Without dead ends: 536 [2021-10-29 05:25:07,595 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:25:07,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-10-29 05:25:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2021-10-29 05:25:07,658 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-29 05:25:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 686 transitions. [2021-10-29 05:25:07,661 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 686 transitions. Word has length 28 [2021-10-29 05:25:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:07,661 INFO L470 AbstractCegarLoop]: Abstraction has 536 states and 686 transitions. [2021-10-29 05:25:07,662 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-29 05:25:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 686 transitions. [2021-10-29 05:25:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 05:25:07,664 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:07,664 INFO L513 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-29 05:25:07,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-29 05:25:07,664 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-29 05:25:07,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:07,665 INFO L85 PathProgramCache]: Analyzing trace with hash -453382508, now seen corresponding path program 1 times [2021-10-29 05:25:07,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:07,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39354502] [2021-10-29 05:25:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:07,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:07,771 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-29 05:25:07,771 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:07,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39354502] [2021-10-29 05:25:07,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39354502] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:07,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:07,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:25:07,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878763547] [2021-10-29 05:25:07,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:25:07,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:07,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:25:07,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:25:07,773 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-29 05:25:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:07,974 INFO L93 Difference]: Finished difference Result 561 states and 709 transitions. [2021-10-29 05:25:07,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:25:07,983 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-29 05:25:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:07,986 INFO L225 Difference]: With dead ends: 561 [2021-10-29 05:25:07,986 INFO L226 Difference]: Without dead ends: 540 [2021-10-29 05:25:07,987 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:25:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-10-29 05:25:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 527. [2021-10-29 05:25:08,046 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-29 05:25:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 676 transitions. [2021-10-29 05:25:08,049 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 676 transitions. Word has length 28 [2021-10-29 05:25:08,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:08,049 INFO L470 AbstractCegarLoop]: Abstraction has 527 states and 676 transitions. [2021-10-29 05:25:08,049 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-29 05:25:08,050 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 676 transitions. [2021-10-29 05:25:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-29 05:25:08,051 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:08,051 INFO L513 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-29 05:25:08,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-29 05:25:08,052 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-29 05:25:08,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:08,052 INFO L85 PathProgramCache]: Analyzing trace with hash 695346116, now seen corresponding path program 1 times [2021-10-29 05:25:08,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:08,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012827641] [2021-10-29 05:25:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:08,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:08,093 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-29 05:25:08,093 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:08,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012827641] [2021-10-29 05:25:08,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012827641] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:08,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:08,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:25:08,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048766710] [2021-10-29 05:25:08,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:08,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:08,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:08,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:08,095 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-29 05:25:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:08,339 INFO L93 Difference]: Finished difference Result 565 states and 716 transitions. [2021-10-29 05:25:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:08,340 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-29 05:25:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:08,344 INFO L225 Difference]: With dead ends: 565 [2021-10-29 05:25:08,344 INFO L226 Difference]: Without dead ends: 561 [2021-10-29 05:25:08,344 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-10-29 05:25:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 500. [2021-10-29 05:25:08,396 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-29 05:25:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 640 transitions. [2021-10-29 05:25:08,397 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 640 transitions. Word has length 28 [2021-10-29 05:25:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:08,398 INFO L470 AbstractCegarLoop]: Abstraction has 500 states and 640 transitions. [2021-10-29 05:25:08,398 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-29 05:25:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 640 transitions. [2021-10-29 05:25:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 05:25:08,400 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:08,400 INFO L513 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-29 05:25:08,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-29 05:25:08,400 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-29 05:25:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1529539768, now seen corresponding path program 1 times [2021-10-29 05:25:08,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:08,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331225753] [2021-10-29 05:25:08,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:08,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:08,475 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-29 05:25:08,475 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:08,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331225753] [2021-10-29 05:25:08,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331225753] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:08,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:08,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-29 05:25:08,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862307145] [2021-10-29 05:25:08,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-29 05:25:08,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:08,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-29 05:25:08,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:25:08,478 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-29 05:25:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:08,895 INFO L93 Difference]: Finished difference Result 631 states and 789 transitions. [2021-10-29 05:25:08,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 05:25:08,896 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-29 05:25:08,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:08,899 INFO L225 Difference]: With dead ends: 631 [2021-10-29 05:25:08,900 INFO L226 Difference]: Without dead ends: 565 [2021-10-29 05:25:08,900 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-29 05:25:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-10-29 05:25:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 503. [2021-10-29 05:25:08,954 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-29 05:25:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 636 transitions. [2021-10-29 05:25:08,956 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 636 transitions. Word has length 29 [2021-10-29 05:25:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:08,956 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 636 transitions. [2021-10-29 05:25:08,956 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-29 05:25:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 636 transitions. [2021-10-29 05:25:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 05:25:08,958 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:08,958 INFO L513 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-29 05:25:08,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-29 05:25:08,959 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-29 05:25:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash -120439325, now seen corresponding path program 1 times [2021-10-29 05:25:08,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:08,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160064952] [2021-10-29 05:25:08,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:08,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:09,016 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-29 05:25:09,016 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:09,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160064952] [2021-10-29 05:25:09,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160064952] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:09,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:09,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:25:09,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095221806] [2021-10-29 05:25:09,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:25:09,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:09,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:25:09,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:25:09,019 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-29 05:25:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:09,213 INFO L93 Difference]: Finished difference Result 522 states and 654 transitions. [2021-10-29 05:25:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:25:09,213 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-29 05:25:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:09,217 INFO L225 Difference]: With dead ends: 522 [2021-10-29 05:25:09,217 INFO L226 Difference]: Without dead ends: 496 [2021-10-29 05:25:09,218 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:25:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-10-29 05:25:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2021-10-29 05:25:09,267 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-29 05:25:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 624 transitions. [2021-10-29 05:25:09,269 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 624 transitions. Word has length 29 [2021-10-29 05:25:09,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:09,269 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 624 transitions. [2021-10-29 05:25:09,269 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-29 05:25:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 624 transitions. [2021-10-29 05:25:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 05:25:09,271 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:09,271 INFO L513 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-29 05:25:09,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-29 05:25:09,272 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-29 05:25:09,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1964448463, now seen corresponding path program 1 times [2021-10-29 05:25:09,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:09,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151495604] [2021-10-29 05:25:09,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:09,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:09,300 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-29 05:25:09,300 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:09,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151495604] [2021-10-29 05:25:09,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151495604] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:09,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:09,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:09,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230758059] [2021-10-29 05:25:09,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:09,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:09,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:09,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:09,304 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-29 05:25:09,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:09,378 INFO L93 Difference]: Finished difference Result 534 states and 659 transitions. [2021-10-29 05:25:09,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:09,379 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-29 05:25:09,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:09,383 INFO L225 Difference]: With dead ends: 534 [2021-10-29 05:25:09,383 INFO L226 Difference]: Without dead ends: 514 [2021-10-29 05:25:09,383 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-10-29 05:25:09,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 496. [2021-10-29 05:25:09,439 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-29 05:25:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 623 transitions. [2021-10-29 05:25:09,441 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 623 transitions. Word has length 29 [2021-10-29 05:25:09,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:09,442 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 623 transitions. [2021-10-29 05:25:09,442 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-29 05:25:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 623 transitions. [2021-10-29 05:25:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 05:25:09,444 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:09,444 INFO L513 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-29 05:25:09,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-29 05:25:09,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-29 05:25:09,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:09,445 INFO L85 PathProgramCache]: Analyzing trace with hash 644489272, now seen corresponding path program 1 times [2021-10-29 05:25:09,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:09,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383986560] [2021-10-29 05:25:09,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:09,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:09,526 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-29 05:25:09,526 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:09,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383986560] [2021-10-29 05:25:09,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383986560] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:09,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:09,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:25:09,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992021359] [2021-10-29 05:25:09,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:25:09,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:09,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:25:09,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:25:09,530 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-29 05:25:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:09,723 INFO L93 Difference]: Finished difference Result 526 states and 650 transitions. [2021-10-29 05:25:09,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:25:09,723 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-29 05:25:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:09,727 INFO L225 Difference]: With dead ends: 526 [2021-10-29 05:25:09,727 INFO L226 Difference]: Without dead ends: 505 [2021-10-29 05:25:09,728 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:25:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-29 05:25:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 484. [2021-10-29 05:25:09,780 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-29 05:25:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 606 transitions. [2021-10-29 05:25:09,782 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 606 transitions. Word has length 29 [2021-10-29 05:25:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:09,782 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 606 transitions. [2021-10-29 05:25:09,782 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-29 05:25:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 606 transitions. [2021-10-29 05:25:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 05:25:09,784 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:09,784 INFO L513 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-29 05:25:09,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-29 05:25:09,785 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-29 05:25:09,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:09,785 INFO L85 PathProgramCache]: Analyzing trace with hash 692479088, now seen corresponding path program 1 times [2021-10-29 05:25:09,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:09,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268625673] [2021-10-29 05:25:09,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:09,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:09,810 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-29 05:25:09,810 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:09,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268625673] [2021-10-29 05:25:09,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268625673] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:09,811 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:09,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:09,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259602848] [2021-10-29 05:25:09,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:09,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:09,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:09,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:09,813 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-29 05:25:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:09,921 INFO L93 Difference]: Finished difference Result 555 states and 686 transitions. [2021-10-29 05:25:09,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:09,922 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-29 05:25:09,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:09,924 INFO L225 Difference]: With dead ends: 555 [2021-10-29 05:25:09,924 INFO L226 Difference]: Without dead ends: 328 [2021-10-29 05:25:09,925 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:09,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-10-29 05:25:09,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 306. [2021-10-29 05:25:09,964 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-29 05:25:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 365 transitions. [2021-10-29 05:25:09,966 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 365 transitions. Word has length 29 [2021-10-29 05:25:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:09,966 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 365 transitions. [2021-10-29 05:25:09,966 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-29 05:25:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 365 transitions. [2021-10-29 05:25:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-29 05:25:09,968 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:09,968 INFO L513 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-29 05:25:09,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-29 05:25:09,969 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-29 05:25:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1090089878, now seen corresponding path program 1 times [2021-10-29 05:25:09,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:09,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234727406] [2021-10-29 05:25:09,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:09,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:10,062 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-29 05:25:10,062 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:10,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234727406] [2021-10-29 05:25:10,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234727406] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:10,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:10,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-29 05:25:10,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293672307] [2021-10-29 05:25:10,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 05:25:10,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:10,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 05:25:10,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-29 05:25:10,065 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-29 05:25:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:10,274 INFO L93 Difference]: Finished difference Result 362 states and 423 transitions. [2021-10-29 05:25:10,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 05:25:10,275 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-29 05:25:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:10,277 INFO L225 Difference]: With dead ends: 362 [2021-10-29 05:25:10,277 INFO L226 Difference]: Without dead ends: 270 [2021-10-29 05:25:10,278 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-29 05:25:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-10-29 05:25:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 248. [2021-10-29 05:25:10,307 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-29 05:25:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 287 transitions. [2021-10-29 05:25:10,308 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 287 transitions. Word has length 29 [2021-10-29 05:25:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:10,309 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 287 transitions. [2021-10-29 05:25:10,309 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-29 05:25:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 287 transitions. [2021-10-29 05:25:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-29 05:25:10,310 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:10,310 INFO L513 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-29 05:25:10,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-29 05:25:10,311 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-29 05:25:10,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:10,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1241673930, now seen corresponding path program 1 times [2021-10-29 05:25:10,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:10,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121994552] [2021-10-29 05:25:10,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:10,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:10,338 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-29 05:25:10,338 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:10,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121994552] [2021-10-29 05:25:10,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121994552] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:10,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:10,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:10,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177987583] [2021-10-29 05:25:10,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:10,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:10,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:10,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:10,341 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-29 05:25:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:10,382 INFO L93 Difference]: Finished difference Result 289 states and 328 transitions. [2021-10-29 05:25:10,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:10,383 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-29 05:25:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:10,385 INFO L225 Difference]: With dead ends: 289 [2021-10-29 05:25:10,385 INFO L226 Difference]: Without dead ends: 253 [2021-10-29 05:25:10,385 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-10-29 05:25:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2021-10-29 05:25:10,413 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-29 05:25:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 286 transitions. [2021-10-29 05:25:10,414 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 286 transitions. Word has length 32 [2021-10-29 05:25:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:10,415 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 286 transitions. [2021-10-29 05:25:10,415 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-29 05:25:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 286 transitions. [2021-10-29 05:25:10,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 05:25:10,416 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:10,416 INFO L513 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-29 05:25:10,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-29 05:25:10,416 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-29 05:25:10,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash 156718672, now seen corresponding path program 1 times [2021-10-29 05:25:10,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:10,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803159758] [2021-10-29 05:25:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:10,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:10,524 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-29 05:25:10,525 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:10,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803159758] [2021-10-29 05:25:10,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803159758] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:10,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:10,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:10,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515310728] [2021-10-29 05:25:10,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:10,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:10,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:10,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:10,527 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-29 05:25:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:10,632 INFO L93 Difference]: Finished difference Result 257 states and 294 transitions. [2021-10-29 05:25:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:10,632 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-29 05:25:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:10,634 INFO L225 Difference]: With dead ends: 257 [2021-10-29 05:25:10,634 INFO L226 Difference]: Without dead ends: 240 [2021-10-29 05:25:10,634 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-10-29 05:25:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 236. [2021-10-29 05:25:10,664 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-29 05:25:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 272 transitions. [2021-10-29 05:25:10,665 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 272 transitions. Word has length 34 [2021-10-29 05:25:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:10,665 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 272 transitions. [2021-10-29 05:25:10,666 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-29 05:25:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 272 transitions. [2021-10-29 05:25:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 05:25:10,667 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:10,667 INFO L513 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-29 05:25:10,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-29 05:25:10,667 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-29 05:25:10,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash -856105982, now seen corresponding path program 1 times [2021-10-29 05:25:10,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:10,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114920284] [2021-10-29 05:25:10,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:10,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:10,802 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-29 05:25:10,802 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:10,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114920284] [2021-10-29 05:25:10,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114920284] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:10,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:10,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:25:10,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091307009] [2021-10-29 05:25:10,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:25:10,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:10,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:25:10,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:10,805 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-29 05:25:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:10,953 INFO L93 Difference]: Finished difference Result 259 states and 292 transitions. [2021-10-29 05:25:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:25:10,954 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-29 05:25:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:10,955 INFO L225 Difference]: With dead ends: 259 [2021-10-29 05:25:10,955 INFO L226 Difference]: Without dead ends: 212 [2021-10-29 05:25:10,957 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:25:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-10-29 05:25:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 198. [2021-10-29 05:25:10,986 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-29 05:25:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 226 transitions. [2021-10-29 05:25:10,987 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 226 transitions. Word has length 34 [2021-10-29 05:25:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:10,988 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 226 transitions. [2021-10-29 05:25:10,988 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-29 05:25:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2021-10-29 05:25:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-29 05:25:10,989 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:10,989 INFO L513 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-29 05:25:10,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-29 05:25:10,991 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-29 05:25:10,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1806263113, now seen corresponding path program 1 times [2021-10-29 05:25:10,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:10,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601429309] [2021-10-29 05:25:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:10,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:11,017 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-29 05:25:11,017 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:11,018 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601429309] [2021-10-29 05:25:11,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601429309] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:11,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:11,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:11,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079876616] [2021-10-29 05:25:11,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:11,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:11,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:11,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:11,019 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-29 05:25:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:11,057 INFO L93 Difference]: Finished difference Result 208 states and 236 transitions. [2021-10-29 05:25:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:11,058 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-29 05:25:11,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:11,059 INFO L225 Difference]: With dead ends: 208 [2021-10-29 05:25:11,059 INFO L226 Difference]: Without dead ends: 198 [2021-10-29 05:25:11,059 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-10-29 05:25:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-10-29 05:25:11,089 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-29 05:25:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 224 transitions. [2021-10-29 05:25:11,089 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 224 transitions. Word has length 34 [2021-10-29 05:25:11,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:11,090 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 224 transitions. [2021-10-29 05:25:11,090 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-29 05:25:11,090 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 224 transitions. [2021-10-29 05:25:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 05:25:11,091 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:11,091 INFO L513 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-29 05:25:11,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-29 05:25:11,091 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-29 05:25:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash -829704437, now seen corresponding path program 1 times [2021-10-29 05:25:11,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:11,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654480830] [2021-10-29 05:25:11,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:11,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:25:11,125 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 05:25:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:25:11,195 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-29 05:25:11,195 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 05:25:11,196 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,198 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,200 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,200 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,200 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,200 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,200 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,200 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,202 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,202 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,202 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,202 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,202 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,202 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,203 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,203 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,203 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,203 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,203 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,203 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,204 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,204 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,204 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,204 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,204 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,204 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,205 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,206 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,207 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,210 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,210 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,210 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,210 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,210 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,212 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,212 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,212 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,212 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,212 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:11,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-29 05:25:11,220 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:25:11,225 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:25:11,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:25:11 BoogieIcfgContainer [2021-10-29 05:25:11,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:25:11,347 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:25:11,347 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:25:11,347 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:25:11,348 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:24:55" (3/4) ... [2021-10-29 05:25:11,350 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 05:25:11,470 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:25:11,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:25:11,472 INFO L168 Benchmark]: Toolchain (without parser) took 22475.87 ms. Allocated memory was 96.5 MB in the beginning and 511.7 MB in the end (delta: 415.2 MB). Free memory was 55.7 MB in the beginning and 296.7 MB in the end (delta: -241.0 MB). Peak memory consumption was 173.3 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:11,472 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 96.5 MB. Free memory is still 73.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:25:11,473 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.80 ms. Allocated memory is still 96.5 MB. Free memory was 55.5 MB in the beginning and 52.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:11,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 284.27 ms. Allocated memory was 96.5 MB in the beginning and 127.9 MB in the end (delta: 31.5 MB). Free memory was 52.4 MB in the beginning and 93.3 MB in the end (delta: -40.9 MB). Peak memory consumption was 29.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:11,474 INFO L168 Benchmark]: Boogie Preprocessor took 173.08 ms. Allocated memory is still 127.9 MB. Free memory was 93.3 MB in the beginning and 80.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:11,474 INFO L168 Benchmark]: RCFGBuilder took 5730.03 ms. Allocated memory was 127.9 MB in the beginning and 306.2 MB in the end (delta: 178.3 MB). Free memory was 80.7 MB in the beginning and 148.1 MB in the end (delta: -67.4 MB). Peak memory consumption was 111.2 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:11,479 INFO L168 Benchmark]: TraceAbstraction took 15401.74 ms. Allocated memory was 306.2 MB in the beginning and 511.7 MB in the end (delta: 205.5 MB). Free memory was 148.1 MB in the beginning and 308.2 MB in the end (delta: -160.1 MB). Peak memory consumption was 45.4 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:11,479 INFO L168 Benchmark]: Witness Printer took 123.37 ms. Allocated memory is still 511.7 MB. Free memory was 308.2 MB in the beginning and 296.7 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:11,481 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.24 ms. Allocated memory is still 96.5 MB. Free memory is still 73.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 752.80 ms. Allocated memory is still 96.5 MB. Free memory was 55.5 MB in the beginning and 52.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 284.27 ms. Allocated memory was 96.5 MB in the beginning and 127.9 MB in the end (delta: 31.5 MB). Free memory was 52.4 MB in the beginning and 93.3 MB in the end (delta: -40.9 MB). Peak memory consumption was 29.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 173.08 ms. Allocated memory is still 127.9 MB. Free memory was 93.3 MB in the beginning and 80.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 5730.03 ms. Allocated memory was 127.9 MB in the beginning and 306.2 MB in the end (delta: 178.3 MB). Free memory was 80.7 MB in the beginning and 148.1 MB in the end (delta: -67.4 MB). Peak memory consumption was 111.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15401.74 ms. Allocated memory was 306.2 MB in the beginning and 511.7 MB in the end (delta: 205.5 MB). Free memory was 148.1 MB in the beginning and 308.2 MB in the end (delta: -160.1 MB). Peak memory consumption was 45.4 MB. Max. memory is 16.1 GB. * Witness Printer took 123.37 ms. Allocated memory is still 511.7 MB. Free memory was 308.2 MB in the beginning and 296.7 MB in the end (delta: 11.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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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: 15.1s, OverallIterations: 45, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 25841 SDtfs, 12280 SDslu, 43843 SDs, 0 SdLazy, 5346 SolverSat, 764 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 44 MinimizatonAttempts, 1017 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s 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-29 05:25:11,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fda8796c-7d92-4792-9844-607777014ece/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...