./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8 --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 1680e665d6c38e33bd93081ad3c7b8b4f909838cd1480382a495b19dd638ce67 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 02:02:41,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 02:02:41,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 02:02:41,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 02:02:41,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 02:02:41,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 02:02:41,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 02:02:41,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 02:02:41,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 02:02:41,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 02:02:41,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 02:02:41,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 02:02:41,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 02:02:41,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 02:02:41,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 02:02:41,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 02:02:41,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 02:02:41,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 02:02:41,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 02:02:41,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 02:02:41,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 02:02:41,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 02:02:41,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 02:02:41,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 02:02:41,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 02:02:41,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 02:02:41,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 02:02:41,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 02:02:41,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 02:02:41,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 02:02:41,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 02:02:41,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 02:02:41,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 02:02:41,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 02:02:41,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 02:02:41,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 02:02:41,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 02:02:41,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 02:02:41,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 02:02:41,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 02:02:41,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 02:02:41,882 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 02:02:41,915 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 02:02:41,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 02:02:41,918 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 02:02:41,919 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 02:02:41,920 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 02:02:41,920 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 02:02:41,921 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 02:02:41,921 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 02:02:41,921 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 02:02:41,921 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 02:02:41,931 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 02:02:41,932 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 02:02:41,932 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 02:02:41,933 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 02:02:41,933 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 02:02:41,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 02:02:41,934 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 02:02:41,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 02:02:41,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 02:02:41,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 02:02:41,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 02:02:41,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 02:02:41,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 02:02:41,937 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 02:02:41,937 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 02:02:41,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 02:02:41,937 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 02:02:41,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 02:02:41,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 02:02:41,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 02:02:41,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:02:41,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 02:02:41,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 02:02:41,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 02:02:41,942 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 02:02:41,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 02:02:41,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 02:02:41,943 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 02:02:41,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 02:02:41,944 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_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/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_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8 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 -> 1680e665d6c38e33bd93081ad3c7b8b4f909838cd1480382a495b19dd638ce67 [2021-11-07 02:02:42,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 02:02:42,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 02:02:42,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 02:02:42,359 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 02:02:42,360 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 02:02:42,361 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c [2021-11-07 02:02:42,479 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/data/9f2c80619/7c91ee80caa4402eabaea0022443dc91/FLAG02eaa38bb [2021-11-07 02:02:43,250 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 02:02:43,251 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c [2021-11-07 02:02:43,287 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/data/9f2c80619/7c91ee80caa4402eabaea0022443dc91/FLAG02eaa38bb [2021-11-07 02:02:43,492 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/data/9f2c80619/7c91ee80caa4402eabaea0022443dc91 [2021-11-07 02:02:43,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 02:02:43,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 02:02:43,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 02:02:43,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 02:02:43,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 02:02:43,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:02:43" (1/1) ... [2021-11-07 02:02:43,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bcf169d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:02:43, skipping insertion in model container [2021-11-07 02:02:43,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:02:43" (1/1) ... [2021-11-07 02:02:43,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 02:02:43,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 02:02:44,106 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_d6b5f2cd-2d72-41da-8f7e-d761b1259601/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c[48581,48594] [2021-11-07 02:02:44,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:02:44,129 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 02:02:44,295 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_d6b5f2cd-2d72-41da-8f7e-d761b1259601/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c[48581,48594] [2021-11-07 02:02:44,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 02:02:44,319 INFO L208 MainTranslator]: Completed translation [2021-11-07 02:02:44,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:02:44 WrapperNode [2021-11-07 02:02:44,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 02:02:44,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 02:02:44,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 02:02:44,322 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 02:02:44,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:02:44" (1/1) ... [2021-11-07 02:02:44,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:02:44" (1/1) ... [2021-11-07 02:02:44,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 02:02:44,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 02:02:44,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 02:02:44,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 02:02:44,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:02:44" (1/1) ... [2021-11-07 02:02:44,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:02:44" (1/1) ... [2021-11-07 02:02:44,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:02:44" (1/1) ... [2021-11-07 02:02:44,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:02:44" (1/1) ... [2021-11-07 02:02:44,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:02:44" (1/1) ... [2021-11-07 02:02:44,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:02:44" (1/1) ... [2021-11-07 02:02:44,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:02:44" (1/1) ... [2021-11-07 02:02:44,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 02:02:44,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 02:02:44,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 02:02:44,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 02:02:44,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:02:44" (1/1) ... [2021-11-07 02:02:44,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 02:02:44,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 02:02:44,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 02:02:44,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 02:02:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 02:02:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 02:02:44,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 02:02:44,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 02:02:45,201 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,250 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,257 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,283 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,285 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,287 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,298 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,310 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,316 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,320 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,322 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,325 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,334 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,338 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,358 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,359 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,363 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,370 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,371 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,377 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,380 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,382 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,390 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,393 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,395 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,399 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,402 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,403 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,404 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:45,407 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-07 02:02:47,035 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2021-11-07 02:02:47,036 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2021-11-07 02:02:47,036 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2021-11-07 02:02:47,036 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2021-11-07 02:02:47,037 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2021-11-07 02:02:47,037 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2021-11-07 02:02:47,037 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-11-07 02:02:47,038 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-11-07 02:02:47,038 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2021-11-07 02:02:47,038 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2021-11-07 02:02:47,038 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-11-07 02:02:47,039 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-11-07 02:02:47,039 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-11-07 02:02:47,040 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-11-07 02:02:47,040 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2021-11-07 02:02:47,040 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2021-11-07 02:02:47,041 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2021-11-07 02:02:47,041 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2021-11-07 02:02:47,042 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-11-07 02:02:47,043 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-11-07 02:02:47,043 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2021-11-07 02:02:47,044 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2021-11-07 02:02:47,044 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2021-11-07 02:02:47,045 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2021-11-07 02:02:47,045 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2021-11-07 02:02:47,045 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2021-11-07 02:02:47,045 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2021-11-07 02:02:47,046 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2021-11-07 02:02:47,046 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2021-11-07 02:02:47,046 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2021-11-07 02:02:47,046 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2021-11-07 02:02:47,047 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2021-11-07 02:02:47,047 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2021-11-07 02:02:47,047 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2021-11-07 02:02:47,047 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2021-11-07 02:02:47,048 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2021-11-07 02:02:47,048 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-11-07 02:02:47,048 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-11-07 02:02:47,048 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2021-11-07 02:02:47,049 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2021-11-07 02:02:47,049 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2021-11-07 02:02:47,049 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2021-11-07 02:02:47,049 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2021-11-07 02:02:47,050 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2021-11-07 02:02:47,050 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2021-11-07 02:02:47,050 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2021-11-07 02:02:47,050 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2021-11-07 02:02:47,051 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2021-11-07 02:02:47,051 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2021-11-07 02:02:47,051 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2021-11-07 02:02:47,052 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-11-07 02:02:47,052 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-11-07 02:02:47,052 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2021-11-07 02:02:47,053 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2021-11-07 02:02:47,053 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2021-11-07 02:02:47,054 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2021-11-07 02:02:47,054 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2021-11-07 02:02:47,055 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2021-11-07 02:02:47,056 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-11-07 02:02:47,056 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-11-07 02:02:48,625 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 02:02:48,625 INFO L299 CfgBuilder]: Removed 277 assume(true) statements. [2021-11-07 02:02:48,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:02:48 BoogieIcfgContainer [2021-11-07 02:02:48,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 02:02:48,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 02:02:48,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 02:02:48,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 02:02:48,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:02:43" (1/3) ... [2021-11-07 02:02:48,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a68100c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:02:48, skipping insertion in model container [2021-11-07 02:02:48,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:02:44" (2/3) ... [2021-11-07 02:02:48,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a68100c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:02:48, skipping insertion in model container [2021-11-07 02:02:48,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:02:48" (3/3) ... [2021-11-07 02:02:48,643 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-1.c [2021-11-07 02:02:48,650 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 02:02:48,651 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2021-11-07 02:02:48,722 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 02:02:48,731 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-11-07 02:02:48,731 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2021-11-07 02:02:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 354 states, 299 states have (on average 1.7759197324414715) internal successors, (531), 353 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-07 02:02:48,773 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:48,774 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-07 02:02:48,775 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:48,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash 120284422, now seen corresponding path program 1 times [2021-11-07 02:02:48,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:48,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551214867] [2021-11-07 02:02:48,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:48,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:49,056 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:49,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551214867] [2021-11-07 02:02:49,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551214867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:49,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:49,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:49,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528659450] [2021-11-07 02:02:49,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:49,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:49,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:49,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:49,092 INFO L87 Difference]: Start difference. First operand has 354 states, 299 states have (on average 1.7759197324414715) internal successors, (531), 353 states have internal predecessors, (531), 0 states have call successors, (0), 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.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:49,500 INFO L93 Difference]: Finished difference Result 646 states and 963 transitions. [2021-11-07 02:02:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:49,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-07 02:02:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:49,524 INFO L225 Difference]: With dead ends: 646 [2021-11-07 02:02:49,524 INFO L226 Difference]: Without dead ends: 365 [2021-11-07 02:02:49,531 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-11-07 02:02:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-11-07 02:02:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 345. [2021-11-07 02:02:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 310 states have (on average 1.5064516129032257) internal successors, (467), 344 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 467 transitions. [2021-11-07 02:02:49,659 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 467 transitions. Word has length 6 [2021-11-07 02:02:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:49,660 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 467 transitions. [2021-11-07 02:02:49,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 467 transitions. [2021-11-07 02:02:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 02:02:49,662 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:49,662 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:02:49,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 02:02:49,663 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1927424465, now seen corresponding path program 1 times [2021-11-07 02:02:49,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:49,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346041023] [2021-11-07 02:02:49,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:49,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:49,734 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:49,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346041023] [2021-11-07 02:02:49,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346041023] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:49,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:49,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 02:02:49,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939021413] [2021-11-07 02:02:49,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:49,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:49,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:49,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:49,740 INFO L87 Difference]: Start difference. First operand 345 states and 467 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-11-07 02:02:49,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:49,811 INFO L93 Difference]: Finished difference Result 387 states and 516 transitions. [2021-11-07 02:02:49,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:49,812 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-11-07 02:02:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:49,818 INFO L225 Difference]: With dead ends: 387 [2021-11-07 02:02:49,818 INFO L226 Difference]: Without dead ends: 364 [2021-11-07 02:02:49,820 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-11-07 02:02:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-11-07 02:02:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 356. [2021-11-07 02:02:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 355 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 483 transitions. [2021-11-07 02:02:49,862 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 483 transitions. Word has length 10 [2021-11-07 02:02:49,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:49,863 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 483 transitions. [2021-11-07 02:02:49,863 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-11-07 02:02:49,863 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 483 transitions. [2021-11-07 02:02:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 02:02:49,866 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:49,866 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:02:49,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 02:02:49,867 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:49,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:49,868 INFO L85 PathProgramCache]: Analyzing trace with hash -241979124, now seen corresponding path program 1 times [2021-11-07 02:02:49,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:49,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358245773] [2021-11-07 02:02:49,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:49,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:49,977 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:49,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358245773] [2021-11-07 02:02:49,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358245773] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:49,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:49,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:49,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985510425] [2021-11-07 02:02:49,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:49,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:49,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:49,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:49,982 INFO L87 Difference]: Start difference. First operand 356 states and 483 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:50,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:50,070 INFO L93 Difference]: Finished difference Result 437 states and 584 transitions. [2021-11-07 02:02:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:50,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 02:02:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:50,078 INFO L225 Difference]: With dead ends: 437 [2021-11-07 02:02:50,078 INFO L226 Difference]: Without dead ends: 400 [2021-11-07 02:02:50,079 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-11-07 02:02:50,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-11-07 02:02:50,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 382. [2021-11-07 02:02:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 350 states have (on average 1.4885714285714287) internal successors, (521), 381 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 521 transitions. [2021-11-07 02:02:50,119 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 521 transitions. Word has length 11 [2021-11-07 02:02:50,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:50,120 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 521 transitions. [2021-11-07 02:02:50,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 521 transitions. [2021-11-07 02:02:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 02:02:50,123 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:50,123 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:02:50,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 02:02:50,124 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:50,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash 576658662, now seen corresponding path program 1 times [2021-11-07 02:02:50,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:50,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018240237] [2021-11-07 02:02:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:50,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:50,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-11-07 02:02:50,219 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:50,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018240237] [2021-11-07 02:02:50,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018240237] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:50,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:50,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:50,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314181928] [2021-11-07 02:02:50,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:50,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:50,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:50,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:50,223 INFO L87 Difference]: Start difference. First operand 382 states and 521 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-11-07 02:02:50,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:50,305 INFO L93 Difference]: Finished difference Result 629 states and 840 transitions. [2021-11-07 02:02:50,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:50,306 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-11-07 02:02:50,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:50,310 INFO L225 Difference]: With dead ends: 629 [2021-11-07 02:02:50,310 INFO L226 Difference]: Without dead ends: 444 [2021-11-07 02:02:50,312 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-11-07 02:02:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-11-07 02:02:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 360. [2021-11-07 02:02:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 338 states have (on average 1.4408284023668638) internal successors, (487), 359 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 487 transitions. [2021-11-07 02:02:50,339 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 487 transitions. Word has length 12 [2021-11-07 02:02:50,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:50,340 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 487 transitions. [2021-11-07 02:02:50,340 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-11-07 02:02:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 487 transitions. [2021-11-07 02:02:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 02:02:50,342 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:50,343 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:02:50,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 02:02:50,344 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:50,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:50,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1121678930, now seen corresponding path program 1 times [2021-11-07 02:02:50,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:50,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607625727] [2021-11-07 02:02:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:50,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:50,439 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:50,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607625727] [2021-11-07 02:02:50,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607625727] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:50,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:50,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:50,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264779014] [2021-11-07 02:02:50,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:50,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:50,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:50,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:50,443 INFO L87 Difference]: Start difference. First operand 360 states and 487 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-11-07 02:02:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:50,662 INFO L93 Difference]: Finished difference Result 393 states and 527 transitions. [2021-11-07 02:02:50,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:50,663 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-11-07 02:02:50,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:50,670 INFO L225 Difference]: With dead ends: 393 [2021-11-07 02:02:50,670 INFO L226 Difference]: Without dead ends: 375 [2021-11-07 02:02:50,671 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-11-07 02:02:50,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-07 02:02:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2021-11-07 02:02:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 350 states have (on average 1.4314285714285715) internal successors, (501), 371 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 501 transitions. [2021-11-07 02:02:50,703 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 501 transitions. Word has length 14 [2021-11-07 02:02:50,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:50,704 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 501 transitions. [2021-11-07 02:02:50,704 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-11-07 02:02:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 501 transitions. [2021-11-07 02:02:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 02:02:50,713 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:50,713 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 02:02:50,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 02:02:50,715 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:50,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:50,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1731769240, now seen corresponding path program 1 times [2021-11-07 02:02:50,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:50,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849731464] [2021-11-07 02:02:50,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:50,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:50,832 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:50,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849731464] [2021-11-07 02:02:50,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849731464] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:50,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:50,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:50,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278656974] [2021-11-07 02:02:50,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:50,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:50,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:50,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:50,839 INFO L87 Difference]: Start difference. First operand 372 states and 501 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-11-07 02:02:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:51,032 INFO L93 Difference]: Finished difference Result 372 states and 501 transitions. [2021-11-07 02:02:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:51,033 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-11-07 02:02:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:51,036 INFO L225 Difference]: With dead ends: 372 [2021-11-07 02:02:51,037 INFO L226 Difference]: Without dead ends: 356 [2021-11-07 02:02:51,038 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-11-07 02:02:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-11-07 02:02:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2021-11-07 02:02:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 342 states have (on average 1.4152046783625731) internal successors, (484), 355 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:51,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 484 transitions. [2021-11-07 02:02:51,063 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 484 transitions. Word has length 17 [2021-11-07 02:02:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:51,064 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 484 transitions. [2021-11-07 02:02:51,064 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-11-07 02:02:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 484 transitions. [2021-11-07 02:02:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-07 02:02:51,066 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:51,066 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-11-07 02:02:51,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 02:02:51,067 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash -313015571, now seen corresponding path program 1 times [2021-11-07 02:02:51,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:51,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870755180] [2021-11-07 02:02:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:51,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:51,152 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:51,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870755180] [2021-11-07 02:02:51,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870755180] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:51,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:51,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:02:51,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410155050] [2021-11-07 02:02:51,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:02:51,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:02:51,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:02:51,168 INFO L87 Difference]: Start difference. First operand 356 states and 484 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:51,235 INFO L93 Difference]: Finished difference Result 443 states and 579 transitions. [2021-11-07 02:02:51,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:02:51,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-07 02:02:51,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:51,240 INFO L225 Difference]: With dead ends: 443 [2021-11-07 02:02:51,240 INFO L226 Difference]: Without dead ends: 407 [2021-11-07 02:02:51,241 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-11-07 02:02:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-11-07 02:02:51,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 343. [2021-11-07 02:02:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 329 states have (on average 1.4103343465045592) internal successors, (464), 342 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 464 transitions. [2021-11-07 02:02:51,268 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 464 transitions. Word has length 19 [2021-11-07 02:02:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:51,269 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 464 transitions. [2021-11-07 02:02:51,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 464 transitions. [2021-11-07 02:02:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 02:02:51,271 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:51,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] [2021-11-07 02:02:51,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 02:02:51,272 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:51,273 INFO L85 PathProgramCache]: Analyzing trace with hash -864042709, now seen corresponding path program 1 times [2021-11-07 02:02:51,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:51,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9099446] [2021-11-07 02:02:51,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:51,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:51,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-11-07 02:02:51,338 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:51,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9099446] [2021-11-07 02:02:51,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9099446] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:51,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:51,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:51,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736993134] [2021-11-07 02:02:51,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:51,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:51,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:51,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:51,341 INFO L87 Difference]: Start difference. First operand 343 states and 464 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:51,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:51,506 INFO L93 Difference]: Finished difference Result 443 states and 597 transitions. [2021-11-07 02:02:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:51,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-07 02:02:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:51,510 INFO L225 Difference]: With dead ends: 443 [2021-11-07 02:02:51,511 INFO L226 Difference]: Without dead ends: 340 [2021-11-07 02:02:51,512 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-11-07 02:02:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-07 02:02:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2021-11-07 02:02:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 328 states have (on average 1.4024390243902438) internal successors, (460), 339 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:51,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 460 transitions. [2021-11-07 02:02:51,536 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 460 transitions. Word has length 20 [2021-11-07 02:02:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:51,536 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 460 transitions. [2021-11-07 02:02:51,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 460 transitions. [2021-11-07 02:02:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 02:02:51,539 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:51,539 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] [2021-11-07 02:02:51,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 02:02:51,540 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:51,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1111820266, now seen corresponding path program 1 times [2021-11-07 02:02:51,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:51,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304095644] [2021-11-07 02:02:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:51,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:51,618 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:51,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304095644] [2021-11-07 02:02:51,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304095644] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:51,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:51,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:51,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311689836] [2021-11-07 02:02:51,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:02:51,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:51,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:02:51,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:02:51,621 INFO L87 Difference]: Start difference. First operand 340 states and 460 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:51,837 INFO L93 Difference]: Finished difference Result 352 states and 470 transitions. [2021-11-07 02:02:51,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:02:51,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-11-07 02:02:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:51,841 INFO L225 Difference]: With dead ends: 352 [2021-11-07 02:02:51,841 INFO L226 Difference]: Without dead ends: 343 [2021-11-07 02:02:51,842 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-11-07 02:02:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-11-07 02:02:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 340. [2021-11-07 02:02:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 328 states have (on average 1.396341463414634) internal successors, (458), 339 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 458 transitions. [2021-11-07 02:02:51,871 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 458 transitions. Word has length 20 [2021-11-07 02:02:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:51,871 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 458 transitions. [2021-11-07 02:02:51,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 458 transitions. [2021-11-07 02:02:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 02:02:51,873 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:51,874 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-11-07 02:02:51,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 02:02:51,874 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:51,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1090113680, now seen corresponding path program 1 times [2021-11-07 02:02:51,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:51,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927236495] [2021-11-07 02:02:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:51,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:51,918 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:51,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927236495] [2021-11-07 02:02:51,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927236495] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:51,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:51,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:51,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176081825] [2021-11-07 02:02:51,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:51,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:51,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:51,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:51,921 INFO L87 Difference]: Start difference. First operand 340 states and 458 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-11-07 02:02:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:51,975 INFO L93 Difference]: Finished difference Result 433 states and 570 transitions. [2021-11-07 02:02:51,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:51,976 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-11-07 02:02:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:51,979 INFO L225 Difference]: With dead ends: 433 [2021-11-07 02:02:51,979 INFO L226 Difference]: Without dead ends: 338 [2021-11-07 02:02:51,980 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-11-07 02:02:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-11-07 02:02:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 324. [2021-11-07 02:02:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 312 states have (on average 1.3814102564102564) internal successors, (431), 323 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:52,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 431 transitions. [2021-11-07 02:02:52,034 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 431 transitions. Word has length 21 [2021-11-07 02:02:52,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:52,034 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 431 transitions. [2021-11-07 02:02:52,035 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-11-07 02:02:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 431 transitions. [2021-11-07 02:02:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 02:02:52,037 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:52,037 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-11-07 02:02:52,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 02:02:52,038 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:52,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash -639651721, now seen corresponding path program 1 times [2021-11-07 02:02:52,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:52,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883077637] [2021-11-07 02:02:52,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:52,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:52,111 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:52,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883077637] [2021-11-07 02:02:52,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883077637] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:52,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:52,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:52,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009177540] [2021-11-07 02:02:52,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:02:52,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:52,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:02:52,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:02:52,115 INFO L87 Difference]: Start difference. First operand 324 states and 431 transitions. Second operand has 4 states, 4 states have (on average 5.25) 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-11-07 02:02:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:52,348 INFO L93 Difference]: Finished difference Result 336 states and 441 transitions. [2021-11-07 02:02:52,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:02:52,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) 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-11-07 02:02:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:52,352 INFO L225 Difference]: With dead ends: 336 [2021-11-07 02:02:52,353 INFO L226 Difference]: Without dead ends: 327 [2021-11-07 02:02:52,353 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-11-07 02:02:52,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-07 02:02:52,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 324. [2021-11-07 02:02:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 312 states have (on average 1.375) internal successors, (429), 323 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 429 transitions. [2021-11-07 02:02:52,383 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 429 transitions. Word has length 21 [2021-11-07 02:02:52,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:52,383 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 429 transitions. [2021-11-07 02:02:52,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) 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-11-07 02:02:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 429 transitions. [2021-11-07 02:02:52,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 02:02:52,385 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:52,386 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-11-07 02:02:52,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 02:02:52,386 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:52,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash 530749217, now seen corresponding path program 1 times [2021-11-07 02:02:52,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:52,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636081869] [2021-11-07 02:02:52,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:52,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:52,427 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:52,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636081869] [2021-11-07 02:02:52,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636081869] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:52,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:52,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:52,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392262809] [2021-11-07 02:02:52,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:52,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:52,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:52,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:52,431 INFO L87 Difference]: Start difference. First operand 324 states and 429 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-11-07 02:02:52,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:52,476 INFO L93 Difference]: Finished difference Result 355 states and 463 transitions. [2021-11-07 02:02:52,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:52,477 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-11-07 02:02:52,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:52,480 INFO L225 Difference]: With dead ends: 355 [2021-11-07 02:02:52,481 INFO L226 Difference]: Without dead ends: 320 [2021-11-07 02:02:52,481 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-11-07 02:02:52,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-11-07 02:02:52,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2021-11-07 02:02:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 305 states have (on average 1.3573770491803279) internal successors, (414), 316 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 414 transitions. [2021-11-07 02:02:52,510 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 414 transitions. Word has length 21 [2021-11-07 02:02:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:52,511 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 414 transitions. [2021-11-07 02:02:52,511 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-11-07 02:02:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 414 transitions. [2021-11-07 02:02:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 02:02:52,513 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:52,513 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-11-07 02:02:52,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 02:02:52,514 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:52,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:52,514 INFO L85 PathProgramCache]: Analyzing trace with hash -323328037, now seen corresponding path program 1 times [2021-11-07 02:02:52,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:52,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80760391] [2021-11-07 02:02:52,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:52,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:52,551 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:52,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80760391] [2021-11-07 02:02:52,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80760391] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:52,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:52,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:52,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408700959] [2021-11-07 02:02:52,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:52,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:52,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:52,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:52,555 INFO L87 Difference]: Start difference. First operand 317 states and 414 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-11-07 02:02:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:52,745 INFO L93 Difference]: Finished difference Result 368 states and 477 transitions. [2021-11-07 02:02:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:52,745 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-11-07 02:02:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:52,749 INFO L225 Difference]: With dead ends: 368 [2021-11-07 02:02:52,749 INFO L226 Difference]: Without dead ends: 360 [2021-11-07 02:02:52,750 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-11-07 02:02:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-11-07 02:02:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 325. [2021-11-07 02:02:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 313 states have (on average 1.3610223642172523) internal successors, (426), 324 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 426 transitions. [2021-11-07 02:02:52,801 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 426 transitions. Word has length 22 [2021-11-07 02:02:52,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:52,802 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 426 transitions. [2021-11-07 02:02:52,802 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-11-07 02:02:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 426 transitions. [2021-11-07 02:02:52,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 02:02:52,804 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:52,804 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-11-07 02:02:52,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 02:02:52,805 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:52,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:52,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1281675629, now seen corresponding path program 1 times [2021-11-07 02:02:52,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:52,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829347211] [2021-11-07 02:02:52,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:52,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:52,848 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:52,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829347211] [2021-11-07 02:02:52,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829347211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:52,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:52,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:02:52,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415359843] [2021-11-07 02:02:52,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:02:52,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:52,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:02:52,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:02:52,851 INFO L87 Difference]: Start difference. First operand 325 states and 426 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-11-07 02:02:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:52,913 INFO L93 Difference]: Finished difference Result 338 states and 438 transitions. [2021-11-07 02:02:52,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:02:52,914 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-11-07 02:02:52,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:52,917 INFO L225 Difference]: With dead ends: 338 [2021-11-07 02:02:52,917 INFO L226 Difference]: Without dead ends: 323 [2021-11-07 02:02:52,918 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-11-07 02:02:52,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-11-07 02:02:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2021-11-07 02:02:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.360128617363344) internal successors, (423), 322 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 423 transitions. [2021-11-07 02:02:52,948 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 423 transitions. Word has length 22 [2021-11-07 02:02:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:52,949 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 423 transitions. [2021-11-07 02:02:52,949 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-11-07 02:02:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 423 transitions. [2021-11-07 02:02:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 02:02:52,951 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:52,951 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-11-07 02:02:52,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 02:02:52,952 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:52,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1767458916, now seen corresponding path program 1 times [2021-11-07 02:02:52,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:52,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839372589] [2021-11-07 02:02:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:52,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:53,004 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:53,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839372589] [2021-11-07 02:02:53,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839372589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:53,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:53,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:02:53,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320662137] [2021-11-07 02:02:53,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:02:53,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:53,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:02:53,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:02:53,008 INFO L87 Difference]: Start difference. First operand 323 states and 423 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-11-07 02:02:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:53,077 INFO L93 Difference]: Finished difference Result 361 states and 462 transitions. [2021-11-07 02:02:53,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:02:53,078 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-11-07 02:02:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:53,081 INFO L225 Difference]: With dead ends: 361 [2021-11-07 02:02:53,081 INFO L226 Difference]: Without dead ends: 340 [2021-11-07 02:02:53,082 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-11-07 02:02:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-11-07 02:02:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 325. [2021-11-07 02:02:53,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 313 states have (on average 1.3578274760383386) internal successors, (425), 324 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 425 transitions. [2021-11-07 02:02:53,112 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 425 transitions. Word has length 22 [2021-11-07 02:02:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:53,113 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 425 transitions. [2021-11-07 02:02:53,113 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-11-07 02:02:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 425 transitions. [2021-11-07 02:02:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 02:02:53,115 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:53,115 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-11-07 02:02:53,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 02:02:53,116 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:53,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:53,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1677636943, now seen corresponding path program 1 times [2021-11-07 02:02:53,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:53,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807971918] [2021-11-07 02:02:53,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:53,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:53,164 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:53,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807971918] [2021-11-07 02:02:53,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807971918] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:53,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:53,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:02:53,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623683512] [2021-11-07 02:02:53,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:02:53,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:53,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:02:53,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:02:53,167 INFO L87 Difference]: Start difference. First operand 325 states and 425 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-11-07 02:02:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:53,239 INFO L93 Difference]: Finished difference Result 338 states and 437 transitions. [2021-11-07 02:02:53,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:02:53,240 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-11-07 02:02:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:53,243 INFO L225 Difference]: With dead ends: 338 [2021-11-07 02:02:53,243 INFO L226 Difference]: Without dead ends: 323 [2021-11-07 02:02:53,244 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-11-07 02:02:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-11-07 02:02:53,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2021-11-07 02:02:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 311 states have (on average 1.3569131832797428) internal successors, (422), 322 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2021-11-07 02:02:53,274 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 22 [2021-11-07 02:02:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:53,275 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2021-11-07 02:02:53,275 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-11-07 02:02:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2021-11-07 02:02:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 02:02:53,277 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:53,277 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-11-07 02:02:53,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 02:02:53,278 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:53,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:53,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1440892488, now seen corresponding path program 1 times [2021-11-07 02:02:53,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:53,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380442475] [2021-11-07 02:02:53,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:53,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:53,332 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:53,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380442475] [2021-11-07 02:02:53,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380442475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:53,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:53,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:53,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611742720] [2021-11-07 02:02:53,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:02:53,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:53,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:02:53,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:02:53,335 INFO L87 Difference]: Start difference. First operand 323 states and 422 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-11-07 02:02:53,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:53,604 INFO L93 Difference]: Finished difference Result 369 states and 472 transitions. [2021-11-07 02:02:53,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:02:53,605 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-11-07 02:02:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:53,609 INFO L225 Difference]: With dead ends: 369 [2021-11-07 02:02:53,609 INFO L226 Difference]: Without dead ends: 338 [2021-11-07 02:02:53,610 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-11-07 02:02:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2021-11-07 02:02:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 318. [2021-11-07 02:02:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 307 states have (on average 1.3485342019543973) internal successors, (414), 317 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 414 transitions. [2021-11-07 02:02:53,644 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 414 transitions. Word has length 23 [2021-11-07 02:02:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:53,644 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 414 transitions. [2021-11-07 02:02:53,645 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-11-07 02:02:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 414 transitions. [2021-11-07 02:02:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 02:02:53,646 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:53,646 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-11-07 02:02:53,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 02:02:53,647 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:53,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2038196278, now seen corresponding path program 1 times [2021-11-07 02:02:53,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:53,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470859888] [2021-11-07 02:02:53,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:53,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:53,702 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:53,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470859888] [2021-11-07 02:02:53,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470859888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:53,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:53,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:53,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287772559] [2021-11-07 02:02:53,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:53,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:53,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:53,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:53,707 INFO L87 Difference]: Start difference. First operand 318 states and 414 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-11-07 02:02:53,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:53,766 INFO L93 Difference]: Finished difference Result 435 states and 556 transitions. [2021-11-07 02:02:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:53,767 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-11-07 02:02:53,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:53,771 INFO L225 Difference]: With dead ends: 435 [2021-11-07 02:02:53,771 INFO L226 Difference]: Without dead ends: 341 [2021-11-07 02:02:53,772 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-11-07 02:02:53,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-11-07 02:02:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 306. [2021-11-07 02:02:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 298 states have (on average 1.3288590604026846) internal successors, (396), 305 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 396 transitions. [2021-11-07 02:02:53,806 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 396 transitions. Word has length 23 [2021-11-07 02:02:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:53,806 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 396 transitions. [2021-11-07 02:02:53,807 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-11-07 02:02:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 396 transitions. [2021-11-07 02:02:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:02:53,808 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:53,808 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-11-07 02:02:53,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 02:02:53,811 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:53,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:53,811 INFO L85 PathProgramCache]: Analyzing trace with hash 379424731, now seen corresponding path program 1 times [2021-11-07 02:02:53,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:53,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089352756] [2021-11-07 02:02:53,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:53,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:53,998 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:53,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089352756] [2021-11-07 02:02:53,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089352756] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:53,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:53,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:53,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305771872] [2021-11-07 02:02:54,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:54,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:54,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:54,002 INFO L87 Difference]: Start difference. First operand 306 states and 396 transitions. Second operand has 3 states, 3 states have (on average 8.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-11-07 02:02:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:54,084 INFO L93 Difference]: Finished difference Result 406 states and 518 transitions. [2021-11-07 02:02:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.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-11-07 02:02:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:54,087 INFO L225 Difference]: With dead ends: 406 [2021-11-07 02:02:54,088 INFO L226 Difference]: Without dead ends: 308 [2021-11-07 02:02:54,088 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-11-07 02:02:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-11-07 02:02:54,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 294. [2021-11-07 02:02:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 287 states have (on average 1.3170731707317074) internal successors, (378), 293 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 378 transitions. [2021-11-07 02:02:54,130 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 378 transitions. Word has length 24 [2021-11-07 02:02:54,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:54,130 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 378 transitions. [2021-11-07 02:02:54,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.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-11-07 02:02:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 378 transitions. [2021-11-07 02:02:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:02:54,132 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:54,132 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-11-07 02:02:54,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 02:02:54,133 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:54,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:54,134 INFO L85 PathProgramCache]: Analyzing trace with hash -414714960, now seen corresponding path program 1 times [2021-11-07 02:02:54,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:54,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999611880] [2021-11-07 02:02:54,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:54,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:54,198 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:54,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999611880] [2021-11-07 02:02:54,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999611880] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:54,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:54,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:54,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454857296] [2021-11-07 02:02:54,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:54,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:54,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:54,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:54,201 INFO L87 Difference]: Start difference. First operand 294 states and 378 transitions. Second operand has 3 states, 3 states have (on average 8.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-11-07 02:02:54,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:54,394 INFO L93 Difference]: Finished difference Result 392 states and 492 transitions. [2021-11-07 02:02:54,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:54,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.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-11-07 02:02:54,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:54,398 INFO L225 Difference]: With dead ends: 392 [2021-11-07 02:02:54,398 INFO L226 Difference]: Without dead ends: 379 [2021-11-07 02:02:54,399 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-11-07 02:02:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-11-07 02:02:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 321. [2021-11-07 02:02:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 314 states have (on average 1.2961783439490446) internal successors, (407), 320 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 407 transitions. [2021-11-07 02:02:54,445 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 407 transitions. Word has length 24 [2021-11-07 02:02:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:54,446 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 407 transitions. [2021-11-07 02:02:54,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.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-11-07 02:02:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 407 transitions. [2021-11-07 02:02:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 02:02:54,448 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:54,448 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-11-07 02:02:54,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 02:02:54,448 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:54,449 INFO L85 PathProgramCache]: Analyzing trace with hash 707855854, now seen corresponding path program 1 times [2021-11-07 02:02:54,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:54,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253072350] [2021-11-07 02:02:54,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:54,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:54,536 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:54,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253072350] [2021-11-07 02:02:54,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253072350] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:54,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:54,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:02:54,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351569885] [2021-11-07 02:02:54,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:02:54,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:54,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:02:54,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:02:54,540 INFO L87 Difference]: Start difference. First operand 321 states and 407 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-11-07 02:02:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:54,634 INFO L93 Difference]: Finished difference Result 334 states and 419 transitions. [2021-11-07 02:02:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:02:54,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-11-07 02:02:54,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:54,637 INFO L225 Difference]: With dead ends: 334 [2021-11-07 02:02:54,637 INFO L226 Difference]: Without dead ends: 317 [2021-11-07 02:02:54,638 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-11-07 02:02:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-07 02:02:54,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2021-11-07 02:02:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 310 states have (on average 1.2967741935483872) internal successors, (402), 316 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 402 transitions. [2021-11-07 02:02:54,679 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 402 transitions. Word has length 24 [2021-11-07 02:02:54,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:54,679 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 402 transitions. [2021-11-07 02:02:54,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-11-07 02:02:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 402 transitions. [2021-11-07 02:02:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:02:54,681 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:54,681 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-11-07 02:02:54,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 02:02:54,682 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:54,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:54,683 INFO L85 PathProgramCache]: Analyzing trace with hash -152605085, now seen corresponding path program 1 times [2021-11-07 02:02:54,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:54,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485556164] [2021-11-07 02:02:54,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:54,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:54,781 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:54,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485556164] [2021-11-07 02:02:54,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485556164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:54,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:54,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:54,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215021882] [2021-11-07 02:02:54,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:02:54,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:54,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:02:54,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:02:54,785 INFO L87 Difference]: Start difference. First operand 317 states and 402 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-11-07 02:02:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:55,001 INFO L93 Difference]: Finished difference Result 403 states and 509 transitions. [2021-11-07 02:02:55,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:02:55,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-11-07 02:02:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:55,007 INFO L225 Difference]: With dead ends: 403 [2021-11-07 02:02:55,007 INFO L226 Difference]: Without dead ends: 317 [2021-11-07 02:02:55,008 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-11-07 02:02:55,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-07 02:02:55,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2021-11-07 02:02:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 310 states have (on average 1.2870967741935484) internal successors, (399), 316 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 399 transitions. [2021-11-07 02:02:55,080 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 399 transitions. Word has length 25 [2021-11-07 02:02:55,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:55,080 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 399 transitions. [2021-11-07 02:02:55,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-11-07 02:02:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 399 transitions. [2021-11-07 02:02:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:02:55,082 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:55,082 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-11-07 02:02:55,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 02:02:55,083 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:55,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash 46329818, now seen corresponding path program 1 times [2021-11-07 02:02:55,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:55,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500950699] [2021-11-07 02:02:55,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:55,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:55,144 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:55,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500950699] [2021-11-07 02:02:55,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500950699] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:55,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:55,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:02:55,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919414687] [2021-11-07 02:02:55,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:02:55,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:55,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:02:55,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:02:55,147 INFO L87 Difference]: Start difference. First operand 317 states and 399 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-11-07 02:02:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:55,395 INFO L93 Difference]: Finished difference Result 375 states and 459 transitions. [2021-11-07 02:02:55,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:02:55,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-11-07 02:02:55,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:55,399 INFO L225 Difference]: With dead ends: 375 [2021-11-07 02:02:55,399 INFO L226 Difference]: Without dead ends: 372 [2021-11-07 02:02:55,400 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-11-07 02:02:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-11-07 02:02:55,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 330. [2021-11-07 02:02:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 323 states have (on average 1.284829721362229) internal successors, (415), 329 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:55,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 415 transitions. [2021-11-07 02:02:55,444 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 415 transitions. Word has length 25 [2021-11-07 02:02:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:55,445 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 415 transitions. [2021-11-07 02:02:55,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-11-07 02:02:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 415 transitions. [2021-11-07 02:02:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:02:55,446 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:55,447 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-11-07 02:02:55,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 02:02:55,447 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:55,448 INFO L85 PathProgramCache]: Analyzing trace with hash 46317902, now seen corresponding path program 1 times [2021-11-07 02:02:55,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:55,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740297266] [2021-11-07 02:02:55,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:55,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:55,506 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:55,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740297266] [2021-11-07 02:02:55,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740297266] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:55,507 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:55,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:55,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440551107] [2021-11-07 02:02:55,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:02:55,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:55,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:02:55,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:02:55,509 INFO L87 Difference]: Start difference. First operand 330 states and 415 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-11-07 02:02:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:55,709 INFO L93 Difference]: Finished difference Result 341 states and 425 transitions. [2021-11-07 02:02:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:02:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-11-07 02:02:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:55,713 INFO L225 Difference]: With dead ends: 341 [2021-11-07 02:02:55,713 INFO L226 Difference]: Without dead ends: 327 [2021-11-07 02:02:55,714 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-11-07 02:02:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-07 02:02:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2021-11-07 02:02:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 316 states have (on average 1.2784810126582278) internal successors, (404), 322 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 404 transitions. [2021-11-07 02:02:55,757 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 404 transitions. Word has length 25 [2021-11-07 02:02:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:55,758 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 404 transitions. [2021-11-07 02:02:55,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-11-07 02:02:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 404 transitions. [2021-11-07 02:02:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 02:02:55,760 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:55,760 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-11-07 02:02:55,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 02:02:55,760 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:55,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash -884415984, now seen corresponding path program 1 times [2021-11-07 02:02:55,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:55,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544735917] [2021-11-07 02:02:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:55,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:55,805 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:55,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544735917] [2021-11-07 02:02:55,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544735917] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:55,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:55,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:55,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744506040] [2021-11-07 02:02:55,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:02:55,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:55,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:02:55,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:02:55,808 INFO L87 Difference]: Start difference. First operand 323 states and 404 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-11-07 02:02:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:56,042 INFO L93 Difference]: Finished difference Result 376 states and 461 transitions. [2021-11-07 02:02:56,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:02:56,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-11-07 02:02:56,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:56,045 INFO L225 Difference]: With dead ends: 376 [2021-11-07 02:02:56,046 INFO L226 Difference]: Without dead ends: 323 [2021-11-07 02:02:56,046 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-11-07 02:02:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-11-07 02:02:56,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2021-11-07 02:02:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 316 states have (on average 1.2531645569620253) internal successors, (396), 322 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 396 transitions. [2021-11-07 02:02:56,090 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 396 transitions. Word has length 25 [2021-11-07 02:02:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:56,091 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 396 transitions. [2021-11-07 02:02:56,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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-11-07 02:02:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 396 transitions. [2021-11-07 02:02:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 02:02:56,092 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:56,093 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-11-07 02:02:56,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 02:02:56,093 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:56,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1255429665, now seen corresponding path program 1 times [2021-11-07 02:02:56,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:56,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285950282] [2021-11-07 02:02:56,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:56,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:56,189 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:56,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285950282] [2021-11-07 02:02:56,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285950282] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:56,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:56,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:02:56,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040142915] [2021-11-07 02:02:56,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:02:56,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:56,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:02:56,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:02:56,193 INFO L87 Difference]: Start difference. First operand 323 states and 396 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-11-07 02:02:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:56,491 INFO L93 Difference]: Finished difference Result 377 states and 462 transitions. [2021-11-07 02:02:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:02:56,492 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-11-07 02:02:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:56,495 INFO L225 Difference]: With dead ends: 377 [2021-11-07 02:02:56,495 INFO L226 Difference]: Without dead ends: 373 [2021-11-07 02:02:56,496 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:02:56,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-11-07 02:02:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 323. [2021-11-07 02:02:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 316 states have (on average 1.2531645569620253) internal successors, (396), 322 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 396 transitions. [2021-11-07 02:02:56,547 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 396 transitions. Word has length 26 [2021-11-07 02:02:56,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:56,548 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 396 transitions. [2021-11-07 02:02:56,548 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-11-07 02:02:56,549 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 396 transitions. [2021-11-07 02:02:56,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 02:02:56,550 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:56,550 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-11-07 02:02:56,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 02:02:56,551 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:56,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:56,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1808181060, now seen corresponding path program 1 times [2021-11-07 02:02:56,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:56,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125769757] [2021-11-07 02:02:56,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:56,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:56,676 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:56,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125769757] [2021-11-07 02:02:56,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125769757] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:56,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:56,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:02:56,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667475073] [2021-11-07 02:02:56,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:02:56,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:56,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:02:56,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:02:56,683 INFO L87 Difference]: Start difference. First operand 323 states and 396 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-11-07 02:02:56,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:56,914 INFO L93 Difference]: Finished difference Result 369 states and 441 transitions. [2021-11-07 02:02:56,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 02:02:56,915 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-11-07 02:02:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:56,918 INFO L225 Difference]: With dead ends: 369 [2021-11-07 02:02:56,918 INFO L226 Difference]: Without dead ends: 351 [2021-11-07 02:02:56,919 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:02:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-11-07 02:02:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 317. [2021-11-07 02:02:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 310 states have (on average 1.2225806451612904) internal successors, (379), 316 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 379 transitions. [2021-11-07 02:02:56,989 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 379 transitions. Word has length 26 [2021-11-07 02:02:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:56,989 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 379 transitions. [2021-11-07 02:02:56,990 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-11-07 02:02:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 379 transitions. [2021-11-07 02:02:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 02:02:56,991 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:56,991 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-11-07 02:02:56,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-07 02:02:56,992 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:56,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1624180011, now seen corresponding path program 1 times [2021-11-07 02:02:56,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:56,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58128485] [2021-11-07 02:02:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:56,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:57,037 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:57,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58128485] [2021-11-07 02:02:57,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58128485] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:57,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:57,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:57,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692266100] [2021-11-07 02:02:57,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:02:57,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:02:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:02:57,040 INFO L87 Difference]: Start difference. First operand 317 states and 379 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-11-07 02:02:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:57,220 INFO L93 Difference]: Finished difference Result 354 states and 412 transitions. [2021-11-07 02:02:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:02:57,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-11-07 02:02:57,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:57,224 INFO L225 Difference]: With dead ends: 354 [2021-11-07 02:02:57,224 INFO L226 Difference]: Without dead ends: 333 [2021-11-07 02:02:57,225 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-11-07 02:02:57,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-11-07 02:02:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 319. [2021-11-07 02:02:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 312 states have (on average 1.2083333333333333) internal successors, (377), 318 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 377 transitions. [2021-11-07 02:02:57,272 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 377 transitions. Word has length 26 [2021-11-07 02:02:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:57,272 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 377 transitions. [2021-11-07 02:02:57,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-11-07 02:02:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 377 transitions. [2021-11-07 02:02:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 02:02:57,274 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:57,274 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-11-07 02:02:57,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-07 02:02:57,275 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:57,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:57,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1207606985, now seen corresponding path program 1 times [2021-11-07 02:02:57,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:57,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154011471] [2021-11-07 02:02:57,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:57,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:57,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:57,334 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:57,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154011471] [2021-11-07 02:02:57,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154011471] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:57,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:57,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:57,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696394196] [2021-11-07 02:02:57,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:02:57,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:57,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:02:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:02:57,337 INFO L87 Difference]: Start difference. First operand 319 states and 377 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-11-07 02:02:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:57,537 INFO L93 Difference]: Finished difference Result 330 states and 386 transitions. [2021-11-07 02:02:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:02:57,538 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-11-07 02:02:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:57,541 INFO L225 Difference]: With dead ends: 330 [2021-11-07 02:02:57,541 INFO L226 Difference]: Without dead ends: 301 [2021-11-07 02:02:57,543 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-11-07 02:02:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-07 02:02:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 293. [2021-11-07 02:02:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 286 states have (on average 1.2167832167832169) internal successors, (348), 292 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 348 transitions. [2021-11-07 02:02:57,589 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 348 transitions. Word has length 27 [2021-11-07 02:02:57,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:57,590 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 348 transitions. [2021-11-07 02:02:57,590 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-11-07 02:02:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 348 transitions. [2021-11-07 02:02:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 02:02:57,592 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:57,592 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-11-07 02:02:57,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-07 02:02:57,594 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:57,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:57,595 INFO L85 PathProgramCache]: Analyzing trace with hash -890975267, now seen corresponding path program 1 times [2021-11-07 02:02:57,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:57,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709465531] [2021-11-07 02:02:57,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:57,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:57,644 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:57,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709465531] [2021-11-07 02:02:57,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709465531] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:57,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:57,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:57,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61001077] [2021-11-07 02:02:57,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:02:57,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:57,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:02:57,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:02:57,647 INFO L87 Difference]: Start difference. First operand 293 states and 348 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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-11-07 02:02:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:57,861 INFO L93 Difference]: Finished difference Result 311 states and 362 transitions. [2021-11-07 02:02:57,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:02:57,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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-11-07 02:02:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:57,864 INFO L225 Difference]: With dead ends: 311 [2021-11-07 02:02:57,897 INFO L226 Difference]: Without dead ends: 302 [2021-11-07 02:02:57,898 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-11-07 02:02:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-11-07 02:02:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 293. [2021-11-07 02:02:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 286 states have (on average 1.2097902097902098) internal successors, (346), 292 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 346 transitions. [2021-11-07 02:02:57,948 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 346 transitions. Word has length 28 [2021-11-07 02:02:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:57,948 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 346 transitions. [2021-11-07 02:02:57,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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-11-07 02:02:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 346 transitions. [2021-11-07 02:02:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 02:02:57,950 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:57,950 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-11-07 02:02:57,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-07 02:02:57,951 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:57,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash 476096558, now seen corresponding path program 1 times [2021-11-07 02:02:57,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:57,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292848194] [2021-11-07 02:02:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:57,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:58,023 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:58,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292848194] [2021-11-07 02:02:58,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292848194] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:58,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:58,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:02:58,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537755714] [2021-11-07 02:02:58,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:02:58,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:58,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:02:58,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:02:58,026 INFO L87 Difference]: Start difference. First operand 293 states and 346 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-11-07 02:02:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:58,367 INFO L93 Difference]: Finished difference Result 323 states and 380 transitions. [2021-11-07 02:02:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:02:58,368 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-11-07 02:02:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:58,371 INFO L225 Difference]: With dead ends: 323 [2021-11-07 02:02:58,371 INFO L226 Difference]: Without dead ends: 321 [2021-11-07 02:02:58,372 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:02:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-11-07 02:02:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 293. [2021-11-07 02:02:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 286 states have (on average 1.2097902097902098) internal successors, (346), 292 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 346 transitions. [2021-11-07 02:02:58,421 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 346 transitions. Word has length 28 [2021-11-07 02:02:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:58,421 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 346 transitions. [2021-11-07 02:02:58,421 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-11-07 02:02:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 346 transitions. [2021-11-07 02:02:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 02:02:58,423 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:58,423 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-11-07 02:02:58,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-07 02:02:58,424 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:58,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:58,425 INFO L85 PathProgramCache]: Analyzing trace with hash -371771776, now seen corresponding path program 1 times [2021-11-07 02:02:58,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:58,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640820325] [2021-11-07 02:02:58,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:58,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:58,485 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:58,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640820325] [2021-11-07 02:02:58,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640820325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:58,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:58,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:02:58,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966511692] [2021-11-07 02:02:58,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:02:58,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:58,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:02:58,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:02:58,489 INFO L87 Difference]: Start difference. First operand 293 states and 346 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-11-07 02:02:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:58,605 INFO L93 Difference]: Finished difference Result 320 states and 371 transitions. [2021-11-07 02:02:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:02:58,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-11-07 02:02:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:58,608 INFO L225 Difference]: With dead ends: 320 [2021-11-07 02:02:58,609 INFO L226 Difference]: Without dead ends: 303 [2021-11-07 02:02:58,611 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-11-07 02:02:58,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-11-07 02:02:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 290. [2021-11-07 02:02:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 283 states have (on average 1.2014134275618376) internal successors, (340), 289 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 340 transitions. [2021-11-07 02:02:58,659 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 340 transitions. Word has length 29 [2021-11-07 02:02:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:58,660 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 340 transitions. [2021-11-07 02:02:58,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-11-07 02:02:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 340 transitions. [2021-11-07 02:02:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 02:02:58,661 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:58,662 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-11-07 02:02:58,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-07 02:02:58,662 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:58,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:58,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1911218472, now seen corresponding path program 1 times [2021-11-07 02:02:58,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:58,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23670261] [2021-11-07 02:02:58,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:58,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:58,714 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:58,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23670261] [2021-11-07 02:02:58,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23670261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:58,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:58,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:02:58,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897853343] [2021-11-07 02:02:58,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:02:58,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:58,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:02:58,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:02:58,717 INFO L87 Difference]: Start difference. First operand 290 states and 340 transitions. Second operand has 4 states, 4 states have (on average 7.25) 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-11-07 02:02:58,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:58,932 INFO L93 Difference]: Finished difference Result 299 states and 347 transitions. [2021-11-07 02:02:58,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:02:58,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) 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-11-07 02:02:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:58,935 INFO L225 Difference]: With dead ends: 299 [2021-11-07 02:02:58,935 INFO L226 Difference]: Without dead ends: 266 [2021-11-07 02:02:58,939 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-11-07 02:02:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-11-07 02:02:58,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-11-07 02:02:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 259 states have (on average 1.196911196911197) internal successors, (310), 265 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 310 transitions. [2021-11-07 02:02:58,995 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 310 transitions. Word has length 29 [2021-11-07 02:02:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:58,996 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 310 transitions. [2021-11-07 02:02:58,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) 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-11-07 02:02:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 310 transitions. [2021-11-07 02:02:58,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 02:02:58,998 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:58,998 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-11-07 02:02:58,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-07 02:02:58,999 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:58,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:59,000 INFO L85 PathProgramCache]: Analyzing trace with hash -502736061, now seen corresponding path program 1 times [2021-11-07 02:02:59,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:59,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000838073] [2021-11-07 02:02:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:59,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:59,054 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:59,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000838073] [2021-11-07 02:02:59,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000838073] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:59,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:59,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:02:59,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261428863] [2021-11-07 02:02:59,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:02:59,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:59,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:02:59,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:02:59,058 INFO L87 Difference]: Start difference. First operand 266 states and 310 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-11-07 02:02:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:59,162 INFO L93 Difference]: Finished difference Result 290 states and 334 transitions. [2021-11-07 02:02:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:02:59,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-11-07 02:02:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:59,165 INFO L225 Difference]: With dead ends: 290 [2021-11-07 02:02:59,165 INFO L226 Difference]: Without dead ends: 266 [2021-11-07 02:02:59,166 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-11-07 02:02:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-11-07 02:02:59,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2021-11-07 02:02:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 259 states have (on average 1.193050193050193) internal successors, (309), 265 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 309 transitions. [2021-11-07 02:02:59,210 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 309 transitions. Word has length 29 [2021-11-07 02:02:59,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:59,210 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 309 transitions. [2021-11-07 02:02:59,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-11-07 02:02:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 309 transitions. [2021-11-07 02:02:59,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:02:59,212 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:59,212 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] [2021-11-07 02:02:59,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-07 02:02:59,213 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:59,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:59,214 INFO L85 PathProgramCache]: Analyzing trace with hash 96845592, now seen corresponding path program 1 times [2021-11-07 02:02:59,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:59,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060323039] [2021-11-07 02:02:59,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:59,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:59,302 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:59,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060323039] [2021-11-07 02:02:59,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060323039] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:59,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:59,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:02:59,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819938678] [2021-11-07 02:02:59,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:02:59,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:02:59,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:02:59,305 INFO L87 Difference]: Start difference. First operand 266 states and 309 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:59,527 INFO L93 Difference]: Finished difference Result 291 states and 330 transitions. [2021-11-07 02:02:59,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:02:59,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-11-07 02:02:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:59,530 INFO L225 Difference]: With dead ends: 291 [2021-11-07 02:02:59,530 INFO L226 Difference]: Without dead ends: 272 [2021-11-07 02:02:59,531 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-11-07 02:02:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-07 02:02:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 258. [2021-11-07 02:02:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 251 states have (on average 1.1952191235059761) internal successors, (300), 257 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 300 transitions. [2021-11-07 02:02:59,575 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 300 transitions. Word has length 30 [2021-11-07 02:02:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:02:59,576 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 300 transitions. [2021-11-07 02:02:59,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 300 transitions. [2021-11-07 02:02:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 02:02:59,577 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:02:59,577 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] [2021-11-07 02:02:59,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-07 02:02:59,578 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:02:59,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:02:59,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1912192022, now seen corresponding path program 1 times [2021-11-07 02:02:59,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:02:59,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102894744] [2021-11-07 02:02:59,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:02:59,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:02:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:02:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:02:59,677 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:02:59,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102894744] [2021-11-07 02:02:59,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102894744] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:02:59,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:02:59,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:02:59,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76159730] [2021-11-07 02:02:59,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:02:59,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:02:59,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:02:59,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:02:59,680 INFO L87 Difference]: Start difference. First operand 258 states and 300 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:02:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:02:59,955 INFO L93 Difference]: Finished difference Result 334 states and 395 transitions. [2021-11-07 02:02:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:02:59,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-11-07 02:02:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:02:59,958 INFO L225 Difference]: With dead ends: 334 [2021-11-07 02:02:59,958 INFO L226 Difference]: Without dead ends: 266 [2021-11-07 02:02:59,959 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:02:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-11-07 02:03:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 248. [2021-11-07 02:03:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 242 states have (on average 1.1859504132231404) 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-11-07 02:03:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 287 transitions. [2021-11-07 02:03:00,029 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 287 transitions. Word has length 30 [2021-11-07 02:03:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:00,029 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 287 transitions. [2021-11-07 02:03:00,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 287 transitions. [2021-11-07 02:03:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-07 02:03:00,031 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:00,031 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] [2021-11-07 02:03:00,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-07 02:03:00,033 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:03:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:00,034 INFO L85 PathProgramCache]: Analyzing trace with hash -879337433, now seen corresponding path program 1 times [2021-11-07 02:03:00,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:00,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740593818] [2021-11-07 02:03:00,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:00,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:03:00,102 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:03:00,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740593818] [2021-11-07 02:03:00,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740593818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:03:00,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:03:00,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:03:00,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720169029] [2021-11-07 02:03:00,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:03:00,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:00,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:03:00,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:03:00,107 INFO L87 Difference]: Start difference. First operand 248 states and 287 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:03:00,188 INFO L93 Difference]: Finished difference Result 271 states and 307 transitions. [2021-11-07 02:03:00,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:03:00,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-11-07 02:03:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:03:00,191 INFO L225 Difference]: With dead ends: 271 [2021-11-07 02:03:00,191 INFO L226 Difference]: Without dead ends: 247 [2021-11-07 02:03:00,192 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-07 02:03:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-11-07 02:03:00,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 234. [2021-11-07 02:03:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 229 states have (on average 1.1746724890829694) internal successors, (269), 233 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 269 transitions. [2021-11-07 02:03:00,231 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 269 transitions. Word has length 31 [2021-11-07 02:03:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:00,231 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 269 transitions. [2021-11-07 02:03:00,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 269 transitions. [2021-11-07 02:03:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-07 02:03:00,233 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:00,233 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-11-07 02:03:00,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-07 02:03:00,233 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:03:00,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:00,234 INFO L85 PathProgramCache]: Analyzing trace with hash -522752280, now seen corresponding path program 1 times [2021-11-07 02:03:00,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:00,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665188920] [2021-11-07 02:03:00,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:00,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:03:00,326 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:03:00,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665188920] [2021-11-07 02:03:00,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665188920] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:03:00,327 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:03:00,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:03:00,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045197448] [2021-11-07 02:03:00,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:03:00,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:00,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:03:00,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:03:00,330 INFO L87 Difference]: Start difference. First operand 234 states and 269 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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-11-07 02:03:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:03:00,565 INFO L93 Difference]: Finished difference Result 266 states and 306 transitions. [2021-11-07 02:03:00,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:03:00,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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-11-07 02:03:00,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:03:00,568 INFO L225 Difference]: With dead ends: 266 [2021-11-07 02:03:00,568 INFO L226 Difference]: Without dead ends: 242 [2021-11-07 02:03:00,569 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:03:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-07 02:03:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 227. [2021-11-07 02:03:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 223 states have (on average 1.1659192825112108) internal successors, (260), 226 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 260 transitions. [2021-11-07 02:03:00,608 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 260 transitions. Word has length 32 [2021-11-07 02:03:00,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:00,608 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 260 transitions. [2021-11-07 02:03:00,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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-11-07 02:03:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 260 transitions. [2021-11-07 02:03:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-07 02:03:00,610 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:00,610 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] [2021-11-07 02:03:00,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-07 02:03:00,611 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:03:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:00,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1032708207, now seen corresponding path program 1 times [2021-11-07 02:03:00,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:00,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978901114] [2021-11-07 02:03:00,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:00,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:03:00,656 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:03:00,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978901114] [2021-11-07 02:03:00,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978901114] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:03:00,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:03:00,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 02:03:00,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622726121] [2021-11-07 02:03:00,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 02:03:00,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:00,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 02:03:00,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 02:03:00,659 INFO L87 Difference]: Start difference. First operand 227 states and 260 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:03:00,717 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2021-11-07 02:03:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 02:03:00,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-11-07 02:03:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:03:00,720 INFO L225 Difference]: With dead ends: 244 [2021-11-07 02:03:00,721 INFO L226 Difference]: Without dead ends: 228 [2021-11-07 02:03:00,721 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-11-07 02:03:00,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-11-07 02:03:00,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2021-11-07 02:03:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 220 states have (on average 1.1636363636363636) internal successors, (256), 223 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 256 transitions. [2021-11-07 02:03:00,766 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 256 transitions. Word has length 33 [2021-11-07 02:03:00,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:00,767 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 256 transitions. [2021-11-07 02:03:00,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 256 transitions. [2021-11-07 02:03:00,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-07 02:03:00,768 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:00,769 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] [2021-11-07 02:03:00,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-07 02:03:00,769 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:03:00,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:00,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1689083006, now seen corresponding path program 1 times [2021-11-07 02:03:00,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:00,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948847861] [2021-11-07 02:03:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:00,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:03:00,841 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:03:00,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948847861] [2021-11-07 02:03:00,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948847861] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:03:00,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:03:00,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:03:00,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105992336] [2021-11-07 02:03:00,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:03:00,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:00,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:03:00,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:03:00,844 INFO L87 Difference]: Start difference. First operand 224 states and 256 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:03:01,043 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2021-11-07 02:03:01,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 02:03:01,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2021-11-07 02:03:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:03:01,062 INFO L225 Difference]: With dead ends: 244 [2021-11-07 02:03:01,062 INFO L226 Difference]: Without dead ends: 198 [2021-11-07 02:03:01,063 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-11-07 02:03:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-07 02:03:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 178. [2021-11-07 02:03:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 1.1828571428571428) internal successors, (207), 177 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 207 transitions. [2021-11-07 02:03:01,094 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 207 transitions. Word has length 33 [2021-11-07 02:03:01,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:01,094 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 207 transitions. [2021-11-07 02:03:01,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 207 transitions. [2021-11-07 02:03:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 02:03:01,096 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:01,096 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-11-07 02:03:01,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-07 02:03:01,096 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:03:01,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1905139186, now seen corresponding path program 1 times [2021-11-07 02:03:01,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:01,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538610069] [2021-11-07 02:03:01,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:01,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:03:01,167 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:03:01,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538610069] [2021-11-07 02:03:01,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538610069] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:03:01,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:03:01,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:03:01,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727387430] [2021-11-07 02:03:01,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:03:01,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:01,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:03:01,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:03:01,169 INFO L87 Difference]: Start difference. First operand 178 states and 207 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:01,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:03:01,336 INFO L93 Difference]: Finished difference Result 210 states and 250 transitions. [2021-11-07 02:03:01,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:03:01,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-11-07 02:03:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:03:01,339 INFO L225 Difference]: With dead ends: 210 [2021-11-07 02:03:01,339 INFO L226 Difference]: Without dead ends: 208 [2021-11-07 02:03:01,339 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:03:01,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-07 02:03:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 178. [2021-11-07 02:03:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 1.1828571428571428) internal successors, (207), 177 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 207 transitions. [2021-11-07 02:03:01,370 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 207 transitions. Word has length 36 [2021-11-07 02:03:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:01,370 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 207 transitions. [2021-11-07 02:03:01,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 207 transitions. [2021-11-07 02:03:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-07 02:03:01,372 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:01,372 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, 1] [2021-11-07 02:03:01,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-07 02:03:01,373 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:03:01,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1820777888, now seen corresponding path program 1 times [2021-11-07 02:03:01,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:01,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562590991] [2021-11-07 02:03:01,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:01,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:03:01,449 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:03:01,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562590991] [2021-11-07 02:03:01,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562590991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:03:01,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:03:01,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:03:01,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376744972] [2021-11-07 02:03:01,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:03:01,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:01,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:03:01,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:03:01,452 INFO L87 Difference]: Start difference. First operand 178 states and 207 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:03:01,530 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2021-11-07 02:03:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:03:01,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2021-11-07 02:03:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:03:01,531 INFO L225 Difference]: With dead ends: 182 [2021-11-07 02:03:01,532 INFO L226 Difference]: Without dead ends: 137 [2021-11-07 02:03:01,532 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-11-07 02:03:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-11-07 02:03:01,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-11-07 02:03:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 134 states have (on average 1.171641791044776) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2021-11-07 02:03:01,580 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 37 [2021-11-07 02:03:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:01,580 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2021-11-07 02:03:01,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2021-11-07 02:03:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 02:03:01,583 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:01,583 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, 1, 1, 1, 1] [2021-11-07 02:03:01,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-07 02:03:01,584 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:03:01,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:01,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2024872774, now seen corresponding path program 1 times [2021-11-07 02:03:01,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:01,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567896879] [2021-11-07 02:03:01,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:01,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:01,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:03:01,648 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:03:01,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567896879] [2021-11-07 02:03:01,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567896879] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:03:01,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:03:01,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:03:01,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711660087] [2021-11-07 02:03:01,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:03:01,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:01,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:03:01,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:03:01,654 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:03:01,769 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2021-11-07 02:03:01,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 02:03:01,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-11-07 02:03:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:03:01,771 INFO L225 Difference]: With dead ends: 153 [2021-11-07 02:03:01,771 INFO L226 Difference]: Without dead ends: 137 [2021-11-07 02:03:01,773 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-07 02:03:01,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-11-07 02:03:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-11-07 02:03:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 134 states have (on average 1.164179104477612) internal successors, (156), 136 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2021-11-07 02:03:01,801 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 40 [2021-11-07 02:03:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:01,803 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2021-11-07 02:03:01,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2021-11-07 02:03:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 02:03:01,805 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:01,805 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, 1, 1, 1, 1] [2021-11-07 02:03:01,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-07 02:03:01,806 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:03:01,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:01,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1289584511, now seen corresponding path program 1 times [2021-11-07 02:03:01,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:01,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899163796] [2021-11-07 02:03:01,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:01,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:03:01,881 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:03:01,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899163796] [2021-11-07 02:03:01,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899163796] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:03:01,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:03:01,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 02:03:01,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062206693] [2021-11-07 02:03:01,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 02:03:01,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:01,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 02:03:01,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:03:01,884 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:03:02,021 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2021-11-07 02:03:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 02:03:02,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-11-07 02:03:02,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:03:02,024 INFO L225 Difference]: With dead ends: 164 [2021-11-07 02:03:02,024 INFO L226 Difference]: Without dead ends: 146 [2021-11-07 02:03:02,025 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-11-07 02:03:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-07 02:03:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2021-11-07 02:03:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 141 states have (on average 1.1560283687943262) internal successors, (163), 143 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 163 transitions. [2021-11-07 02:03:02,054 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 163 transitions. Word has length 40 [2021-11-07 02:03:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:02,055 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 163 transitions. [2021-11-07 02:03:02,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 163 transitions. [2021-11-07 02:03:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 02:03:02,056 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:02,056 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, 1, 1, 1, 1] [2021-11-07 02:03:02,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-07 02:03:02,057 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:03:02,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:02,058 INFO L85 PathProgramCache]: Analyzing trace with hash -890858384, now seen corresponding path program 1 times [2021-11-07 02:03:02,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:02,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860176340] [2021-11-07 02:03:02,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:02,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:03:02,150 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:03:02,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860176340] [2021-11-07 02:03:02,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860176340] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:03:02,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:03:02,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 02:03:02,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386042399] [2021-11-07 02:03:02,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 02:03:02,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:02,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 02:03:02,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 02:03:02,153 INFO L87 Difference]: Start difference. First operand 144 states and 163 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:03:02,336 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2021-11-07 02:03:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 02:03:02,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2021-11-07 02:03:02,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:03:02,340 INFO L225 Difference]: With dead ends: 203 [2021-11-07 02:03:02,341 INFO L226 Difference]: Without dead ends: 151 [2021-11-07 02:03:02,341 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-11-07 02:03:02,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-07 02:03:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 122. [2021-11-07 02:03:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.1083333333333334) internal successors, (133), 121 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2021-11-07 02:03:02,371 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 40 [2021-11-07 02:03:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:02,372 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2021-11-07 02:03:02,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2021-11-07 02:03:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-07 02:03:02,376 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:02,377 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, 1, 1, 1, 1, 1] [2021-11-07 02:03:02,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-07 02:03:02,377 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:03:02,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2019812524, now seen corresponding path program 1 times [2021-11-07 02:03:02,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:02,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524363998] [2021-11-07 02:03:02,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:02,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 02:03:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 02:03:02,415 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 02:03:02,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524363998] [2021-11-07 02:03:02,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524363998] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 02:03:02,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 02:03:02,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 02:03:02,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018806441] [2021-11-07 02:03:02,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 02:03:02,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 02:03:02,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 02:03:02,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 02:03:02,418 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:02,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 02:03:02,455 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2021-11-07 02:03:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 02:03:02,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-11-07 02:03:02,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 02:03:02,457 INFO L225 Difference]: With dead ends: 158 [2021-11-07 02:03:02,458 INFO L226 Difference]: Without dead ends: 136 [2021-11-07 02:03:02,458 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-11-07 02:03:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-11-07 02:03:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 122. [2021-11-07 02:03:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.1) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:02,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2021-11-07 02:03:02,486 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 41 [2021-11-07 02:03:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 02:03:02,487 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2021-11-07 02:03:02,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 02:03:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2021-11-07 02:03:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-07 02:03:02,493 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 02:03:02,493 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, 1, 1, 1, 1, 1, 1] [2021-11-07 02:03:02,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-07 02:03:02,494 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-11-07 02:03:02,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 02:03:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash 7149933, now seen corresponding path program 1 times [2021-11-07 02:03:02,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 02:03:02,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420459713] [2021-11-07 02:03:02,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 02:03:02,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 02:03:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:03:02,553 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 02:03:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 02:03:02,636 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 02:03:02,636 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 02:03:02,638 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,640 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,641 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,642 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,643 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,644 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,645 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,648 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,649 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,649 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,649 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,650 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,650 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,650 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,650 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,651 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,651 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,651 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,651 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,652 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,652 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,652 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,652 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,653 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,653 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,653 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,653 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,654 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,654 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 02:03:02,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-07 02:03:02,659 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, 1, 1] [2021-11-07 02:03:02,664 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 02:03:02,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:03:02 BoogieIcfgContainer [2021-11-07 02:03:02,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 02:03:02,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 02:03:02,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 02:03:02,810 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 02:03:02,810 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:02:48" (3/4) ... [2021-11-07 02:03:02,813 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 02:03:02,987 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 02:03:02,987 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 02:03:02,989 INFO L168 Benchmark]: Toolchain (without parser) took 19491.08 ms. Allocated memory was 92.3 MB in the beginning and 266.3 MB in the end (delta: 174.1 MB). Free memory was 54.1 MB in the beginning and 125.1 MB in the end (delta: -71.0 MB). Peak memory consumption was 103.3 MB. Max. memory is 16.1 GB. [2021-11-07 02:03:02,990 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 92.3 MB. Free memory was 72.4 MB in the beginning and 72.4 MB in the end (delta: 56.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 02:03:02,990 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.82 ms. Allocated memory is still 92.3 MB. Free memory was 53.9 MB in the beginning and 56.1 MB in the end (delta: -2.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 02:03:02,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 209.13 ms. Allocated memory is still 92.3 MB. Free memory was 56.1 MB in the beginning and 45.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 02:03:02,991 INFO L168 Benchmark]: Boogie Preprocessor took 207.87 ms. Allocated memory is still 92.3 MB. Free memory was 45.4 MB in the beginning and 39.0 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 02:03:02,992 INFO L168 Benchmark]: RCFGBuilder took 3890.52 ms. Allocated memory was 92.3 MB in the beginning and 146.8 MB in the end (delta: 54.5 MB). Free memory was 39.0 MB in the beginning and 92.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 31.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:03:02,992 INFO L168 Benchmark]: TraceAbstraction took 14175.90 ms. Allocated memory was 146.8 MB in the beginning and 266.3 MB in the end (delta: 119.5 MB). Free memory was 91.4 MB in the beginning and 139.9 MB in the end (delta: -48.5 MB). Peak memory consumption was 72.1 MB. Max. memory is 16.1 GB. [2021-11-07 02:03:02,993 INFO L168 Benchmark]: Witness Printer took 177.96 ms. Allocated memory is still 266.3 MB. Free memory was 139.9 MB in the beginning and 125.1 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-07 02:03:02,996 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.37 ms. Allocated memory is still 92.3 MB. Free memory was 72.4 MB in the beginning and 72.4 MB in the end (delta: 56.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 818.82 ms. Allocated memory is still 92.3 MB. Free memory was 53.9 MB in the beginning and 56.1 MB in the end (delta: -2.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 209.13 ms. Allocated memory is still 92.3 MB. Free memory was 56.1 MB in the beginning and 45.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 207.87 ms. Allocated memory is still 92.3 MB. Free memory was 45.4 MB in the beginning and 39.0 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3890.52 ms. Allocated memory was 92.3 MB in the beginning and 146.8 MB in the end (delta: 54.5 MB). Free memory was 39.0 MB in the beginning and 92.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 31.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14175.90 ms. Allocated memory was 146.8 MB in the beginning and 266.3 MB in the end (delta: 119.5 MB). Free memory was 91.4 MB in the beginning and 139.9 MB in the end (delta: -48.5 MB). Peak memory consumption was 72.1 MB. Max. memory is 16.1 GB. * Witness Printer took 177.96 ms. Allocated memory is still 266.3 MB. Free memory was 139.9 MB in the beginning and 125.1 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.7 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: 1627]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int FloppyThread ; [L43] int KernelMode ; [L44] int Suspended ; [L45] int Executive ; [L46] int DiskController ; [L47] int FloppyDiskPeripheral ; [L48] int FlConfigCallBack ; [L49] int MaximumInterfaceType ; [L50] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L51] int myStatus ; [L52] int s ; [L53] int UNLOADED ; [L54] int NP ; [L55] int DC ; [L56] int SKIP1 ; [L57] int SKIP2 ; [L58] int MPR1 ; [L59] int MPR3 ; [L60] int IPC ; [L61] int pended ; [L62] int compRegistered ; [L63] int lowerDriverReturn ; [L64] int setEventCalled ; [L65] int customIrp ; [L88] int PagingReferenceCount = 0; [L89] int PagingMutex = 0; [L668] int status ; [L669] int irp = __VERIFIER_nondet_int() ; [L670] int pirp ; [L671] int pirp__IoStatus__Status ; [L672] int irp_choice = __VERIFIER_nondet_int() ; [L673] int devobj = __VERIFIER_nondet_int() ; [L674] int __cil_tmp8 ; [L676] FloppyThread = 0 [L677] KernelMode = 0 [L678] Suspended = 0 [L679] Executive = 0 [L680] DiskController = 0 [L681] FloppyDiskPeripheral = 0 [L682] FlConfigCallBack = 0 [L683] MaximumInterfaceType = 0 [L684] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L685] myStatus = 0 [L686] s = 0 [L687] UNLOADED = 0 [L688] NP = 0 [L689] DC = 0 [L690] SKIP1 = 0 [L691] SKIP2 = 0 [L692] MPR1 = 0 [L693] MPR3 = 0 [L694] IPC = 0 [L695] pended = 0 [L696] compRegistered = 0 [L697] lowerDriverReturn = 0 [L698] setEventCalled = 0 [L699] customIrp = 0 [L703] status = 0 [L704] pirp = irp [L71] UNLOADED = 0 [L72] NP = 1 [L73] DC = 2 [L74] SKIP1 = 3 [L75] SKIP2 = 4 [L76] MPR1 = 5 [L77] MPR3 = 6 [L78] IPC = 7 [L79] s = UNLOADED [L80] pended = 0 [L81] compRegistered = 0 [L82] lowerDriverReturn = 0 [L83] setEventCalled = 0 [L84] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L707] COND TRUE status >= 0 [L708] s = NP [L709] customIrp = 0 [L710] setEventCalled = customIrp [L711] lowerDriverReturn = setEventCalled [L712] compRegistered = lowerDriverReturn [L713] pended = compRegistered [L714] pirp__IoStatus__Status = 0 [L715] myStatus = 0 [L716] COND TRUE irp_choice == 0 [L717] pirp__IoStatus__Status = -1073741637 [L718] myStatus = -1073741637 [L658] s = NP [L659] pended = 0 [L660] compRegistered = 0 [L661] lowerDriverReturn = 0 [L662] setEventCalled = 0 [L663] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L724] COND FALSE !(status < 0) [L728] int tmp_ndt_1; [L729] tmp_ndt_1 = __VERIFIER_nondet_int() [L730] COND FALSE !(tmp_ndt_1 == 0) [L733] int tmp_ndt_2; [L734] tmp_ndt_2 = __VERIFIER_nondet_int() [L735] COND FALSE !(tmp_ndt_2 == 1) [L738] int tmp_ndt_3; [L739] tmp_ndt_3 = __VERIFIER_nondet_int() [L740] COND FALSE !(tmp_ndt_3 == 2) [L743] int tmp_ndt_4; [L744] tmp_ndt_4 = __VERIFIER_nondet_int() [L745] COND TRUE tmp_ndt_4 == 3 [L161] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L162] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L163] int Irp__IoStatus__Information ; [L164] int Irp__IoStatus__Status ; [L165] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L166] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L167] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L168] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L169] int disketteExtension__HoldNewRequests ; [L170] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L171] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L172] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L173] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L174] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L175] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L176] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L177] int irpSp ; [L178] int disketteExtension ; [L179] int ntStatus ; [L180] int doneEvent = __VERIFIER_nondet_int() ; [L181] int irpSp___0 ; [L182] int nextIrpSp ; [L183] int nextIrpSp__Control ; [L184] int irpSp___1 ; [L185] int irpSp__Context ; [L186] int irpSp__Control ; [L187] long __cil_tmp29 ; [L188] long __cil_tmp30 ; [L191] ntStatus = 0 [L192] PagingReferenceCount ++ [L193] COND TRUE PagingReferenceCount == 1 [L196] disketteExtension = DeviceObject__DeviceExtension [L197] irpSp = Irp__Tail__Overlay__CurrentStackLocation VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L198] COND FALSE !(\read(disketteExtension__IsRemoved)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L207] COND FALSE !(irpSp__MinorFunction == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L210] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L236] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L239] COND FALSE !(! disketteExtension__IsStarted) [L255] disketteExtension__HoldNewRequests = 1 [L98] int status ; [L99] int threadHandle = __VERIFIER_nondet_int() ; [L100] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L101] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L102] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L103] int Irp__IoStatus__Status ; [L104] int Irp__IoStatus__Information ; [L105] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L106] int ObjAttributes = __VERIFIER_nondet_int() ; [L107] int __cil_tmp12 ; [L108] int __cil_tmp13 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L111] COND FALSE !(DisketteExtension__PoweringDown == 1) [L117] DisketteExtension__ThreadReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L118] COND FALSE !(DisketteExtension__ThreadReferenceCount == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L150] COND TRUE pended == 0 [L151] pended = 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L157] return (259); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L256] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L259] __cil_tmp29 = (long )ntStatus VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L260] COND TRUE __cil_tmp29 == 259L [L1066] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1075] COND FALSE !(customIrp == 1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1079] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1086] int tmp_ndt_12; [L1087] tmp_ndt_12 = __VERIFIER_nondet_int() [L1088] COND TRUE tmp_ndt_12 == 0 [L1094] return (0); [L265] COND FALSE !(disketteExtension__FloppyThread != 0) [L268] disketteExtension__FloppyThread = 0 [L269] Irp__IoStatus__Status = 0 [L270] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L271] COND TRUE s == NP [L272] s = SKIP1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L279] Irp__CurrentLocation ++ [L280] Irp__Tail__Overlay__CurrentStackLocation ++ [L968] int returnVal2 ; [L969] int compRetStatus1 ; [L970] int lcontext = __VERIFIER_nondet_int() ; [L971] unsigned long __cil_tmp7 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L974] COND FALSE !(\read(compRegistered)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L987] int tmp_ndt_10; [L988] tmp_ndt_10 = __VERIFIER_nondet_int() [L989] COND FALSE !(tmp_ndt_10 == 0) [L992] int tmp_ndt_11; [L993] tmp_ndt_11 = __VERIFIER_nondet_int() [L994] COND TRUE tmp_ndt_11 == 1 [L1003] returnVal2 = -1073741823 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1013] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1017] COND FALSE !(s == MPR1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1026] COND TRUE s == SKIP1 [L1027] s = SKIP2 [L1028] lowerDriverReturn = returnVal2 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1036] return (returnVal2); [L281] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L427] PagingReferenceCount -- [L428] COND TRUE PagingReferenceCount == 0 [L431] return (ntStatus); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L767] status = FloppyPnp(devobj, pirp) [L780] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L781] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L788] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L789] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L796] COND TRUE s != UNLOADED VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L797] COND TRUE status != -1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L798] COND FALSE !(s != SKIP2) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L812] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L813] COND TRUE status != 259 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1627] reach_error() VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] - UnprovableResult [Line: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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: 1627]: 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, 354 locations, 54 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 47, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 12805 SDtfs, 7420 SDslu, 15630 SDs, 0 SdLazy, 3706 SolverSat, 412 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=3, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 46 MinimizatonAttempts, 758 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1211 NumberOfCodeBlocks, 1211 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1123 ConstructedInterpolants, 0 QuantifiedInterpolants, 2843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 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-11-07 02:03:03,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6b5f2cd-2d72-41da-8f7e-d761b1259601/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE