./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/singleton.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/singleton.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan --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 692248c827814d69f794d70185d48fd053222a0c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 07:47:13,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 07:47:13,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 07:47:13,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 07:47:13,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 07:47:13,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 07:47:13,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 07:47:13,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 07:47:13,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 07:47:13,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 07:47:13,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 07:47:13,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 07:47:13,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 07:47:13,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 07:47:13,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 07:47:13,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 07:47:13,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 07:47:13,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 07:47:13,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 07:47:13,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 07:47:13,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 07:47:13,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 07:47:13,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 07:47:13,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 07:47:13,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 07:47:13,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 07:47:13,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 07:47:13,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 07:47:13,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 07:47:13,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 07:47:13,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 07:47:13,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 07:47:13,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 07:47:13,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 07:47:13,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 07:47:13,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 07:47:13,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 07:47:13,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 07:47:13,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 07:47:13,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 07:47:13,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 07:47:13,883 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 07:47:13,904 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 07:47:13,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 07:47:13,905 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 07:47:13,905 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 07:47:13,906 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 07:47:13,906 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 07:47:13,906 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 07:47:13,906 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 07:47:13,906 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 07:47:13,906 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 07:47:13,907 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 07:47:13,907 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 07:47:13,907 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 07:47:13,907 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 07:47:13,907 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 07:47:13,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 07:47:13,908 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 07:47:13,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 07:47:13,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 07:47:13,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 07:47:13,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 07:47:13,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 07:47:13,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 07:47:13,909 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 07:47:13,910 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 07:47:13,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 07:47:13,910 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 07:47:13,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 07:47:13,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 07:47:13,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 07:47:13,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 07:47:13,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 07:47:13,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 07:47:13,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 07:47:13,911 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 07:47:13,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 07:47:13,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 07:47:13,912 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 07:47:13,912 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 07:47:13,912 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-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan/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-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan 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 -> 692248c827814d69f794d70185d48fd053222a0c [2020-12-09 07:47:14,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 07:47:14,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 07:47:14,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 07:47:14,123 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 07:47:14,124 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 07:47:14,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan/../../sv-benchmarks/c/pthread/singleton.i [2020-12-09 07:47:14,165 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan/data/2621f56d0/fd4566513443460098dd7a5243b848eb/FLAGb2fb1cae9 [2020-12-09 07:47:14,574 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 07:47:14,575 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/sv-benchmarks/c/pthread/singleton.i [2020-12-09 07:47:14,590 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan/data/2621f56d0/fd4566513443460098dd7a5243b848eb/FLAGb2fb1cae9 [2020-12-09 07:47:14,959 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan/data/2621f56d0/fd4566513443460098dd7a5243b848eb [2020-12-09 07:47:14,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 07:47:14,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 07:47:14,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 07:47:14,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 07:47:14,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 07:47:14,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:47:14" (1/1) ... [2020-12-09 07:47:14,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26198c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:47:14, skipping insertion in model container [2020-12-09 07:47:14,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:47:14" (1/1) ... [2020-12-09 07:47:14,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 07:47:15,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 07:47:15,153 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-09 07:47:15,289 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-09 07:47:15,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:47:15,305 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 07:47:15,317 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-09 07:47:15,333 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-09 07:47:15,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:47:15,474 INFO L208 MainTranslator]: Completed translation [2020-12-09 07:47:15,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:47:15 WrapperNode [2020-12-09 07:47:15,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 07:47:15,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 07:47:15,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 07:47:15,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 07:47:15,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:47:15" (1/1) ... [2020-12-09 07:47:15,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:47:15" (1/1) ... [2020-12-09 07:47:15,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 07:47:15,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 07:47:15,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 07:47:15,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 07:47:15,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:47:15" (1/1) ... [2020-12-09 07:47:15,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:47:15" (1/1) ... [2020-12-09 07:47:15,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:47:15" (1/1) ... [2020-12-09 07:47:15,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:47:15" (1/1) ... [2020-12-09 07:47:15,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:47:15" (1/1) ... [2020-12-09 07:47:15,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:47:15" (1/1) ... [2020-12-09 07:47:15,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:47:15" (1/1) ... [2020-12-09 07:47:15,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 07:47:15,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 07:47:15,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 07:47:15,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 07:47:15,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:47:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 07:47:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 07:47:15,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 07:47:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 07:47:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 07:47:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 07:47:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-12-09 07:47:15,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-12-09 07:47:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-12-09 07:47:15,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-12-09 07:47:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-12-09 07:47:15,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-12-09 07:47:15,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-12-09 07:47:15,583 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-12-09 07:47:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 07:47:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-09 07:47:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 07:47:15,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 07:47:15,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 07:47:15,584 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 07:47:15,813 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 07:47:15,813 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-09 07:47:15,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:47:15 BoogieIcfgContainer [2020-12-09 07:47:15,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 07:47:15,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 07:47:15,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 07:47:15,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 07:47:15,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:47:14" (1/3) ... [2020-12-09 07:47:15,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f91955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:47:15, skipping insertion in model container [2020-12-09 07:47:15,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:47:15" (2/3) ... [2020-12-09 07:47:15,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f91955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:47:15, skipping insertion in model container [2020-12-09 07:47:15,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:47:15" (3/3) ... [2020-12-09 07:47:15,821 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-12-09 07:47:15,831 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 07:47:15,831 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 07:47:15,834 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 07:47:15,834 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 07:47:15,862 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,862 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,863 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,863 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,863 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,863 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,863 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,863 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,863 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,863 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,864 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,864 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,864 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,864 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,864 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,864 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,864 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,865 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,865 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,865 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,865 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,865 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,865 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,865 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,866 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,866 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,866 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,866 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,866 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,866 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,866 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,866 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,867 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,867 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,867 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,867 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,867 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,867 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,867 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,867 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,868 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,868 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,868 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,868 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,868 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,868 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,869 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,869 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,869 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,869 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,875 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,875 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,875 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,875 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,875 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,876 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,876 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,876 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,876 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,876 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,876 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,876 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,877 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,877 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,877 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,877 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,877 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,877 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,877 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,878 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,878 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,878 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,878 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,878 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,878 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,878 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,879 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,879 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,879 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,879 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,879 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,880 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,880 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,880 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,880 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,880 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,880 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,881 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,881 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,881 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,881 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,881 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,882 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,882 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,882 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,882 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,882 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,882 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,883 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,883 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,883 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,883 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,883 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,883 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,883 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,884 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,884 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,884 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,884 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,884 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,884 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,884 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,884 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,884 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,885 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,885 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,885 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,885 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,885 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,885 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,885 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,886 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,886 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,886 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,886 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,886 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,886 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,886 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,886 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,887 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,887 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,887 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,887 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,887 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,887 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,887 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,888 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,888 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,888 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,888 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,888 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,888 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,888 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,889 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,889 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,889 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,889 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,889 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,889 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,889 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,890 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,890 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,890 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,891 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,891 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,891 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,891 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,891 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,891 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,891 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,892 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,892 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,892 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,892 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,893 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,893 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,893 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,893 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,893 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,893 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,894 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,894 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,894 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,894 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,894 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,895 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,895 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,895 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,895 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,895 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,895 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,895 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,896 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,896 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,896 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,896 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,896 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,896 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,897 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,897 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,897 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,897 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,897 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,897 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,897 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,897 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,898 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,898 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,898 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,898 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,900 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,900 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,900 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,901 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,905 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,905 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,906 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,906 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,908 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,908 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,908 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,908 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,910 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,910 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,910 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,910 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,911 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,911 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,913 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,913 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,913 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,913 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,913 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,913 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,915 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,916 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,916 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,916 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,916 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,916 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,916 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,917 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,919 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,919 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,919 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,919 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,921 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,921 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,921 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,921 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,922 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,922 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,924 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,924 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,924 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,924 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,926 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,926 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,926 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,927 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,928 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,929 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,929 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,929 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,930 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,931 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,931 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:15,931 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 07:47:16,013 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2020-12-09 07:47:16,024 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-12-09 07:47:16,041 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 07:47:16,041 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 07:47:16,041 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 07:47:16,042 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 07:47:16,042 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 07:47:16,042 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 07:47:16,042 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 07:47:16,042 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 07:47:16,058 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 07:47:16,060 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-09 07:47:16,063 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-09 07:47:16,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 248 transitions, 876 flow [2020-12-09 07:47:16,154 INFO L129 PetriNetUnfolder]: 61/274 cut-off events. [2020-12-09 07:47:16,154 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-12-09 07:47:16,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 274 events. 61/274 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 804 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 330. Up to 24 conditions per place. [2020-12-09 07:47:16,175 INFO L116 LiptonReduction]: Number of co-enabled transitions 4156 [2020-12-09 07:47:19,068 INFO L131 LiptonReduction]: Checked pairs total: 49018 [2020-12-09 07:47:19,068 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-12-09 07:47:19,072 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 173 transitions, 726 flow [2020-12-09 07:47:19,388 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-12-09 07:47:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-12-09 07:47:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 07:47:19,393 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:19,393 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:19,393 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:19,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1391244601, now seen corresponding path program 1 times [2020-12-09 07:47:19,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:19,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037547284] [2020-12-09 07:47:19,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:19,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037547284] [2020-12-09 07:47:19,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:19,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:47:19,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941348977] [2020-12-09 07:47:19,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:47:19,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:19,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:47:19,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:47:19,636 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-12-09 07:47:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:19,888 INFO L93 Difference]: Finished difference Result 6012 states and 25679 transitions. [2020-12-09 07:47:19,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:47:19,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-09 07:47:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:19,945 INFO L225 Difference]: With dead ends: 6012 [2020-12-09 07:47:19,945 INFO L226 Difference]: Without dead ends: 5524 [2020-12-09 07:47:19,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:47:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2020-12-09 07:47:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 3018. [2020-12-09 07:47:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-12-09 07:47:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-12-09 07:47:20,121 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-12-09 07:47:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:20,121 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-12-09 07:47:20,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:47:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-12-09 07:47:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 07:47:20,122 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:20,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:20,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 07:47:20,122 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:20,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1473766845, now seen corresponding path program 2 times [2020-12-09 07:47:20,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:20,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855727567] [2020-12-09 07:47:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:20,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855727567] [2020-12-09 07:47:20,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:20,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:47:20,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908662263] [2020-12-09 07:47:20,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:47:20,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:47:20,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:47:20,186 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-12-09 07:47:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:20,370 INFO L93 Difference]: Finished difference Result 4266 states and 18042 transitions. [2020-12-09 07:47:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 07:47:20,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-09 07:47:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:20,413 INFO L225 Difference]: With dead ends: 4266 [2020-12-09 07:47:20,413 INFO L226 Difference]: Without dead ends: 4266 [2020-12-09 07:47:20,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:47:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2020-12-09 07:47:20,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 3008. [2020-12-09 07:47:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-12-09 07:47:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-12-09 07:47:20,538 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-12-09 07:47:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:20,538 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-12-09 07:47:20,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:47:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-12-09 07:47:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 07:47:20,540 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:20,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:20,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 07:47:20,540 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:20,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:20,541 INFO L82 PathProgramCache]: Analyzing trace with hash -658761216, now seen corresponding path program 1 times [2020-12-09 07:47:20,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:20,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202820477] [2020-12-09 07:47:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:20,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202820477] [2020-12-09 07:47:20,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:20,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:47:20,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900198032] [2020-12-09 07:47:20,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:47:20,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:20,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:47:20,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:47:20,586 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-12-09 07:47:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:20,657 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-12-09 07:47:20,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:47:20,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-09 07:47:20,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:20,680 INFO L225 Difference]: With dead ends: 4848 [2020-12-09 07:47:20,681 INFO L226 Difference]: Without dead ends: 3558 [2020-12-09 07:47:20,681 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:47:20,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-12-09 07:47:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-12-09 07:47:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-12-09 07:47:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-12-09 07:47:20,802 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-12-09 07:47:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:20,803 INFO L481 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-12-09 07:47:20,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:47:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-12-09 07:47:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 07:47:20,805 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:20,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:20,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 07:47:20,805 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:20,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:20,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1053238145, now seen corresponding path program 1 times [2020-12-09 07:47:20,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:20,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106863586] [2020-12-09 07:47:20,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:20,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106863586] [2020-12-09 07:47:20,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:20,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:47:20,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582279886] [2020-12-09 07:47:20,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:47:20,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:20,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:47:20,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:47:20,888 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-12-09 07:47:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:21,057 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-12-09 07:47:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 07:47:21,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-09 07:47:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:21,069 INFO L225 Difference]: With dead ends: 4417 [2020-12-09 07:47:21,070 INFO L226 Difference]: Without dead ends: 4393 [2020-12-09 07:47:21,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:47:21,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-12-09 07:47:21,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-12-09 07:47:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-12-09 07:47:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-12-09 07:47:21,175 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-12-09 07:47:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:21,175 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-12-09 07:47:21,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:47:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-12-09 07:47:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 07:47:21,177 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:21,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:21,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 07:47:21,178 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1471262403, now seen corresponding path program 2 times [2020-12-09 07:47:21,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:21,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413409801] [2020-12-09 07:47:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:21,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413409801] [2020-12-09 07:47:21,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:21,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:47:21,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874393812] [2020-12-09 07:47:21,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:47:21,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:21,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:47:21,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:47:21,243 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-12-09 07:47:21,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:21,329 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-12-09 07:47:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:47:21,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-09 07:47:21,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:21,342 INFO L225 Difference]: With dead ends: 4024 [2020-12-09 07:47:21,342 INFO L226 Difference]: Without dead ends: 4024 [2020-12-09 07:47:21,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:47:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-12-09 07:47:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-12-09 07:47:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-12-09 07:47:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-12-09 07:47:21,464 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-12-09 07:47:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:21,464 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-12-09 07:47:21,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:47:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-12-09 07:47:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 07:47:21,466 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:21,466 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:21,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 07:47:21,466 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:21,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:21,467 INFO L82 PathProgramCache]: Analyzing trace with hash -564581282, now seen corresponding path program 1 times [2020-12-09 07:47:21,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:21,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724680569] [2020-12-09 07:47:21,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:21,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724680569] [2020-12-09 07:47:21,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:21,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:47:21,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530224838] [2020-12-09 07:47:21,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:47:21,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:21,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:47:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:47:21,528 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-12-09 07:47:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:21,683 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-12-09 07:47:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 07:47:21,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-09 07:47:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:21,696 INFO L225 Difference]: With dead ends: 4225 [2020-12-09 07:47:21,696 INFO L226 Difference]: Without dead ends: 4129 [2020-12-09 07:47:21,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:47:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-12-09 07:47:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-12-09 07:47:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-12-09 07:47:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-12-09 07:47:21,792 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-12-09 07:47:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:21,792 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-12-09 07:47:21,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:47:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-12-09 07:47:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 07:47:21,794 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:21,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:21,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 07:47:21,794 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:21,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:21,794 INFO L82 PathProgramCache]: Analyzing trace with hash -490731172, now seen corresponding path program 2 times [2020-12-09 07:47:21,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:21,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550720837] [2020-12-09 07:47:21,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:21,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550720837] [2020-12-09 07:47:21,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:21,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 07:47:21,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723586936] [2020-12-09 07:47:21,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 07:47:21,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:21,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 07:47:21,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:47:21,890 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2020-12-09 07:47:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:22,159 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-12-09 07:47:22,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 07:47:22,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-09 07:47:22,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:22,170 INFO L225 Difference]: With dead ends: 4979 [2020-12-09 07:47:22,170 INFO L226 Difference]: Without dead ends: 4905 [2020-12-09 07:47:22,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-09 07:47:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-12-09 07:47:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-12-09 07:47:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-09 07:47:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-12-09 07:47:22,282 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-12-09 07:47:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:22,282 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-12-09 07:47:22,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 07:47:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-12-09 07:47:22,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 07:47:22,283 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:22,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:22,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 07:47:22,284 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:22,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:22,284 INFO L82 PathProgramCache]: Analyzing trace with hash 991975414, now seen corresponding path program 3 times [2020-12-09 07:47:22,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:22,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552892663] [2020-12-09 07:47:22,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:22,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552892663] [2020-12-09 07:47:22,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:22,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 07:47:22,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234405293] [2020-12-09 07:47:22,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 07:47:22,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:22,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 07:47:22,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:47:22,397 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2020-12-09 07:47:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:22,718 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-12-09 07:47:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 07:47:22,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-09 07:47:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:22,731 INFO L225 Difference]: With dead ends: 6735 [2020-12-09 07:47:22,731 INFO L226 Difference]: Without dead ends: 6661 [2020-12-09 07:47:22,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-12-09 07:47:22,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-12-09 07:47:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-12-09 07:47:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-12-09 07:47:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-12-09 07:47:22,826 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-12-09 07:47:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:22,827 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-12-09 07:47:22,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 07:47:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-12-09 07:47:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 07:47:22,828 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:22,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:22,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 07:47:22,828 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:22,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:22,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1869283970, now seen corresponding path program 4 times [2020-12-09 07:47:22,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:22,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560925938] [2020-12-09 07:47:22,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:22,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560925938] [2020-12-09 07:47:22,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:22,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 07:47:22,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13113099] [2020-12-09 07:47:22,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 07:47:22,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:22,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 07:47:22,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:47:22,907 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 9 states. [2020-12-09 07:47:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:23,143 INFO L93 Difference]: Finished difference Result 5385 states and 21914 transitions. [2020-12-09 07:47:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:47:23,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-09 07:47:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:23,153 INFO L225 Difference]: With dead ends: 5385 [2020-12-09 07:47:23,153 INFO L226 Difference]: Without dead ends: 5311 [2020-12-09 07:47:23,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:47:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2020-12-09 07:47:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4125. [2020-12-09 07:47:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2020-12-09 07:47:23,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 16604 transitions. [2020-12-09 07:47:23,231 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 16604 transitions. Word has length 18 [2020-12-09 07:47:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:23,232 INFO L481 AbstractCegarLoop]: Abstraction has 4125 states and 16604 transitions. [2020-12-09 07:47:23,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 07:47:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 16604 transitions. [2020-12-09 07:47:23,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 07:47:23,245 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:23,245 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:23,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 07:47:23,245 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:23,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:23,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1339896726, now seen corresponding path program 5 times [2020-12-09 07:47:23,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:23,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326931475] [2020-12-09 07:47:23,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:23,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326931475] [2020-12-09 07:47:23,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:23,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-09 07:47:23,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270480941] [2020-12-09 07:47:23,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 07:47:23,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:23,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 07:47:23,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:47:23,425 INFO L87 Difference]: Start difference. First operand 4125 states and 16604 transitions. Second operand 11 states. [2020-12-09 07:47:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:23,923 INFO L93 Difference]: Finished difference Result 5686 states and 23415 transitions. [2020-12-09 07:47:23,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 07:47:23,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-12-09 07:47:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:23,935 INFO L225 Difference]: With dead ends: 5686 [2020-12-09 07:47:23,935 INFO L226 Difference]: Without dead ends: 5630 [2020-12-09 07:47:23,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-09 07:47:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2020-12-09 07:47:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4116. [2020-12-09 07:47:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2020-12-09 07:47:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2020-12-09 07:47:24,035 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2020-12-09 07:47:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:24,035 INFO L481 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2020-12-09 07:47:24,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 07:47:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2020-12-09 07:47:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 07:47:24,037 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:24,037 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:24,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 07:47:24,037 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:24,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1845549347, now seen corresponding path program 1 times [2020-12-09 07:47:24,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:24,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854246421] [2020-12-09 07:47:24,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:24,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854246421] [2020-12-09 07:47:24,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:24,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:47:24,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025290667] [2020-12-09 07:47:24,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:47:24,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:24,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:47:24,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:47:24,084 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 6 states. [2020-12-09 07:47:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:24,191 INFO L93 Difference]: Finished difference Result 4687 states and 18325 transitions. [2020-12-09 07:47:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:47:24,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-09 07:47:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:24,201 INFO L225 Difference]: With dead ends: 4687 [2020-12-09 07:47:24,201 INFO L226 Difference]: Without dead ends: 4687 [2020-12-09 07:47:24,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:47:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-09 07:47:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4131. [2020-12-09 07:47:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-09 07:47:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16621 transitions. [2020-12-09 07:47:24,298 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16621 transitions. Word has length 19 [2020-12-09 07:47:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:24,299 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16621 transitions. [2020-12-09 07:47:24,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:47:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16621 transitions. [2020-12-09 07:47:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 07:47:24,301 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:24,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:24,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 07:47:24,301 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:24,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:24,301 INFO L82 PathProgramCache]: Analyzing trace with hash 838752707, now seen corresponding path program 2 times [2020-12-09 07:47:24,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:24,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624727573] [2020-12-09 07:47:24,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:24,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624727573] [2020-12-09 07:47:24,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:24,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 07:47:24,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359814055] [2020-12-09 07:47:24,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 07:47:24,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:24,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 07:47:24,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:47:24,378 INFO L87 Difference]: Start difference. First operand 4131 states and 16621 transitions. Second operand 7 states. [2020-12-09 07:47:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:24,483 INFO L93 Difference]: Finished difference Result 4619 states and 18100 transitions. [2020-12-09 07:47:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:47:24,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-12-09 07:47:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:24,492 INFO L225 Difference]: With dead ends: 4619 [2020-12-09 07:47:24,492 INFO L226 Difference]: Without dead ends: 4619 [2020-12-09 07:47:24,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:47:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2020-12-09 07:47:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4078. [2020-12-09 07:47:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2020-12-09 07:47:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2020-12-09 07:47:24,570 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2020-12-09 07:47:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:24,571 INFO L481 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2020-12-09 07:47:24,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 07:47:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2020-12-09 07:47:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 07:47:24,573 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:24,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:24,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-09 07:47:24,573 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:24,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:24,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1368539430, now seen corresponding path program 1 times [2020-12-09 07:47:24,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:24,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212807439] [2020-12-09 07:47:24,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:24,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212807439] [2020-12-09 07:47:24,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:24,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 07:47:24,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31028328] [2020-12-09 07:47:24,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 07:47:24,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:24,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 07:47:24,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:47:24,707 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 10 states. [2020-12-09 07:47:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:25,096 INFO L93 Difference]: Finished difference Result 5300 states and 21612 transitions. [2020-12-09 07:47:25,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 07:47:25,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-12-09 07:47:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:25,106 INFO L225 Difference]: With dead ends: 5300 [2020-12-09 07:47:25,106 INFO L226 Difference]: Without dead ends: 5226 [2020-12-09 07:47:25,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-12-09 07:47:25,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2020-12-09 07:47:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 4066. [2020-12-09 07:47:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2020-12-09 07:47:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 16392 transitions. [2020-12-09 07:47:25,192 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 16392 transitions. Word has length 19 [2020-12-09 07:47:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:25,192 INFO L481 AbstractCegarLoop]: Abstraction has 4066 states and 16392 transitions. [2020-12-09 07:47:25,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 07:47:25,193 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 16392 transitions. [2020-12-09 07:47:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 07:47:25,194 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:25,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:25,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-09 07:47:25,195 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:25,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:25,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1392670140, now seen corresponding path program 2 times [2020-12-09 07:47:25,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:25,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688221773] [2020-12-09 07:47:25,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:25,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688221773] [2020-12-09 07:47:25,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:25,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 07:47:25,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731655508] [2020-12-09 07:47:25,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 07:47:25,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:25,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 07:47:25,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:47:25,376 INFO L87 Difference]: Start difference. First operand 4066 states and 16392 transitions. Second operand 12 states. [2020-12-09 07:47:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:25,942 INFO L93 Difference]: Finished difference Result 5713 states and 23638 transitions. [2020-12-09 07:47:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 07:47:25,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-12-09 07:47:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:25,953 INFO L225 Difference]: With dead ends: 5713 [2020-12-09 07:47:25,953 INFO L226 Difference]: Without dead ends: 5651 [2020-12-09 07:47:25,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2020-12-09 07:47:25,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2020-12-09 07:47:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 4021. [2020-12-09 07:47:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2020-12-09 07:47:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 16226 transitions. [2020-12-09 07:47:26,031 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 16226 transitions. Word has length 19 [2020-12-09 07:47:26,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:26,031 INFO L481 AbstractCegarLoop]: Abstraction has 4021 states and 16226 transitions. [2020-12-09 07:47:26,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 07:47:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 16226 transitions. [2020-12-09 07:47:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 07:47:26,033 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:26,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:26,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-09 07:47:26,033 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:26,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:26,034 INFO L82 PathProgramCache]: Analyzing trace with hash -638770199, now seen corresponding path program 1 times [2020-12-09 07:47:26,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:26,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087110417] [2020-12-09 07:47:26,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:26,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087110417] [2020-12-09 07:47:26,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:26,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 07:47:26,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908498613] [2020-12-09 07:47:26,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 07:47:26,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:26,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 07:47:26,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:47:26,080 INFO L87 Difference]: Start difference. First operand 4021 states and 16226 transitions. Second operand 8 states. [2020-12-09 07:47:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:26,255 INFO L93 Difference]: Finished difference Result 6240 states and 25278 transitions. [2020-12-09 07:47:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 07:47:26,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-09 07:47:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:26,266 INFO L225 Difference]: With dead ends: 6240 [2020-12-09 07:47:26,266 INFO L226 Difference]: Without dead ends: 6194 [2020-12-09 07:47:26,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-12-09 07:47:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6194 states. [2020-12-09 07:47:26,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6194 to 4020. [2020-12-09 07:47:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2020-12-09 07:47:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 16225 transitions. [2020-12-09 07:47:26,347 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 16225 transitions. Word has length 20 [2020-12-09 07:47:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:26,348 INFO L481 AbstractCegarLoop]: Abstraction has 4020 states and 16225 transitions. [2020-12-09 07:47:26,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 07:47:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 16225 transitions. [2020-12-09 07:47:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 07:47:26,349 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:26,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:26,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-09 07:47:26,350 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:26,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:26,350 INFO L82 PathProgramCache]: Analyzing trace with hash -78568143, now seen corresponding path program 2 times [2020-12-09 07:47:26,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:26,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636513054] [2020-12-09 07:47:26,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:26,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636513054] [2020-12-09 07:47:26,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:26,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 07:47:26,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704647080] [2020-12-09 07:47:26,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 07:47:26,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:26,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 07:47:26,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:47:26,400 INFO L87 Difference]: Start difference. First operand 4020 states and 16225 transitions. Second operand 8 states. [2020-12-09 07:47:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:26,547 INFO L93 Difference]: Finished difference Result 5057 states and 20246 transitions. [2020-12-09 07:47:26,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:47:26,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-09 07:47:26,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:26,557 INFO L225 Difference]: With dead ends: 5057 [2020-12-09 07:47:26,557 INFO L226 Difference]: Without dead ends: 5011 [2020-12-09 07:47:26,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:47:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2020-12-09 07:47:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 4017. [2020-12-09 07:47:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4017 states. [2020-12-09 07:47:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 16218 transitions. [2020-12-09 07:47:26,627 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 16218 transitions. Word has length 20 [2020-12-09 07:47:26,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:26,628 INFO L481 AbstractCegarLoop]: Abstraction has 4017 states and 16218 transitions. [2020-12-09 07:47:26,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 07:47:26,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 16218 transitions. [2020-12-09 07:47:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 07:47:26,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:26,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:26,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-09 07:47:26,629 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:26,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:26,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1686883325, now seen corresponding path program 3 times [2020-12-09 07:47:26,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:26,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050666994] [2020-12-09 07:47:26,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:26,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050666994] [2020-12-09 07:47:26,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:26,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 07:47:26,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78356930] [2020-12-09 07:47:26,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 07:47:26,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:26,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 07:47:26,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:47:26,761 INFO L87 Difference]: Start difference. First operand 4017 states and 16218 transitions. Second operand 9 states. [2020-12-09 07:47:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:27,050 INFO L93 Difference]: Finished difference Result 5047 states and 20222 transitions. [2020-12-09 07:47:27,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 07:47:27,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-12-09 07:47:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:27,059 INFO L225 Difference]: With dead ends: 5047 [2020-12-09 07:47:27,059 INFO L226 Difference]: Without dead ends: 5001 [2020-12-09 07:47:27,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-12-09 07:47:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2020-12-09 07:47:27,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4010. [2020-12-09 07:47:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4010 states. [2020-12-09 07:47:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 16199 transitions. [2020-12-09 07:47:27,129 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 16199 transitions. Word has length 20 [2020-12-09 07:47:27,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:27,129 INFO L481 AbstractCegarLoop]: Abstraction has 4010 states and 16199 transitions. [2020-12-09 07:47:27,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 07:47:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 16199 transitions. [2020-12-09 07:47:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 07:47:27,131 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:27,131 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:27,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-09 07:47:27,131 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:27,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:27,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1644928641, now seen corresponding path program 4 times [2020-12-09 07:47:27,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:27,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343168801] [2020-12-09 07:47:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:27,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343168801] [2020-12-09 07:47:27,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:27,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-09 07:47:27,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906287220] [2020-12-09 07:47:27,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 07:47:27,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:27,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 07:47:27,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:47:27,280 INFO L87 Difference]: Start difference. First operand 4010 states and 16199 transitions. Second operand 11 states. [2020-12-09 07:47:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:27,699 INFO L93 Difference]: Finished difference Result 5545 states and 22382 transitions. [2020-12-09 07:47:27,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 07:47:27,699 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-09 07:47:27,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:27,709 INFO L225 Difference]: With dead ends: 5545 [2020-12-09 07:47:27,709 INFO L226 Difference]: Without dead ends: 5499 [2020-12-09 07:47:27,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-12-09 07:47:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2020-12-09 07:47:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4140. [2020-12-09 07:47:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-09 07:47:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16867 transitions. [2020-12-09 07:47:27,781 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16867 transitions. Word has length 20 [2020-12-09 07:47:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:27,781 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16867 transitions. [2020-12-09 07:47:27,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 07:47:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16867 transitions. [2020-12-09 07:47:27,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 07:47:27,783 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:27,784 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:27,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-09 07:47:27,784 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:27,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:27,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1818104208, now seen corresponding path program 1 times [2020-12-09 07:47:27,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:27,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999297847] [2020-12-09 07:47:27,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:27,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999297847] [2020-12-09 07:47:27,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:27,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-09 07:47:27,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798252079] [2020-12-09 07:47:27,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 07:47:27,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:27,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 07:47:27,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:47:27,974 INFO L87 Difference]: Start difference. First operand 4140 states and 16867 transitions. Second operand 11 states. [2020-12-09 07:47:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:28,579 INFO L93 Difference]: Finished difference Result 6397 states and 25724 transitions. [2020-12-09 07:47:28,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 07:47:28,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-09 07:47:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:28,593 INFO L225 Difference]: With dead ends: 6397 [2020-12-09 07:47:28,594 INFO L226 Difference]: Without dead ends: 6351 [2020-12-09 07:47:28,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-09 07:47:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6351 states. [2020-12-09 07:47:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6351 to 4140. [2020-12-09 07:47:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-09 07:47:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16868 transitions. [2020-12-09 07:47:28,690 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16868 transitions. Word has length 20 [2020-12-09 07:47:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:28,690 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16868 transitions. [2020-12-09 07:47:28,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 07:47:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16868 transitions. [2020-12-09 07:47:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 07:47:28,693 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:28,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:28,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-09 07:47:28,693 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:28,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1599554532, now seen corresponding path program 2 times [2020-12-09 07:47:28,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:28,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249310767] [2020-12-09 07:47:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:28,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249310767] [2020-12-09 07:47:28,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:28,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-09 07:47:28,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243772276] [2020-12-09 07:47:28,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 07:47:28,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:28,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 07:47:28,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:47:28,826 INFO L87 Difference]: Start difference. First operand 4140 states and 16868 transitions. Second operand 11 states. [2020-12-09 07:47:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:29,290 INFO L93 Difference]: Finished difference Result 5409 states and 21869 transitions. [2020-12-09 07:47:29,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 07:47:29,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-09 07:47:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:29,300 INFO L225 Difference]: With dead ends: 5409 [2020-12-09 07:47:29,300 INFO L226 Difference]: Without dead ends: 5363 [2020-12-09 07:47:29,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-12-09 07:47:29,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2020-12-09 07:47:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 4142. [2020-12-09 07:47:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4142 states. [2020-12-09 07:47:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 16874 transitions. [2020-12-09 07:47:29,370 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 16874 transitions. Word has length 20 [2020-12-09 07:47:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:29,371 INFO L481 AbstractCegarLoop]: Abstraction has 4142 states and 16874 transitions. [2020-12-09 07:47:29,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 07:47:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 16874 transitions. [2020-12-09 07:47:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 07:47:29,372 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:29,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:29,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-09 07:47:29,372 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:29,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:29,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1117675172, now seen corresponding path program 3 times [2020-12-09 07:47:29,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:29,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161941186] [2020-12-09 07:47:29,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:29,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161941186] [2020-12-09 07:47:29,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:29,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 07:47:29,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118212637] [2020-12-09 07:47:29,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 07:47:29,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:29,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 07:47:29,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:47:29,479 INFO L87 Difference]: Start difference. First operand 4142 states and 16874 transitions. Second operand 10 states. [2020-12-09 07:47:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:29,863 INFO L93 Difference]: Finished difference Result 6189 states and 24832 transitions. [2020-12-09 07:47:29,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 07:47:29,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-09 07:47:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:29,874 INFO L225 Difference]: With dead ends: 6189 [2020-12-09 07:47:29,874 INFO L226 Difference]: Without dead ends: 6143 [2020-12-09 07:47:29,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-12-09 07:47:29,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2020-12-09 07:47:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 4141. [2020-12-09 07:47:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4141 states. [2020-12-09 07:47:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 16873 transitions. [2020-12-09 07:47:29,952 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 16873 transitions. Word has length 20 [2020-12-09 07:47:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:29,953 INFO L481 AbstractCegarLoop]: Abstraction has 4141 states and 16873 transitions. [2020-12-09 07:47:29,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 07:47:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 16873 transitions. [2020-12-09 07:47:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 07:47:29,954 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:29,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:29,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-09 07:47:29,954 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:29,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash -240366616, now seen corresponding path program 4 times [2020-12-09 07:47:29,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:29,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059858013] [2020-12-09 07:47:29,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:30,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059858013] [2020-12-09 07:47:30,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:30,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 07:47:30,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862706094] [2020-12-09 07:47:30,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 07:47:30,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:30,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 07:47:30,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:47:30,047 INFO L87 Difference]: Start difference. First operand 4141 states and 16873 transitions. Second operand 10 states. [2020-12-09 07:47:30,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:30,303 INFO L93 Difference]: Finished difference Result 5246 states and 21125 transitions. [2020-12-09 07:47:30,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 07:47:30,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-09 07:47:30,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:30,313 INFO L225 Difference]: With dead ends: 5246 [2020-12-09 07:47:30,313 INFO L226 Difference]: Without dead ends: 5200 [2020-12-09 07:47:30,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-12-09 07:47:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2020-12-09 07:47:30,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 3983. [2020-12-09 07:47:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2020-12-09 07:47:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 16133 transitions. [2020-12-09 07:47:30,382 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 16133 transitions. Word has length 20 [2020-12-09 07:47:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:30,382 INFO L481 AbstractCegarLoop]: Abstraction has 3983 states and 16133 transitions. [2020-12-09 07:47:30,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 07:47:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 16133 transitions. [2020-12-09 07:47:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 07:47:30,383 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:30,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:30,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-09 07:47:30,384 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:30,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:30,384 INFO L82 PathProgramCache]: Analyzing trace with hash -565771751, now seen corresponding path program 1 times [2020-12-09 07:47:30,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:30,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626564528] [2020-12-09 07:47:30,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:30,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626564528] [2020-12-09 07:47:30,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:30,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:47:30,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078176233] [2020-12-09 07:47:30,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:47:30,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:30,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:47:30,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:47:30,413 INFO L87 Difference]: Start difference. First operand 3983 states and 16133 transitions. Second operand 6 states. [2020-12-09 07:47:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:30,540 INFO L93 Difference]: Finished difference Result 4762 states and 18800 transitions. [2020-12-09 07:47:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 07:47:30,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-09 07:47:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:30,552 INFO L225 Difference]: With dead ends: 4762 [2020-12-09 07:47:30,552 INFO L226 Difference]: Without dead ends: 4687 [2020-12-09 07:47:30,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:47:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-09 07:47:30,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4305. [2020-12-09 07:47:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2020-12-09 07:47:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 17320 transitions. [2020-12-09 07:47:30,627 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 17320 transitions. Word has length 21 [2020-12-09 07:47:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:30,627 INFO L481 AbstractCegarLoop]: Abstraction has 4305 states and 17320 transitions. [2020-12-09 07:47:30,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:47:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 17320 transitions. [2020-12-09 07:47:30,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 07:47:30,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:30,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:30,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-09 07:47:30,629 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:30,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:30,630 INFO L82 PathProgramCache]: Analyzing trace with hash 479599707, now seen corresponding path program 2 times [2020-12-09 07:47:30,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:30,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099127057] [2020-12-09 07:47:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:30,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:30,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099127057] [2020-12-09 07:47:30,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:30,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:47:30,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049012785] [2020-12-09 07:47:30,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:47:30,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:30,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:47:30,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:47:30,661 INFO L87 Difference]: Start difference. First operand 4305 states and 17320 transitions. Second operand 6 states. [2020-12-09 07:47:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:30,753 INFO L93 Difference]: Finished difference Result 5233 states and 20429 transitions. [2020-12-09 07:47:30,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:47:30,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-09 07:47:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:30,765 INFO L225 Difference]: With dead ends: 5233 [2020-12-09 07:47:30,765 INFO L226 Difference]: Without dead ends: 4707 [2020-12-09 07:47:30,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:47:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4707 states. [2020-12-09 07:47:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4707 to 3933. [2020-12-09 07:47:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3933 states. [2020-12-09 07:47:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 15536 transitions. [2020-12-09 07:47:30,848 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 15536 transitions. Word has length 21 [2020-12-09 07:47:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:30,848 INFO L481 AbstractCegarLoop]: Abstraction has 3933 states and 15536 transitions. [2020-12-09 07:47:30,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:47:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 15536 transitions. [2020-12-09 07:47:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 07:47:30,850 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:30,850 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:30,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-09 07:47:30,850 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:30,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:30,850 INFO L82 PathProgramCache]: Analyzing trace with hash -586116813, now seen corresponding path program 1 times [2020-12-09 07:47:30,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:30,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601223500] [2020-12-09 07:47:30,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:30,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601223500] [2020-12-09 07:47:30,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:30,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 07:47:30,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775071231] [2020-12-09 07:47:30,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 07:47:30,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:30,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 07:47:30,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:47:30,972 INFO L87 Difference]: Start difference. First operand 3933 states and 15536 transitions. Second operand 10 states. [2020-12-09 07:47:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:31,373 INFO L93 Difference]: Finished difference Result 4734 states and 18567 transitions. [2020-12-09 07:47:31,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 07:47:31,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-12-09 07:47:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:31,381 INFO L225 Difference]: With dead ends: 4734 [2020-12-09 07:47:31,381 INFO L226 Difference]: Without dead ends: 4685 [2020-12-09 07:47:31,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-09 07:47:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2020-12-09 07:47:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 3841. [2020-12-09 07:47:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2020-12-09 07:47:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 15162 transitions. [2020-12-09 07:47:31,442 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 15162 transitions. Word has length 21 [2020-12-09 07:47:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:31,443 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 15162 transitions. [2020-12-09 07:47:31,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 07:47:31,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 15162 transitions. [2020-12-09 07:47:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 07:47:31,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:31,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:31,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-09 07:47:31,444 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:31,445 INFO L82 PathProgramCache]: Analyzing trace with hash -757352757, now seen corresponding path program 1 times [2020-12-09 07:47:31,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:31,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160641449] [2020-12-09 07:47:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:31,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160641449] [2020-12-09 07:47:31,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:31,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 07:47:31,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682838323] [2020-12-09 07:47:31,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 07:47:31,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:31,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 07:47:31,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:47:31,659 INFO L87 Difference]: Start difference. First operand 3841 states and 15162 transitions. Second operand 12 states. [2020-12-09 07:47:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:32,305 INFO L93 Difference]: Finished difference Result 5118 states and 20406 transitions. [2020-12-09 07:47:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 07:47:32,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-09 07:47:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:32,313 INFO L225 Difference]: With dead ends: 5118 [2020-12-09 07:47:32,314 INFO L226 Difference]: Without dead ends: 4964 [2020-12-09 07:47:32,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2020-12-09 07:47:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4964 states. [2020-12-09 07:47:32,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4964 to 3443. [2020-12-09 07:47:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2020-12-09 07:47:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 13378 transitions. [2020-12-09 07:47:32,372 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 13378 transitions. Word has length 21 [2020-12-09 07:47:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:32,372 INFO L481 AbstractCegarLoop]: Abstraction has 3443 states and 13378 transitions. [2020-12-09 07:47:32,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 07:47:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 13378 transitions. [2020-12-09 07:47:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 07:47:32,374 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:32,374 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:32,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-09 07:47:32,374 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:32,374 INFO L82 PathProgramCache]: Analyzing trace with hash 820571943, now seen corresponding path program 2 times [2020-12-09 07:47:32,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:32,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679828145] [2020-12-09 07:47:32,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:32,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679828145] [2020-12-09 07:47:32,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:32,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 07:47:32,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207791133] [2020-12-09 07:47:32,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 07:47:32,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:32,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 07:47:32,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:47:32,539 INFO L87 Difference]: Start difference. First operand 3443 states and 13378 transitions. Second operand 12 states. [2020-12-09 07:47:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:32,896 INFO L93 Difference]: Finished difference Result 4562 states and 17491 transitions. [2020-12-09 07:47:32,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 07:47:32,896 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-09 07:47:32,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:32,903 INFO L225 Difference]: With dead ends: 4562 [2020-12-09 07:47:32,903 INFO L226 Difference]: Without dead ends: 4510 [2020-12-09 07:47:32,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-09 07:47:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2020-12-09 07:47:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 3368. [2020-12-09 07:47:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3368 states. [2020-12-09 07:47:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 12841 transitions. [2020-12-09 07:47:32,967 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 12841 transitions. Word has length 21 [2020-12-09 07:47:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:32,967 INFO L481 AbstractCegarLoop]: Abstraction has 3368 states and 12841 transitions. [2020-12-09 07:47:32,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 07:47:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 12841 transitions. [2020-12-09 07:47:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 07:47:32,968 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:32,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:32,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-09 07:47:32,969 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:32,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:32,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1673753334, now seen corresponding path program 1 times [2020-12-09 07:47:32,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:32,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468571104] [2020-12-09 07:47:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:33,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468571104] [2020-12-09 07:47:33,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:33,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 07:47:33,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547014943] [2020-12-09 07:47:33,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 07:47:33,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:33,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 07:47:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:47:33,014 INFO L87 Difference]: Start difference. First operand 3368 states and 12841 transitions. Second operand 7 states. [2020-12-09 07:47:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:33,090 INFO L93 Difference]: Finished difference Result 3879 states and 14497 transitions. [2020-12-09 07:47:33,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:47:33,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-09 07:47:33,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:33,096 INFO L225 Difference]: With dead ends: 3879 [2020-12-09 07:47:33,096 INFO L226 Difference]: Without dead ends: 3785 [2020-12-09 07:47:33,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:47:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2020-12-09 07:47:33,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3369. [2020-12-09 07:47:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3369 states. [2020-12-09 07:47:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 12845 transitions. [2020-12-09 07:47:33,153 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 12845 transitions. Word has length 21 [2020-12-09 07:47:33,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:33,153 INFO L481 AbstractCegarLoop]: Abstraction has 3369 states and 12845 transitions. [2020-12-09 07:47:33,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 07:47:33,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 12845 transitions. [2020-12-09 07:47:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 07:47:33,154 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:33,154 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:33,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-09 07:47:33,155 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:33,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:33,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1208728268, now seen corresponding path program 1 times [2020-12-09 07:47:33,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:33,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320668821] [2020-12-09 07:47:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:33,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320668821] [2020-12-09 07:47:33,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:33,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-09 07:47:33,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204351106] [2020-12-09 07:47:33,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 07:47:33,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:33,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 07:47:33,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:47:33,318 INFO L87 Difference]: Start difference. First operand 3369 states and 12845 transitions. Second operand 11 states. [2020-12-09 07:47:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:33,827 INFO L93 Difference]: Finished difference Result 4138 states and 15694 transitions. [2020-12-09 07:47:33,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 07:47:33,828 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-12-09 07:47:33,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:33,835 INFO L225 Difference]: With dead ends: 4138 [2020-12-09 07:47:33,835 INFO L226 Difference]: Without dead ends: 4089 [2020-12-09 07:47:33,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-12-09 07:47:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2020-12-09 07:47:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 3004. [2020-12-09 07:47:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2020-12-09 07:47:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 11303 transitions. [2020-12-09 07:47:33,885 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 11303 transitions. Word has length 21 [2020-12-09 07:47:33,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:33,885 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 11303 transitions. [2020-12-09 07:47:33,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 07:47:33,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 11303 transitions. [2020-12-09 07:47:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 07:47:33,887 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:33,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:47:33,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-09 07:47:33,887 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash 172061386, now seen corresponding path program 2 times [2020-12-09 07:47:33,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:33,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104027783] [2020-12-09 07:47:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:33,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104027783] [2020-12-09 07:47:33,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:33,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 07:47:33,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856619224] [2020-12-09 07:47:33,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 07:47:33,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:33,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 07:47:33,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:47:33,953 INFO L87 Difference]: Start difference. First operand 3004 states and 11303 transitions. Second operand 8 states. [2020-12-09 07:47:34,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:34,047 INFO L93 Difference]: Finished difference Result 3058 states and 11357 transitions. [2020-12-09 07:47:34,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:47:34,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-12-09 07:47:34,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:34,052 INFO L225 Difference]: With dead ends: 3058 [2020-12-09 07:47:34,052 INFO L226 Difference]: Without dead ends: 3058 [2020-12-09 07:47:34,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:47:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-12-09 07:47:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2831. [2020-12-09 07:47:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-12-09 07:47:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-12-09 07:47:34,092 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-12-09 07:47:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:34,093 INFO L481 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-12-09 07:47:34,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 07:47:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-12-09 07:47:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 07:47:34,094 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:34,094 INFO L422 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] [2020-12-09 07:47:34,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-09 07:47:34,094 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:34,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:34,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1320448504, now seen corresponding path program 1 times [2020-12-09 07:47:34,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:34,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215958546] [2020-12-09 07:47:34,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:34,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215958546] [2020-12-09 07:47:34,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:34,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 07:47:34,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046048570] [2020-12-09 07:47:34,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 07:47:34,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:34,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 07:47:34,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:47:34,154 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2020-12-09 07:47:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:34,379 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2020-12-09 07:47:34,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 07:47:34,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-12-09 07:47:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:34,385 INFO L225 Difference]: With dead ends: 3550 [2020-12-09 07:47:34,385 INFO L226 Difference]: Without dead ends: 3490 [2020-12-09 07:47:34,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-09 07:47:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2020-12-09 07:47:34,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2020-12-09 07:47:34,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2020-12-09 07:47:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2020-12-09 07:47:34,430 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2020-12-09 07:47:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:34,430 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2020-12-09 07:47:34,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 07:47:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2020-12-09 07:47:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 07:47:34,431 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:34,431 INFO L422 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] [2020-12-09 07:47:34,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-09 07:47:34,432 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:34,432 INFO L82 PathProgramCache]: Analyzing trace with hash -893918318, now seen corresponding path program 2 times [2020-12-09 07:47:34,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:34,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57241007] [2020-12-09 07:47:34,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:34,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57241007] [2020-12-09 07:47:34,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:34,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 07:47:34,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601024732] [2020-12-09 07:47:34,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 07:47:34,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:34,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 07:47:34,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:47:34,520 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2020-12-09 07:47:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:34,777 INFO L93 Difference]: Finished difference Result 3862 states and 14252 transitions. [2020-12-09 07:47:34,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 07:47:34,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-12-09 07:47:34,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:34,783 INFO L225 Difference]: With dead ends: 3862 [2020-12-09 07:47:34,783 INFO L226 Difference]: Without dead ends: 3802 [2020-12-09 07:47:34,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-09 07:47:34,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2020-12-09 07:47:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2822. [2020-12-09 07:47:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-12-09 07:47:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-12-09 07:47:34,834 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-12-09 07:47:34,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:34,834 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-12-09 07:47:34,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 07:47:34,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-12-09 07:47:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 07:47:34,836 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:34,836 INFO L422 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] [2020-12-09 07:47:34,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-09 07:47:34,837 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:34,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:34,837 INFO L82 PathProgramCache]: Analyzing trace with hash 131153448, now seen corresponding path program 3 times [2020-12-09 07:47:34,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:34,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309061492] [2020-12-09 07:47:34,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:34,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309061492] [2020-12-09 07:47:34,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:34,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 07:47:34,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912403992] [2020-12-09 07:47:34,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 07:47:34,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:34,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 07:47:34,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:47:34,910 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2020-12-09 07:47:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:35,164 INFO L93 Difference]: Finished difference Result 4277 states and 15941 transitions. [2020-12-09 07:47:35,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 07:47:35,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-09 07:47:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:35,171 INFO L225 Difference]: With dead ends: 4277 [2020-12-09 07:47:35,171 INFO L226 Difference]: Without dead ends: 4217 [2020-12-09 07:47:35,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-12-09 07:47:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2020-12-09 07:47:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 2818. [2020-12-09 07:47:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2020-12-09 07:47:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 10596 transitions. [2020-12-09 07:47:35,218 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 10596 transitions. Word has length 22 [2020-12-09 07:47:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:35,218 INFO L481 AbstractCegarLoop]: Abstraction has 2818 states and 10596 transitions. [2020-12-09 07:47:35,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 07:47:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 10596 transitions. [2020-12-09 07:47:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 07:47:35,220 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:35,220 INFO L422 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] [2020-12-09 07:47:35,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-09 07:47:35,220 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:35,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:35,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1026439080, now seen corresponding path program 4 times [2020-12-09 07:47:35,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:35,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277590717] [2020-12-09 07:47:35,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:35,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277590717] [2020-12-09 07:47:35,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:35,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 07:47:35,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602676894] [2020-12-09 07:47:35,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 07:47:35,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:35,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 07:47:35,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:47:35,288 INFO L87 Difference]: Start difference. First operand 2818 states and 10596 transitions. Second operand 10 states. [2020-12-09 07:47:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:35,443 INFO L93 Difference]: Finished difference Result 3433 states and 12660 transitions. [2020-12-09 07:47:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:47:35,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-09 07:47:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:35,449 INFO L225 Difference]: With dead ends: 3433 [2020-12-09 07:47:35,449 INFO L226 Difference]: Without dead ends: 3373 [2020-12-09 07:47:35,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-12-09 07:47:35,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2020-12-09 07:47:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 2730. [2020-12-09 07:47:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2020-12-09 07:47:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10232 transitions. [2020-12-09 07:47:35,491 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10232 transitions. Word has length 22 [2020-12-09 07:47:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:35,491 INFO L481 AbstractCegarLoop]: Abstraction has 2730 states and 10232 transitions. [2020-12-09 07:47:35,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 07:47:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10232 transitions. [2020-12-09 07:47:35,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 07:47:35,492 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:35,493 INFO L422 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] [2020-12-09 07:47:35,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-09 07:47:35,493 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:35,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:35,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1544480782, now seen corresponding path program 5 times [2020-12-09 07:47:35,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:35,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196379727] [2020-12-09 07:47:35,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:35,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196379727] [2020-12-09 07:47:35,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:35,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 07:47:35,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298865077] [2020-12-09 07:47:35,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 07:47:35,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:35,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 07:47:35,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:47:35,645 INFO L87 Difference]: Start difference. First operand 2730 states and 10232 transitions. Second operand 12 states. [2020-12-09 07:47:35,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:35,915 INFO L93 Difference]: Finished difference Result 3588 states and 13121 transitions. [2020-12-09 07:47:35,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:47:35,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-09 07:47:35,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:35,921 INFO L225 Difference]: With dead ends: 3588 [2020-12-09 07:47:35,921 INFO L226 Difference]: Without dead ends: 3528 [2020-12-09 07:47:35,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-12-09 07:47:35,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2020-12-09 07:47:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2670. [2020-12-09 07:47:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-12-09 07:47:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2020-12-09 07:47:35,964 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2020-12-09 07:47:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:35,965 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2020-12-09 07:47:35,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 07:47:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2020-12-09 07:47:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 07:47:35,966 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:35,966 INFO L422 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] [2020-12-09 07:47:35,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-09 07:47:35,966 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:35,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:35,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1499150017, now seen corresponding path program 1 times [2020-12-09 07:47:35,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:35,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391189243] [2020-12-09 07:47:35,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:36,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391189243] [2020-12-09 07:47:36,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:36,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 07:47:36,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266700321] [2020-12-09 07:47:36,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 07:47:36,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:36,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 07:47:36,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:47:36,181 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2020-12-09 07:47:36,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:36,706 INFO L93 Difference]: Finished difference Result 2896 states and 10368 transitions. [2020-12-09 07:47:36,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 07:47:36,706 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-09 07:47:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:36,711 INFO L225 Difference]: With dead ends: 2896 [2020-12-09 07:47:36,711 INFO L226 Difference]: Without dead ends: 2802 [2020-12-09 07:47:36,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2020-12-09 07:47:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2020-12-09 07:47:36,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2426. [2020-12-09 07:47:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2020-12-09 07:47:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 8840 transitions. [2020-12-09 07:47:36,746 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 8840 transitions. Word has length 23 [2020-12-09 07:47:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:36,747 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 8840 transitions. [2020-12-09 07:47:36,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 07:47:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 8840 transitions. [2020-12-09 07:47:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 07:47:36,748 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:36,748 INFO L422 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] [2020-12-09 07:47:36,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-09 07:47:36,748 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:36,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1292151056, now seen corresponding path program 1 times [2020-12-09 07:47:36,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:36,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368669806] [2020-12-09 07:47:36,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:36,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368669806] [2020-12-09 07:47:36,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:36,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 07:47:36,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852039143] [2020-12-09 07:47:36,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 07:47:36,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:36,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 07:47:36,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:47:36,961 INFO L87 Difference]: Start difference. First operand 2426 states and 8840 transitions. Second operand 12 states. [2020-12-09 07:47:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:37,459 INFO L93 Difference]: Finished difference Result 2538 states and 8863 transitions. [2020-12-09 07:47:37,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 07:47:37,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-09 07:47:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:37,463 INFO L225 Difference]: With dead ends: 2538 [2020-12-09 07:47:37,463 INFO L226 Difference]: Without dead ends: 2419 [2020-12-09 07:47:37,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-12-09 07:47:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2020-12-09 07:47:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1794. [2020-12-09 07:47:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-12-09 07:47:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2020-12-09 07:47:37,489 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2020-12-09 07:47:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:37,489 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2020-12-09 07:47:37,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 07:47:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2020-12-09 07:47:37,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 07:47:37,491 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:37,491 INFO L422 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] [2020-12-09 07:47:37,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-09 07:47:37,491 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:37,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash -974214744, now seen corresponding path program 1 times [2020-12-09 07:47:37,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:37,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592352337] [2020-12-09 07:47:37,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:37,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592352337] [2020-12-09 07:47:37,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:37,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 07:47:37,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124935304] [2020-12-09 07:47:37,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 07:47:37,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 07:47:37,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-09 07:47:37,519 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 6 states. [2020-12-09 07:47:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:37,638 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2020-12-09 07:47:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 07:47:37,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-12-09 07:47:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:37,641 INFO L225 Difference]: With dead ends: 2291 [2020-12-09 07:47:37,641 INFO L226 Difference]: Without dead ends: 2227 [2020-12-09 07:47:37,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:47:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2020-12-09 07:47:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2020-12-09 07:47:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-12-09 07:47:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2020-12-09 07:47:37,669 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2020-12-09 07:47:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:37,669 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2020-12-09 07:47:37,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 07:47:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2020-12-09 07:47:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 07:47:37,671 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:37,671 INFO L422 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] [2020-12-09 07:47:37,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-09 07:47:37,671 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:37,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:37,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1120972762, now seen corresponding path program 2 times [2020-12-09 07:47:37,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:37,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269013419] [2020-12-09 07:47:37,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:37,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269013419] [2020-12-09 07:47:37,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:37,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 07:47:37,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974134387] [2020-12-09 07:47:37,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 07:47:37,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:37,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 07:47:37,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:47:37,727 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 8 states. [2020-12-09 07:47:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:37,951 INFO L93 Difference]: Finished difference Result 2599 states and 8709 transitions. [2020-12-09 07:47:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 07:47:37,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-09 07:47:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:37,955 INFO L225 Difference]: With dead ends: 2599 [2020-12-09 07:47:37,955 INFO L226 Difference]: Without dead ends: 2535 [2020-12-09 07:47:37,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-09 07:47:37,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2020-12-09 07:47:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2102. [2020-12-09 07:47:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-12-09 07:47:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7273 transitions. [2020-12-09 07:47:37,989 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7273 transitions. Word has length 24 [2020-12-09 07:47:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:37,989 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7273 transitions. [2020-12-09 07:47:37,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 07:47:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7273 transitions. [2020-12-09 07:47:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 07:47:37,990 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:37,990 INFO L422 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] [2020-12-09 07:47:37,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-09 07:47:37,991 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:37,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:37,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1176290112, now seen corresponding path program 3 times [2020-12-09 07:47:37,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:37,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671416698] [2020-12-09 07:47:37,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:38,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671416698] [2020-12-09 07:47:38,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:38,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 07:47:38,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641420161] [2020-12-09 07:47:38,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 07:47:38,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:38,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 07:47:38,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:47:38,066 INFO L87 Difference]: Start difference. First operand 2102 states and 7273 transitions. Second operand 9 states. [2020-12-09 07:47:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:38,315 INFO L93 Difference]: Finished difference Result 2898 states and 9677 transitions. [2020-12-09 07:47:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 07:47:38,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-12-09 07:47:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:38,319 INFO L225 Difference]: With dead ends: 2898 [2020-12-09 07:47:38,319 INFO L226 Difference]: Without dead ends: 2834 [2020-12-09 07:47:38,319 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-09 07:47:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2020-12-09 07:47:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2093. [2020-12-09 07:47:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2020-12-09 07:47:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 7255 transitions. [2020-12-09 07:47:38,348 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 7255 transitions. Word has length 24 [2020-12-09 07:47:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:38,349 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 7255 transitions. [2020-12-09 07:47:38,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 07:47:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 7255 transitions. [2020-12-09 07:47:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 07:47:38,350 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:38,350 INFO L422 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] [2020-12-09 07:47:38,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-09 07:47:38,350 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:38,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:38,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1572220842, now seen corresponding path program 4 times [2020-12-09 07:47:38,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:38,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521737939] [2020-12-09 07:47:38,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:38,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521737939] [2020-12-09 07:47:38,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:38,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-09 07:47:38,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482056330] [2020-12-09 07:47:38,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 07:47:38,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:38,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 07:47:38,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:47:38,444 INFO L87 Difference]: Start difference. First operand 2093 states and 7255 transitions. Second operand 10 states. [2020-12-09 07:47:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:38,708 INFO L93 Difference]: Finished difference Result 2875 states and 9618 transitions. [2020-12-09 07:47:38,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 07:47:38,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-12-09 07:47:38,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:38,712 INFO L225 Difference]: With dead ends: 2875 [2020-12-09 07:47:38,712 INFO L226 Difference]: Without dead ends: 2811 [2020-12-09 07:47:38,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-12-09 07:47:38,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2020-12-09 07:47:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2079. [2020-12-09 07:47:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2020-12-09 07:47:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 7214 transitions. [2020-12-09 07:47:38,743 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 7214 transitions. Word has length 24 [2020-12-09 07:47:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:38,743 INFO L481 AbstractCegarLoop]: Abstraction has 2079 states and 7214 transitions. [2020-12-09 07:47:38,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 07:47:38,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 7214 transitions. [2020-12-09 07:47:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 07:47:38,745 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:38,745 INFO L422 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] [2020-12-09 07:47:38,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-09 07:47:38,745 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:38,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:38,745 INFO L82 PathProgramCache]: Analyzing trace with hash 438749216, now seen corresponding path program 5 times [2020-12-09 07:47:38,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:38,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192841217] [2020-12-09 07:47:38,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:38,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192841217] [2020-12-09 07:47:38,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:38,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-09 07:47:38,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942984305] [2020-12-09 07:47:38,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 07:47:38,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:38,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 07:47:38,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:47:38,830 INFO L87 Difference]: Start difference. First operand 2079 states and 7214 transitions. Second operand 11 states. [2020-12-09 07:47:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:39,028 INFO L93 Difference]: Finished difference Result 3106 states and 10587 transitions. [2020-12-09 07:47:39,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 07:47:39,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-09 07:47:39,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:39,032 INFO L225 Difference]: With dead ends: 3106 [2020-12-09 07:47:39,032 INFO L226 Difference]: Without dead ends: 3042 [2020-12-09 07:47:39,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-12-09 07:47:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2020-12-09 07:47:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2071. [2020-12-09 07:47:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2020-12-09 07:47:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7186 transitions. [2020-12-09 07:47:39,065 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7186 transitions. Word has length 24 [2020-12-09 07:47:39,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:39,066 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 7186 transitions. [2020-12-09 07:47:39,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 07:47:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7186 transitions. [2020-12-09 07:47:39,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 07:47:39,067 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:39,067 INFO L422 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] [2020-12-09 07:47:39,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-09 07:47:39,067 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:39,068 INFO L82 PathProgramCache]: Analyzing trace with hash 991769996, now seen corresponding path program 6 times [2020-12-09 07:47:39,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:39,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777045724] [2020-12-09 07:47:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:39,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777045724] [2020-12-09 07:47:39,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:39,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-09 07:47:39,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191240555] [2020-12-09 07:47:39,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 07:47:39,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:39,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 07:47:39,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:47:39,152 INFO L87 Difference]: Start difference. First operand 2071 states and 7186 transitions. Second operand 11 states. [2020-12-09 07:47:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:39,326 INFO L93 Difference]: Finished difference Result 2481 states and 8355 transitions. [2020-12-09 07:47:39,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:47:39,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-09 07:47:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:39,330 INFO L225 Difference]: With dead ends: 2481 [2020-12-09 07:47:39,330 INFO L226 Difference]: Without dead ends: 2417 [2020-12-09 07:47:39,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2020-12-09 07:47:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2020-12-09 07:47:39,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2039. [2020-12-09 07:47:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2020-12-09 07:47:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 7058 transitions. [2020-12-09 07:47:39,357 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 7058 transitions. Word has length 24 [2020-12-09 07:47:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:39,358 INFO L481 AbstractCegarLoop]: Abstraction has 2039 states and 7058 transitions. [2020-12-09 07:47:39,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 07:47:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 7058 transitions. [2020-12-09 07:47:39,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 07:47:39,359 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:39,359 INFO L422 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] [2020-12-09 07:47:39,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-09 07:47:39,359 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:39,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:39,360 INFO L82 PathProgramCache]: Analyzing trace with hash 71780478, now seen corresponding path program 7 times [2020-12-09 07:47:39,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:39,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590926483] [2020-12-09 07:47:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:39,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590926483] [2020-12-09 07:47:39,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:39,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-09 07:47:39,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934574106] [2020-12-09 07:47:39,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 07:47:39,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:39,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 07:47:39,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-12-09 07:47:39,539 INFO L87 Difference]: Start difference. First operand 2039 states and 7058 transitions. Second operand 13 states. [2020-12-09 07:47:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:40,136 INFO L93 Difference]: Finished difference Result 3018 states and 10169 transitions. [2020-12-09 07:47:40,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 07:47:40,137 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-12-09 07:47:40,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:40,140 INFO L225 Difference]: With dead ends: 3018 [2020-12-09 07:47:40,141 INFO L226 Difference]: Without dead ends: 2890 [2020-12-09 07:47:40,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-09 07:47:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-12-09 07:47:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1971. [2020-12-09 07:47:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2020-12-09 07:47:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 6882 transitions. [2020-12-09 07:47:40,170 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 6882 transitions. Word has length 24 [2020-12-09 07:47:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:40,170 INFO L481 AbstractCegarLoop]: Abstraction has 1971 states and 6882 transitions. [2020-12-09 07:47:40,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 07:47:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 6882 transitions. [2020-12-09 07:47:40,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 07:47:40,172 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:40,172 INFO L422 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] [2020-12-09 07:47:40,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-09 07:47:40,172 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:40,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:40,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1318319474, now seen corresponding path program 1 times [2020-12-09 07:47:40,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:40,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795260898] [2020-12-09 07:47:40,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:40,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795260898] [2020-12-09 07:47:40,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:40,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 07:47:40,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275638330] [2020-12-09 07:47:40,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 07:47:40,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:40,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 07:47:40,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:47:40,319 INFO L87 Difference]: Start difference. First operand 1971 states and 6882 transitions. Second operand 12 states. [2020-12-09 07:47:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:40,575 INFO L93 Difference]: Finished difference Result 3157 states and 10632 transitions. [2020-12-09 07:47:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 07:47:40,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-12-09 07:47:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:40,580 INFO L225 Difference]: With dead ends: 3157 [2020-12-09 07:47:40,580 INFO L226 Difference]: Without dead ends: 3133 [2020-12-09 07:47:40,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-09 07:47:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2020-12-09 07:47:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 1613. [2020-12-09 07:47:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2020-12-09 07:47:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5563 transitions. [2020-12-09 07:47:40,608 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5563 transitions. Word has length 24 [2020-12-09 07:47:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:40,608 INFO L481 AbstractCegarLoop]: Abstraction has 1613 states and 5563 transitions. [2020-12-09 07:47:40,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 07:47:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5563 transitions. [2020-12-09 07:47:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 07:47:40,610 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:40,610 INFO L422 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] [2020-12-09 07:47:40,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-09 07:47:40,610 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:40,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:40,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1290250801, now seen corresponding path program 1 times [2020-12-09 07:47:40,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:40,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125247489] [2020-12-09 07:47:40,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:40,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125247489] [2020-12-09 07:47:40,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:40,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 07:47:40,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481863625] [2020-12-09 07:47:40,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 07:47:40,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:40,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 07:47:40,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:47:40,748 INFO L87 Difference]: Start difference. First operand 1613 states and 5563 transitions. Second operand 12 states. [2020-12-09 07:47:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:41,130 INFO L93 Difference]: Finished difference Result 2298 states and 7608 transitions. [2020-12-09 07:47:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 07:47:41,130 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-09 07:47:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:41,133 INFO L225 Difference]: With dead ends: 2298 [2020-12-09 07:47:41,133 INFO L226 Difference]: Without dead ends: 2254 [2020-12-09 07:47:41,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2020-12-09 07:47:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2020-12-09 07:47:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1611. [2020-12-09 07:47:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2020-12-09 07:47:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 5567 transitions. [2020-12-09 07:47:41,158 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 5567 transitions. Word has length 26 [2020-12-09 07:47:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:41,158 INFO L481 AbstractCegarLoop]: Abstraction has 1611 states and 5567 transitions. [2020-12-09 07:47:41,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 07:47:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 5567 transitions. [2020-12-09 07:47:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 07:47:41,160 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:41,160 INFO L422 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] [2020-12-09 07:47:41,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-09 07:47:41,160 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash -943856693, now seen corresponding path program 2 times [2020-12-09 07:47:41,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:41,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565638055] [2020-12-09 07:47:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:41,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565638055] [2020-12-09 07:47:41,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:41,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 07:47:41,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635765571] [2020-12-09 07:47:41,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 07:47:41,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:41,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 07:47:41,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:47:41,289 INFO L87 Difference]: Start difference. First operand 1611 states and 5567 transitions. Second operand 12 states. [2020-12-09 07:47:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:41,583 INFO L93 Difference]: Finished difference Result 2242 states and 7477 transitions. [2020-12-09 07:47:41,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 07:47:41,584 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-09 07:47:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:41,587 INFO L225 Difference]: With dead ends: 2242 [2020-12-09 07:47:41,587 INFO L226 Difference]: Without dead ends: 2198 [2020-12-09 07:47:41,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-09 07:47:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2020-12-09 07:47:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1587. [2020-12-09 07:47:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-12-09 07:47:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 5509 transitions. [2020-12-09 07:47:41,612 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 5509 transitions. Word has length 26 [2020-12-09 07:47:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:41,612 INFO L481 AbstractCegarLoop]: Abstraction has 1587 states and 5509 transitions. [2020-12-09 07:47:41,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 07:47:41,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 5509 transitions. [2020-12-09 07:47:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 07:47:41,614 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:41,614 INFO L422 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] [2020-12-09 07:47:41,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-09 07:47:41,614 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:41,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:41,614 INFO L82 PathProgramCache]: Analyzing trace with hash -390835913, now seen corresponding path program 3 times [2020-12-09 07:47:41,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:41,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906055407] [2020-12-09 07:47:41,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:41,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906055407] [2020-12-09 07:47:41,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:41,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 07:47:41,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224787452] [2020-12-09 07:47:41,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 07:47:41,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:41,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 07:47:41,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:47:41,754 INFO L87 Difference]: Start difference. First operand 1587 states and 5509 transitions. Second operand 12 states. [2020-12-09 07:47:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:42,021 INFO L93 Difference]: Finished difference Result 1640 states and 5473 transitions. [2020-12-09 07:47:42,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 07:47:42,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-09 07:47:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:42,024 INFO L225 Difference]: With dead ends: 1640 [2020-12-09 07:47:42,024 INFO L226 Difference]: Without dead ends: 1596 [2020-12-09 07:47:42,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-09 07:47:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2020-12-09 07:47:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 885. [2020-12-09 07:47:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-09 07:47:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-12-09 07:47:42,039 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-12-09 07:47:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:42,039 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-12-09 07:47:42,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 07:47:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-12-09 07:47:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 07:47:42,040 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:42,040 INFO L422 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] [2020-12-09 07:47:42,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-09 07:47:42,040 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:42,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:42,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1977826857, now seen corresponding path program 1 times [2020-12-09 07:47:42,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:42,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967681187] [2020-12-09 07:47:42,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:42,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967681187] [2020-12-09 07:47:42,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:42,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 07:47:42,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576985156] [2020-12-09 07:47:42,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 07:47:42,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:42,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 07:47:42,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:47:42,143 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-12-09 07:47:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:42,290 INFO L93 Difference]: Finished difference Result 885 states and 3021 transitions. [2020-12-09 07:47:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:47:42,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-09 07:47:42,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:42,292 INFO L225 Difference]: With dead ends: 885 [2020-12-09 07:47:42,292 INFO L226 Difference]: Without dead ends: 885 [2020-12-09 07:47:42,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:47:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2020-12-09 07:47:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2020-12-09 07:47:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-09 07:47:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3021 transitions. [2020-12-09 07:47:42,303 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3021 transitions. Word has length 41 [2020-12-09 07:47:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:42,304 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3021 transitions. [2020-12-09 07:47:42,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 07:47:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3021 transitions. [2020-12-09 07:47:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 07:47:42,305 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:42,305 INFO L422 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] [2020-12-09 07:47:42,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-09 07:47:42,305 INFO L429 AbstractCegarLoop]: === Iteration 50 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:42,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1154622732, now seen corresponding path program 1 times [2020-12-09 07:47:42,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:42,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263298570] [2020-12-09 07:47:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:42,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263298570] [2020-12-09 07:47:42,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:42,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 07:47:42,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489248142] [2020-12-09 07:47:42,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 07:47:42,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:42,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 07:47:42,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:47:42,353 INFO L87 Difference]: Start difference. First operand 885 states and 3021 transitions. Second operand 7 states. [2020-12-09 07:47:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:42,455 INFO L93 Difference]: Finished difference Result 885 states and 3017 transitions. [2020-12-09 07:47:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:47:42,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-09 07:47:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:42,457 INFO L225 Difference]: With dead ends: 885 [2020-12-09 07:47:42,457 INFO L226 Difference]: Without dead ends: 741 [2020-12-09 07:47:42,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:47:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-09 07:47:42,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-09 07:47:42,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-09 07:47:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2489 transitions. [2020-12-09 07:47:42,467 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2489 transitions. Word has length 41 [2020-12-09 07:47:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:42,468 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2489 transitions. [2020-12-09 07:47:42,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 07:47:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2489 transitions. [2020-12-09 07:47:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 07:47:42,469 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:42,469 INFO L422 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] [2020-12-09 07:47:42,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-09 07:47:42,469 INFO L429 AbstractCegarLoop]: === Iteration 51 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:42,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:42,469 INFO L82 PathProgramCache]: Analyzing trace with hash -267308717, now seen corresponding path program 1 times [2020-12-09 07:47:42,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:42,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152953076] [2020-12-09 07:47:42,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:42,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152953076] [2020-12-09 07:47:42,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:42,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-09 07:47:42,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761719481] [2020-12-09 07:47:42,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 07:47:42,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:42,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 07:47:42,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-09 07:47:42,564 INFO L87 Difference]: Start difference. First operand 741 states and 2489 transitions. Second operand 8 states. [2020-12-09 07:47:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:42,710 INFO L93 Difference]: Finished difference Result 741 states and 2481 transitions. [2020-12-09 07:47:42,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:47:42,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-09 07:47:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:42,712 INFO L225 Difference]: With dead ends: 741 [2020-12-09 07:47:42,712 INFO L226 Difference]: Without dead ends: 741 [2020-12-09 07:47:42,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:47:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-09 07:47:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-09 07:47:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-09 07:47:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2481 transitions. [2020-12-09 07:47:42,722 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2481 transitions. Word has length 41 [2020-12-09 07:47:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:42,722 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2481 transitions. [2020-12-09 07:47:42,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 07:47:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2481 transitions. [2020-12-09 07:47:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 07:47:42,723 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:42,724 INFO L422 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] [2020-12-09 07:47:42,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-09 07:47:42,724 INFO L429 AbstractCegarLoop]: === Iteration 52 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:42,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1194300753, now seen corresponding path program 1 times [2020-12-09 07:47:42,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:42,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796095308] [2020-12-09 07:47:42,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:47:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:47:42,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796095308] [2020-12-09 07:47:42,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:47:42,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 07:47:42,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327226744] [2020-12-09 07:47:42,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 07:47:42,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:47:42,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 07:47:42,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-09 07:47:42,780 INFO L87 Difference]: Start difference. First operand 741 states and 2481 transitions. Second operand 7 states. [2020-12-09 07:47:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:47:42,863 INFO L93 Difference]: Finished difference Result 741 states and 2477 transitions. [2020-12-09 07:47:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 07:47:42,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-09 07:47:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:47:42,864 INFO L225 Difference]: With dead ends: 741 [2020-12-09 07:47:42,864 INFO L226 Difference]: Without dead ends: 495 [2020-12-09 07:47:42,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:47:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-12-09 07:47:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2020-12-09 07:47:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2020-12-09 07:47:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1606 transitions. [2020-12-09 07:47:42,871 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1606 transitions. Word has length 41 [2020-12-09 07:47:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:47:42,871 INFO L481 AbstractCegarLoop]: Abstraction has 495 states and 1606 transitions. [2020-12-09 07:47:42,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 07:47:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1606 transitions. [2020-12-09 07:47:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-09 07:47:42,872 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:47:42,872 INFO L422 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] [2020-12-09 07:47:42,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-09 07:47:42,872 INFO L429 AbstractCegarLoop]: === Iteration 53 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2020-12-09 07:47:42,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:47:42,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1766059350, now seen corresponding path program 1 times [2020-12-09 07:47:42,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:47:42,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525828518] [2020-12-09 07:47:42,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:47:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:47:42,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:47:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:47:42,898 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:47:42,931 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 07:47:42,931 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 07:47:42,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-09 07:47:43,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:47:42 BasicIcfg [2020-12-09 07:47:43,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 07:47:43,000 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 07:47:43,000 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 07:47:43,000 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 07:47:43,001 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:47:15" (3/4) ... [2020-12-09 07:47:43,002 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 07:47:43,056 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1c0e5aec-d2da-482e-9db0-3f14593b0681/bin/utaipan/witness.graphml [2020-12-09 07:47:43,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 07:47:43,057 INFO L168 Benchmark]: Toolchain (without parser) took 28091.85 ms. Allocated memory was 117.4 MB in the beginning and 945.8 MB in the end (delta: 828.4 MB). Free memory was 78.7 MB in the beginning and 307.9 MB in the end (delta: -229.2 MB). Peak memory consumption was 597.2 MB. Max. memory is 16.1 GB. [2020-12-09 07:47:43,057 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 117.4 MB. Free memory is still 97.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:47:43,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.82 ms. Allocated memory is still 117.4 MB. Free memory was 78.5 MB in the beginning and 82.8 MB in the end (delta: -4.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 16.1 GB. [2020-12-09 07:47:43,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.41 ms. Allocated memory is still 117.4 MB. Free memory was 82.1 MB in the beginning and 80.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:47:43,058 INFO L168 Benchmark]: Boogie Preprocessor took 19.69 ms. Allocated memory is still 117.4 MB. Free memory was 80.0 MB in the beginning and 78.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:47:43,058 INFO L168 Benchmark]: RCFGBuilder took 287.86 ms. Allocated memory is still 117.4 MB. Free memory was 78.6 MB in the beginning and 52.1 MB in the end (delta: 26.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2020-12-09 07:47:43,059 INFO L168 Benchmark]: TraceAbstraction took 27184.17 ms. Allocated memory was 117.4 MB in the beginning and 945.8 MB in the end (delta: 828.4 MB). Free memory was 51.3 MB in the beginning and 328.8 MB in the end (delta: -277.5 MB). Peak memory consumption was 549.5 MB. Max. memory is 16.1 GB. [2020-12-09 07:47:43,059 INFO L168 Benchmark]: Witness Printer took 55.82 ms. Allocated memory is still 945.8 MB. Free memory was 328.8 MB in the beginning and 307.9 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-09 07:47:43,061 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.11 ms. Allocated memory is still 117.4 MB. Free memory is still 97.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 507.82 ms. Allocated memory is still 117.4 MB. Free memory was 78.5 MB in the beginning and 82.8 MB in the end (delta: -4.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 31.41 ms. Allocated memory is still 117.4 MB. Free memory was 82.1 MB in the beginning and 80.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 19.69 ms. Allocated memory is still 117.4 MB. Free memory was 80.0 MB in the beginning and 78.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 287.86 ms. Allocated memory is still 117.4 MB. Free memory was 78.6 MB in the beginning and 52.1 MB in the end (delta: 26.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 27184.17 ms. Allocated memory was 117.4 MB in the beginning and 945.8 MB in the end (delta: 828.4 MB). Free memory was 51.3 MB in the beginning and 328.8 MB in the end (delta: -277.5 MB). Peak memory consumption was 549.5 MB. Max. memory is 16.1 GB. * Witness Printer took 55.82 ms. Allocated memory is still 945.8 MB. Free memory was 328.8 MB in the beginning and 307.9 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 3374 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 1145 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.0s, 167 PlacesBefore, 93 PlacesAfterwards, 248 TransitionsBefore, 173 TransitionsAfterwards, 4156 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 49018 MoverChecksTotal - CounterExampleResult [Line: 1123]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1124] 0 char *v; [L1161] 0 pthread_t t; [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; [L1163] 0 \read(t) VAL [arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1147] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1148] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={0:0}] [L1127] 2 v = malloc(sizeof(char)) [L1128] 2 return 0; [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1133] 5 v[0] = 'X' [L1135] 5 return 0; [L1133] 3 v[0] = 'X' [L1135] 3 return 0; [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1153] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1154] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1133] 6 v[0] = 'X' [L1135] 6 return 0; [L1140] 4 v[0] = 'Y' [L1142] 4 return 0; [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1155] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1156] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={14:0}, t2={8:0}, t3={16:0}, t4={15:0}, t5={13:0}, v={6:0}] [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1157] 1 return 0; [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] [L1164] 0 v[0] [L1123] COND TRUE 0 !expression [L1123] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 26.8s, OverallIterations: 53, TraceHistogramMax: 1, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 5380 SDtfs, 11076 SDslu, 16167 SDs, 0 SdLazy, 10055 SolverSat, 1668 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 60 SyntacticMatches, 18 SemanticMatches, 625 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4305occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 52 MinimizatonAttempts, 47589 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1193 NumberOfCodeBlocks, 1193 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1100 ConstructedInterpolants, 0 QuantifiedInterpolants, 426321 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 52 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! Received shutdown request...