./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=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/singleton.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --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-03 01:13:56,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 01:13:56,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 01:13:57,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 01:13:57,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 01:13:57,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 01:13:57,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 01:13:57,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 01:13:57,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 01:13:57,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 01:13:57,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 01:13:57,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 01:13:57,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 01:13:57,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 01:13:57,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 01:13:57,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 01:13:57,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 01:13:57,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 01:13:57,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 01:13:57,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 01:13:57,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 01:13:57,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 01:13:57,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 01:13:57,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 01:13:57,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 01:13:57,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 01:13:57,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 01:13:57,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 01:13:57,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 01:13:57,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 01:13:57,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 01:13:57,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 01:13:57,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 01:13:57,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 01:13:57,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 01:13:57,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 01:13:57,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 01:13:57,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 01:13:57,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 01:13:57,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 01:13:57,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 01:13:57,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-03 01:13:57,148 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 01:13:57,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 01:13:57,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-03 01:13:57,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-03 01:13:57,154 INFO L138 SettingsManager]: * Use SBE=true [2020-12-03 01:13:57,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 01:13:57,154 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 01:13:57,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-03 01:13:57,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 01:13:57,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 01:13:57,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 01:13:57,157 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 01:13:57,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 01:13:57,157 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 01:13:57,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 01:13:57,157 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 01:13:57,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 01:13:57,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 01:13:57,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-03 01:13:57,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 01:13:57,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 01:13:57,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 01:13:57,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 01:13:57,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 01:13:57,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-03 01:13:57,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-03 01:13:57,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 01:13:57,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 01:13:57,160 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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-03 01:13:57,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 01:13:57,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 01:13:57,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 01:13:57,640 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 01:13:57,641 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 01:13:57,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/singleton.i [2020-12-03 01:13:57,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d74af5d5/d744bceb8fa14263b8e8ecf6f13c318d/FLAGdd0c019a9 [2020-12-03 01:13:58,610 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 01:13:58,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i [2020-12-03 01:13:58,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d74af5d5/d744bceb8fa14263b8e8ecf6f13c318d/FLAGdd0c019a9 [2020-12-03 01:13:58,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d74af5d5/d744bceb8fa14263b8e8ecf6f13c318d [2020-12-03 01:13:58,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 01:13:58,807 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 01:13:58,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 01:13:58,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 01:13:58,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 01:13:58,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:13:58" (1/1) ... [2020-12-03 01:13:58,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a7ec905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:13:58, skipping insertion in model container [2020-12-03 01:13:58,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:13:58" (1/1) ... [2020-12-03 01:13:58,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 01:13:58,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 01:13:59,149 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-03 01:13:59,458 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-03 01:13:59,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 01:13:59,486 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 01:13:59,506 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-03 01:13:59,556 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/singleton.i[55547,55560] [2020-12-03 01:13:59,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 01:13:59,796 INFO L208 MainTranslator]: Completed translation [2020-12-03 01:13:59,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:13:59 WrapperNode [2020-12-03 01:13:59,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 01:13:59,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 01:13:59,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 01:13:59,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 01:13:59,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:13:59" (1/1) ... [2020-12-03 01:13:59,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:13:59" (1/1) ... [2020-12-03 01:13:59,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 01:13:59,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 01:13:59,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 01:13:59,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 01:13:59,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:13:59" (1/1) ... [2020-12-03 01:13:59,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:13:59" (1/1) ... [2020-12-03 01:13:59,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:13:59" (1/1) ... [2020-12-03 01:13:59,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:13:59" (1/1) ... [2020-12-03 01:13:59,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:13:59" (1/1) ... [2020-12-03 01:13:59,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:13:59" (1/1) ... [2020-12-03 01:13:59,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:13:59" (1/1) ... [2020-12-03 01:13:59,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 01:13:59,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 01:13:59,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 01:13:59,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 01:13:59,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:13:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-03 01:14:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-03 01:14:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 01:14:00,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-03 01:14:00,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-03 01:14:00,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-03 01:14:00,059 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-12-03 01:14:00,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-12-03 01:14:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-12-03 01:14:00,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-12-03 01:14:00,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-12-03 01:14:00,063 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-12-03 01:14:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-12-03 01:14:00,063 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-12-03 01:14:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-03 01:14:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-03 01:14:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-03 01:14:00,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 01:14:00,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 01:14:00,065 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-03 01:14:00,530 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 01:14:00,530 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-03 01:14:00,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:14:00 BoogieIcfgContainer [2020-12-03 01:14:00,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 01:14:00,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 01:14:00,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 01:14:00,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 01:14:00,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:13:58" (1/3) ... [2020-12-03 01:14:00,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd12b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:14:00, skipping insertion in model container [2020-12-03 01:14:00,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:13:59" (2/3) ... [2020-12-03 01:14:00,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd12b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:14:00, skipping insertion in model container [2020-12-03 01:14:00,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:14:00" (3/3) ... [2020-12-03 01:14:00,543 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-12-03 01:14:00,560 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-03 01:14:00,560 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 01:14:00,565 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 01:14:00,566 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-03 01:14:00,609 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,610 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,610 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,611 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,611 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,611 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,611 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,612 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,612 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,612 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,613 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,613 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,613 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,614 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,614 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,614 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,615 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,615 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,623 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,623 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,624 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,624 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,624 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,625 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,625 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,626 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,626 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,626 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,627 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,627 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,627 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,628 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,628 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,628 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,629 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,629 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,629 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,630 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,630 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,630 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,631 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,632 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,632 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,632 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,633 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,633 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,633 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,634 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,634 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,634 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,634 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,635 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,635 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,636 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,636 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,636 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,637 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,637 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,637 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,638 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,638 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,638 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,639 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,639 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,639 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,640 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,640 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,640 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,640 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,641 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,641 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,641 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,642 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,642 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,642 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,643 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,643 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,643 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,643 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,644 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,644 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,644 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,645 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,645 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,645 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,646 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,646 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,646 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,647 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,647 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,647 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,648 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,648 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,648 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,648 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,649 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,649 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,649 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,650 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,650 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,650 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,651 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,651 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,651 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,652 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,652 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,652 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,652 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,653 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,653 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,653 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,654 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,654 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,654 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,655 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,655 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,655 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,655 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,656 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,656 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,656 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,657 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,657 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,657 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,657 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,658 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,658 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,658 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,659 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,659 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,659 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,660 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,660 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,660 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,661 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,661 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,661 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,661 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,662 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,662 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,662 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,663 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,663 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,663 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,664 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,664 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,664 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,664 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,665 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,665 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,665 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,666 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,666 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,667 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,667 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,667 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,668 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,668 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,668 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,668 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,669 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,669 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,669 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,670 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,670 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,670 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,671 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,671 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,671 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,672 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,672 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,672 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,673 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,673 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,673 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,673 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,674 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,674 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,674 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,675 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,675 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,675 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,675 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,676 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,676 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,676 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,677 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,677 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,677 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,678 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,678 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,678 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,678 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,679 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,679 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,679 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,680 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,680 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,680 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,680 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,683 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,684 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,684 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,684 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,690 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,690 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,690 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,691 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,693 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,693 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,694 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,694 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,696 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,697 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,697 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,697 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,698 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,698 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,700 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,701 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,701 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,701 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,701 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,702 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,702 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,702 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,702 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,703 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,703 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,703 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,704 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,704 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,704 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,705 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,705 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,705 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,705 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,706 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,706 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,706 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,706 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,707 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,709 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,710 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,710 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,710 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,712 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,713 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,713 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,713 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,714 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,714 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,716 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,716 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,717 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,717 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,719 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,719 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,719 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,720 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,721 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,722 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,722 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,722 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,724 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,725 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,725 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,725 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-03 01:14:00,859 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2020-12-03 01:14:00,874 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-12-03 01:14:00,919 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 01:14:00,919 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 01:14:00,919 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 01:14:00,919 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 01:14:00,919 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 01:14:00,919 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 01:14:00,920 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 01:14:00,920 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 01:14:00,949 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-03 01:14:00,952 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-03 01:14:00,956 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-03 01:14:00,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 248 transitions, 876 flow [2020-12-03 01:14:01,178 INFO L129 PetriNetUnfolder]: 61/274 cut-off events. [2020-12-03 01:14:01,179 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-12-03 01:14:01,200 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-03 01:14:01,225 INFO L116 LiptonReduction]: Number of co-enabled transitions 4156 [2020-12-03 01:14:04,128 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-03 01:14:04,249 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-03 01:14:04,393 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-03 01:14:04,508 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-03 01:14:04,933 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-03 01:14:05,170 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-03 01:14:05,362 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-03 01:14:05,478 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-03 01:14:05,604 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-03 01:14:05,739 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-03 01:14:06,032 INFO L131 LiptonReduction]: Checked pairs total: 49018 [2020-12-03 01:14:06,032 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-12-03 01:14:06,040 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 173 transitions, 726 flow [2020-12-03 01:14:06,660 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-12-03 01:14:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-12-03 01:14:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-03 01:14:06,672 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:06,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:14:06,673 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-03 01:14:06,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:06,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1391244601, now seen corresponding path program 1 times [2020-12-03 01:14:06,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:06,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732326071] [2020-12-03 01:14:06,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:07,066 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-03 01:14:07,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732326071] [2020-12-03 01:14:07,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:07,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 01:14:07,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281392768] [2020-12-03 01:14:07,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 01:14:07,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:07,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 01:14:07,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-03 01:14:07,099 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-12-03 01:14:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:07,591 INFO L93 Difference]: Finished difference Result 6012 states and 25679 transitions. [2020-12-03 01:14:07,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:14:07,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-03 01:14:07,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:07,735 INFO L225 Difference]: With dead ends: 6012 [2020-12-03 01:14:07,735 INFO L226 Difference]: Without dead ends: 5524 [2020-12-03 01:14:07,740 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-03 01:14:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2020-12-03 01:14:08,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 3018. [2020-12-03 01:14:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-12-03 01:14:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-12-03 01:14:08,192 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-12-03 01:14:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:08,193 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-12-03 01:14:08,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 01:14:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-12-03 01:14:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-03 01:14:08,194 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:08,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:14:08,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-03 01:14:08,195 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-03 01:14:08,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:08,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1473766845, now seen corresponding path program 2 times [2020-12-03 01:14:08,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:08,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496539986] [2020-12-03 01:14:08,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:08,363 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-03 01:14:08,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496539986] [2020-12-03 01:14:08,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:08,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 01:14:08,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765691663] [2020-12-03 01:14:08,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 01:14:08,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:08,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 01:14:08,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-03 01:14:08,369 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-12-03 01:14:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:08,614 INFO L93 Difference]: Finished difference Result 4266 states and 18042 transitions. [2020-12-03 01:14:08,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 01:14:08,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-03 01:14:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:08,665 INFO L225 Difference]: With dead ends: 4266 [2020-12-03 01:14:08,666 INFO L226 Difference]: Without dead ends: 4266 [2020-12-03 01:14:08,667 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-03 01:14:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2020-12-03 01:14:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 3008. [2020-12-03 01:14:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-12-03 01:14:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-12-03 01:14:08,883 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-12-03 01:14:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:08,883 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-12-03 01:14:08,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 01:14:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-12-03 01:14:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-03 01:14:08,886 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:08,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:14:08,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-03 01:14:08,888 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-03 01:14:08,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:08,898 INFO L82 PathProgramCache]: Analyzing trace with hash -658761216, now seen corresponding path program 1 times [2020-12-03 01:14:08,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:08,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978166725] [2020-12-03 01:14:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:09,001 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-03 01:14:09,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978166725] [2020-12-03 01:14:09,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:09,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-03 01:14:09,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015551821] [2020-12-03 01:14:09,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 01:14:09,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:09,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 01:14:09,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 01:14:09,004 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-12-03 01:14:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:09,132 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-12-03 01:14:09,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 01:14:09,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-03 01:14:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:09,185 INFO L225 Difference]: With dead ends: 4848 [2020-12-03 01:14:09,185 INFO L226 Difference]: Without dead ends: 3558 [2020-12-03 01:14:09,186 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-03 01:14:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-12-03 01:14:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-12-03 01:14:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-12-03 01:14:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-12-03 01:14:09,399 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-12-03 01:14:09,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:09,400 INFO L481 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-12-03 01:14:09,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 01:14:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-12-03 01:14:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-03 01:14:09,405 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:09,405 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:14:09,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-03 01:14:09,406 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-03 01:14:09,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:09,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1053238145, now seen corresponding path program 1 times [2020-12-03 01:14:09,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:09,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566512019] [2020-12-03 01:14:09,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:09,522 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-03 01:14:09,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566512019] [2020-12-03 01:14:09,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:09,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 01:14:09,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464377835] [2020-12-03 01:14:09,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 01:14:09,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:09,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 01:14:09,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 01:14:09,525 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-12-03 01:14:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:09,817 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-12-03 01:14:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 01:14:09,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-03 01:14:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:09,841 INFO L225 Difference]: With dead ends: 4417 [2020-12-03 01:14:09,842 INFO L226 Difference]: Without dead ends: 4393 [2020-12-03 01:14:09,842 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-03 01:14:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-12-03 01:14:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-12-03 01:14:10,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-12-03 01:14:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-12-03 01:14:10,063 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-12-03 01:14:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:10,064 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-12-03 01:14:10,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 01:14:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-12-03 01:14:10,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-03 01:14:10,070 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:10,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:14:10,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-03 01:14:10,071 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-03 01:14:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:10,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1471262403, now seen corresponding path program 2 times [2020-12-03 01:14:10,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:10,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121311522] [2020-12-03 01:14:10,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:10,170 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-03 01:14:10,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121311522] [2020-12-03 01:14:10,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:10,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 01:14:10,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206393841] [2020-12-03 01:14:10,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 01:14:10,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:10,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 01:14:10,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-03 01:14:10,173 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-12-03 01:14:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:10,361 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-12-03 01:14:10,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 01:14:10,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-03 01:14:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:10,380 INFO L225 Difference]: With dead ends: 4024 [2020-12-03 01:14:10,380 INFO L226 Difference]: Without dead ends: 4024 [2020-12-03 01:14:10,381 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-03 01:14:10,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-12-03 01:14:10,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-12-03 01:14:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-12-03 01:14:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-12-03 01:14:10,519 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-12-03 01:14:10,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:10,520 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-12-03 01:14:10,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 01:14:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-12-03 01:14:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 01:14:10,521 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:10,521 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-03 01:14:10,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-03 01:14:10,521 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-03 01:14:10,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:10,522 INFO L82 PathProgramCache]: Analyzing trace with hash -564581282, now seen corresponding path program 1 times [2020-12-03 01:14:10,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:10,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482775823] [2020-12-03 01:14:10,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:10,625 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-03 01:14:10,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482775823] [2020-12-03 01:14:10,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:10,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 01:14:10,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021707452] [2020-12-03 01:14:10,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 01:14:10,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:10,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 01:14:10,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 01:14:10,628 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-12-03 01:14:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:10,919 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-12-03 01:14:10,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 01:14:10,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-03 01:14:10,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:10,942 INFO L225 Difference]: With dead ends: 4225 [2020-12-03 01:14:10,942 INFO L226 Difference]: Without dead ends: 4129 [2020-12-03 01:14:10,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-03 01:14:10,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-12-03 01:14:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-12-03 01:14:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-12-03 01:14:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-12-03 01:14:11,108 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-12-03 01:14:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:11,109 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-12-03 01:14:11,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 01:14:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-12-03 01:14:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 01:14:11,110 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:11,111 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-03 01:14:11,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-03 01:14:11,111 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-03 01:14:11,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash -490731172, now seen corresponding path program 2 times [2020-12-03 01:14:11,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:11,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978990604] [2020-12-03 01:14:11,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:11,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-03 01:14:11,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978990604] [2020-12-03 01:14:11,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:11,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 01:14:11,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419204964] [2020-12-03 01:14:11,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 01:14:11,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:11,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 01:14:11,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-03 01:14:11,245 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2020-12-03 01:14:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:11,771 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-12-03 01:14:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 01:14:11,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-03 01:14:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:11,797 INFO L225 Difference]: With dead ends: 4979 [2020-12-03 01:14:11,797 INFO L226 Difference]: Without dead ends: 4905 [2020-12-03 01:14:11,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-03 01:14:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-12-03 01:14:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-12-03 01:14:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-03 01:14:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-12-03 01:14:11,965 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-12-03 01:14:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:11,965 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-12-03 01:14:11,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 01:14:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-12-03 01:14:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 01:14:11,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:11,967 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-03 01:14:11,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-03 01:14:11,967 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-03 01:14:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:11,968 INFO L82 PathProgramCache]: Analyzing trace with hash 991975414, now seen corresponding path program 3 times [2020-12-03 01:14:11,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:11,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714698820] [2020-12-03 01:14:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:12,126 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-03 01:14:12,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714698820] [2020-12-03 01:14:12,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:12,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 01:14:12,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879438032] [2020-12-03 01:14:12,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-03 01:14:12,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:12,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-03 01:14:12,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-03 01:14:12,129 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2020-12-03 01:14:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:12,707 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-12-03 01:14:12,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 01:14:12,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-03 01:14:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:12,738 INFO L225 Difference]: With dead ends: 6735 [2020-12-03 01:14:12,738 INFO L226 Difference]: Without dead ends: 6661 [2020-12-03 01:14:12,739 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-03 01:14:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-12-03 01:14:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-12-03 01:14:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-12-03 01:14:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-12-03 01:14:12,932 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-12-03 01:14:12,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:12,932 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-12-03 01:14:12,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-03 01:14:12,932 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-12-03 01:14:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 01:14:12,934 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:12,934 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-03 01:14:12,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-03 01:14:12,934 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-03 01:14:12,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:12,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1869283970, now seen corresponding path program 4 times [2020-12-03 01:14:12,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:12,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972377602] [2020-12-03 01:14:12,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:13,092 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-03 01:14:13,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972377602] [2020-12-03 01:14:13,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:13,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 01:14:13,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702426371] [2020-12-03 01:14:13,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-03 01:14:13,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:13,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-03 01:14:13,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-03 01:14:13,095 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 9 states. [2020-12-03 01:14:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:13,541 INFO L93 Difference]: Finished difference Result 5385 states and 21914 transitions. [2020-12-03 01:14:13,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:14:13,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-03 01:14:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:13,568 INFO L225 Difference]: With dead ends: 5385 [2020-12-03 01:14:13,568 INFO L226 Difference]: Without dead ends: 5311 [2020-12-03 01:14:13,568 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-03 01:14:13,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2020-12-03 01:14:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4125. [2020-12-03 01:14:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2020-12-03 01:14:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 16604 transitions. [2020-12-03 01:14:13,784 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 16604 transitions. Word has length 18 [2020-12-03 01:14:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:13,787 INFO L481 AbstractCegarLoop]: Abstraction has 4125 states and 16604 transitions. [2020-12-03 01:14:13,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-03 01:14:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 16604 transitions. [2020-12-03 01:14:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 01:14:13,789 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:13,789 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-03 01:14:13,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-03 01:14:13,789 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-03 01:14:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:13,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1339896726, now seen corresponding path program 5 times [2020-12-03 01:14:13,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:13,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553482105] [2020-12-03 01:14:13,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:14,086 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-03 01:14:14,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553482105] [2020-12-03 01:14:14,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:14,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 01:14:14,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10126328] [2020-12-03 01:14:14,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 01:14:14,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:14,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 01:14:14,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-03 01:14:14,089 INFO L87 Difference]: Start difference. First operand 4125 states and 16604 transitions. Second operand 11 states. [2020-12-03 01:14:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:15,059 INFO L93 Difference]: Finished difference Result 5686 states and 23415 transitions. [2020-12-03 01:14:15,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-03 01:14:15,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-12-03 01:14:15,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:15,085 INFO L225 Difference]: With dead ends: 5686 [2020-12-03 01:14:15,085 INFO L226 Difference]: Without dead ends: 5630 [2020-12-03 01:14:15,085 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-03 01:14:15,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2020-12-03 01:14:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4116. [2020-12-03 01:14:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2020-12-03 01:14:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2020-12-03 01:14:15,269 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2020-12-03 01:14:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:15,270 INFO L481 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2020-12-03 01:14:15,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 01:14:15,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2020-12-03 01:14:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-03 01:14:15,273 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:15,273 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-03 01:14:15,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-03 01:14:15,273 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-03 01:14:15,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:15,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1845549347, now seen corresponding path program 1 times [2020-12-03 01:14:15,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:15,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172052461] [2020-12-03 01:14:15,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:15,334 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-03 01:14:15,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172052461] [2020-12-03 01:14:15,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:15,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 01:14:15,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673266084] [2020-12-03 01:14:15,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 01:14:15,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:15,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 01:14:15,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-03 01:14:15,336 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 6 states. [2020-12-03 01:14:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:15,483 INFO L93 Difference]: Finished difference Result 4687 states and 18325 transitions. [2020-12-03 01:14:15,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 01:14:15,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-03 01:14:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:15,499 INFO L225 Difference]: With dead ends: 4687 [2020-12-03 01:14:15,499 INFO L226 Difference]: Without dead ends: 4687 [2020-12-03 01:14:15,499 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-03 01:14:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-03 01:14:15,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4131. [2020-12-03 01:14:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-03 01:14:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16621 transitions. [2020-12-03 01:14:15,665 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16621 transitions. Word has length 19 [2020-12-03 01:14:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:15,666 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16621 transitions. [2020-12-03 01:14:15,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 01:14:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16621 transitions. [2020-12-03 01:14:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-03 01:14:15,669 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:15,669 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-03 01:14:15,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-03 01:14:15,669 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-03 01:14:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:15,670 INFO L82 PathProgramCache]: Analyzing trace with hash 838752707, now seen corresponding path program 2 times [2020-12-03 01:14:15,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:15,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444196381] [2020-12-03 01:14:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:15,797 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-03 01:14:15,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444196381] [2020-12-03 01:14:15,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:15,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-03 01:14:15,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112183357] [2020-12-03 01:14:15,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 01:14:15,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:15,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 01:14:15,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-03 01:14:15,800 INFO L87 Difference]: Start difference. First operand 4131 states and 16621 transitions. Second operand 7 states. [2020-12-03 01:14:15,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:15,943 INFO L93 Difference]: Finished difference Result 4619 states and 18100 transitions. [2020-12-03 01:14:15,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 01:14:15,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-12-03 01:14:15,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:15,961 INFO L225 Difference]: With dead ends: 4619 [2020-12-03 01:14:15,961 INFO L226 Difference]: Without dead ends: 4619 [2020-12-03 01:14:15,961 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-03 01:14:15,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2020-12-03 01:14:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4078. [2020-12-03 01:14:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2020-12-03 01:14:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2020-12-03 01:14:16,129 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2020-12-03 01:14:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:16,130 INFO L481 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2020-12-03 01:14:16,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 01:14:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2020-12-03 01:14:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-03 01:14:16,132 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:16,132 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-03 01:14:16,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-03 01:14:16,133 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-03 01:14:16,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:16,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1368539430, now seen corresponding path program 1 times [2020-12-03 01:14:16,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:16,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544811081] [2020-12-03 01:14:16,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:16,384 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-03 01:14:16,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544811081] [2020-12-03 01:14:16,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:16,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 01:14:16,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179302343] [2020-12-03 01:14:16,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 01:14:16,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:16,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 01:14:16,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-12-03 01:14:16,386 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 10 states. [2020-12-03 01:14:17,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:17,123 INFO L93 Difference]: Finished difference Result 5300 states and 21612 transitions. [2020-12-03 01:14:17,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 01:14:17,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-12-03 01:14:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:17,141 INFO L225 Difference]: With dead ends: 5300 [2020-12-03 01:14:17,141 INFO L226 Difference]: Without dead ends: 5226 [2020-12-03 01:14:17,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-12-03 01:14:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2020-12-03 01:14:17,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 4066. [2020-12-03 01:14:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2020-12-03 01:14:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 16392 transitions. [2020-12-03 01:14:17,340 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 16392 transitions. Word has length 19 [2020-12-03 01:14:17,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:17,340 INFO L481 AbstractCegarLoop]: Abstraction has 4066 states and 16392 transitions. [2020-12-03 01:14:17,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 01:14:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 16392 transitions. [2020-12-03 01:14:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-03 01:14:17,342 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:17,342 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-03 01:14:17,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-03 01:14:17,343 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-03 01:14:17,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:17,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1392670140, now seen corresponding path program 2 times [2020-12-03 01:14:17,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:17,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592440528] [2020-12-03 01:14:17,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:17,627 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-03 01:14:17,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592440528] [2020-12-03 01:14:17,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:17,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 01:14:17,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413156696] [2020-12-03 01:14:17,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 01:14:17,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:17,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 01:14:17,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-03 01:14:17,629 INFO L87 Difference]: Start difference. First operand 4066 states and 16392 transitions. Second operand 12 states. [2020-12-03 01:14:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:18,726 INFO L93 Difference]: Finished difference Result 5713 states and 23638 transitions. [2020-12-03 01:14:18,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 01:14:18,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-12-03 01:14:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:18,741 INFO L225 Difference]: With dead ends: 5713 [2020-12-03 01:14:18,741 INFO L226 Difference]: Without dead ends: 5651 [2020-12-03 01:14:18,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2020-12-03 01:14:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2020-12-03 01:14:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 4021. [2020-12-03 01:14:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2020-12-03 01:14:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 16226 transitions. [2020-12-03 01:14:18,882 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 16226 transitions. Word has length 19 [2020-12-03 01:14:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:18,883 INFO L481 AbstractCegarLoop]: Abstraction has 4021 states and 16226 transitions. [2020-12-03 01:14:18,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 01:14:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 16226 transitions. [2020-12-03 01:14:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 01:14:18,887 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:18,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] [2020-12-03 01:14:18,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-03 01:14:18,888 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-03 01:14:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash -638770199, now seen corresponding path program 1 times [2020-12-03 01:14:18,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:18,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800055473] [2020-12-03 01:14:18,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:18,980 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-03 01:14:18,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800055473] [2020-12-03 01:14:18,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:18,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 01:14:18,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118885434] [2020-12-03 01:14:18,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 01:14:18,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:18,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 01:14:18,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-03 01:14:18,982 INFO L87 Difference]: Start difference. First operand 4021 states and 16226 transitions. Second operand 8 states. [2020-12-03 01:14:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:19,340 INFO L93 Difference]: Finished difference Result 6240 states and 25278 transitions. [2020-12-03 01:14:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 01:14:19,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-03 01:14:19,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:19,362 INFO L225 Difference]: With dead ends: 6240 [2020-12-03 01:14:19,362 INFO L226 Difference]: Without dead ends: 6194 [2020-12-03 01:14:19,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-12-03 01:14:19,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6194 states. [2020-12-03 01:14:19,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6194 to 4020. [2020-12-03 01:14:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2020-12-03 01:14:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 16225 transitions. [2020-12-03 01:14:19,508 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 16225 transitions. Word has length 20 [2020-12-03 01:14:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:19,508 INFO L481 AbstractCegarLoop]: Abstraction has 4020 states and 16225 transitions. [2020-12-03 01:14:19,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 01:14:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 16225 transitions. [2020-12-03 01:14:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 01:14:19,511 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:19,511 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-03 01:14:19,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-03 01:14:19,511 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-03 01:14:19,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash -78568143, now seen corresponding path program 2 times [2020-12-03 01:14:19,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:19,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361381499] [2020-12-03 01:14:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:19,595 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-03 01:14:19,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361381499] [2020-12-03 01:14:19,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:19,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 01:14:19,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115689601] [2020-12-03 01:14:19,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 01:14:19,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:19,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 01:14:19,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-03 01:14:19,597 INFO L87 Difference]: Start difference. First operand 4020 states and 16225 transitions. Second operand 8 states. [2020-12-03 01:14:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:19,889 INFO L93 Difference]: Finished difference Result 5057 states and 20246 transitions. [2020-12-03 01:14:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:14:19,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-03 01:14:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:19,903 INFO L225 Difference]: With dead ends: 5057 [2020-12-03 01:14:19,903 INFO L226 Difference]: Without dead ends: 5011 [2020-12-03 01:14:19,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-12-03 01:14:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2020-12-03 01:14:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 4017. [2020-12-03 01:14:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4017 states. [2020-12-03 01:14:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 16218 transitions. [2020-12-03 01:14:20,031 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 16218 transitions. Word has length 20 [2020-12-03 01:14:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:20,032 INFO L481 AbstractCegarLoop]: Abstraction has 4017 states and 16218 transitions. [2020-12-03 01:14:20,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 01:14:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 16218 transitions. [2020-12-03 01:14:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 01:14:20,034 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:20,034 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-03 01:14:20,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-03 01:14:20,035 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-03 01:14:20,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:20,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1686883325, now seen corresponding path program 3 times [2020-12-03 01:14:20,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:20,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143604036] [2020-12-03 01:14:20,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:20,198 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-03 01:14:20,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143604036] [2020-12-03 01:14:20,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:20,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 01:14:20,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140768974] [2020-12-03 01:14:20,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-03 01:14:20,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:20,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-03 01:14:20,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-03 01:14:20,200 INFO L87 Difference]: Start difference. First operand 4017 states and 16218 transitions. Second operand 9 states. [2020-12-03 01:14:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:20,738 INFO L93 Difference]: Finished difference Result 5047 states and 20222 transitions. [2020-12-03 01:14:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 01:14:20,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-12-03 01:14:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:20,754 INFO L225 Difference]: With dead ends: 5047 [2020-12-03 01:14:20,754 INFO L226 Difference]: Without dead ends: 5001 [2020-12-03 01:14:20,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-12-03 01:14:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2020-12-03 01:14:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4010. [2020-12-03 01:14:20,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4010 states. [2020-12-03 01:14:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 16199 transitions. [2020-12-03 01:14:20,886 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 16199 transitions. Word has length 20 [2020-12-03 01:14:20,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:20,888 INFO L481 AbstractCegarLoop]: Abstraction has 4010 states and 16199 transitions. [2020-12-03 01:14:20,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-03 01:14:20,888 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 16199 transitions. [2020-12-03 01:14:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 01:14:20,890 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:20,891 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-03 01:14:20,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-03 01:14:20,891 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-03 01:14:20,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:20,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1644928641, now seen corresponding path program 4 times [2020-12-03 01:14:20,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:20,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767735896] [2020-12-03 01:14:20,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:21,186 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-03 01:14:21,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767735896] [2020-12-03 01:14:21,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:21,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 01:14:21,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905232029] [2020-12-03 01:14:21,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 01:14:21,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:21,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 01:14:21,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-12-03 01:14:21,192 INFO L87 Difference]: Start difference. First operand 4010 states and 16199 transitions. Second operand 11 states. [2020-12-03 01:14:22,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:22,000 INFO L93 Difference]: Finished difference Result 5545 states and 22382 transitions. [2020-12-03 01:14:22,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 01:14:22,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-03 01:14:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:22,019 INFO L225 Difference]: With dead ends: 5545 [2020-12-03 01:14:22,019 INFO L226 Difference]: Without dead ends: 5499 [2020-12-03 01:14:22,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-12-03 01:14:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2020-12-03 01:14:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4140. [2020-12-03 01:14:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-03 01:14:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16867 transitions. [2020-12-03 01:14:22,152 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16867 transitions. Word has length 20 [2020-12-03 01:14:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:22,152 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16867 transitions. [2020-12-03 01:14:22,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 01:14:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16867 transitions. [2020-12-03 01:14:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 01:14:22,155 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:22,155 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-03 01:14:22,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-03 01:14:22,156 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-03 01:14:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:22,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1818104208, now seen corresponding path program 1 times [2020-12-03 01:14:22,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:22,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8229276] [2020-12-03 01:14:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:22,433 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-03 01:14:22,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8229276] [2020-12-03 01:14:22,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:22,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 01:14:22,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253575457] [2020-12-03 01:14:22,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 01:14:22,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:22,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 01:14:22,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-03 01:14:22,438 INFO L87 Difference]: Start difference. First operand 4140 states and 16867 transitions. Second operand 11 states. [2020-12-03 01:14:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:23,470 INFO L93 Difference]: Finished difference Result 6397 states and 25724 transitions. [2020-12-03 01:14:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-03 01:14:23,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-03 01:14:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:23,486 INFO L225 Difference]: With dead ends: 6397 [2020-12-03 01:14:23,487 INFO L226 Difference]: Without dead ends: 6351 [2020-12-03 01:14:23,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-03 01:14:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6351 states. [2020-12-03 01:14:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6351 to 4140. [2020-12-03 01:14:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-03 01:14:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16868 transitions. [2020-12-03 01:14:23,622 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16868 transitions. Word has length 20 [2020-12-03 01:14:23,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:23,622 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16868 transitions. [2020-12-03 01:14:23,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 01:14:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16868 transitions. [2020-12-03 01:14:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 01:14:23,625 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:23,626 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-03 01:14:23,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-03 01:14:23,626 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-03 01:14:23,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:23,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1599554532, now seen corresponding path program 2 times [2020-12-03 01:14:23,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:23,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939424030] [2020-12-03 01:14:23,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:23,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-03 01:14:23,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939424030] [2020-12-03 01:14:23,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:23,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 01:14:23,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223297828] [2020-12-03 01:14:23,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 01:14:23,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:23,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 01:14:23,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-03 01:14:23,831 INFO L87 Difference]: Start difference. First operand 4140 states and 16868 transitions. Second operand 11 states. [2020-12-03 01:14:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:24,727 INFO L93 Difference]: Finished difference Result 5409 states and 21869 transitions. [2020-12-03 01:14:24,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-03 01:14:24,728 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-03 01:14:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:24,741 INFO L225 Difference]: With dead ends: 5409 [2020-12-03 01:14:24,742 INFO L226 Difference]: Without dead ends: 5363 [2020-12-03 01:14:24,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-12-03 01:14:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2020-12-03 01:14:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 4142. [2020-12-03 01:14:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4142 states. [2020-12-03 01:14:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 16874 transitions. [2020-12-03 01:14:24,893 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 16874 transitions. Word has length 20 [2020-12-03 01:14:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:24,894 INFO L481 AbstractCegarLoop]: Abstraction has 4142 states and 16874 transitions. [2020-12-03 01:14:24,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 01:14:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 16874 transitions. [2020-12-03 01:14:24,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 01:14:24,897 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:24,898 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-03 01:14:24,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-03 01:14:24,898 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-03 01:14:24,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:24,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1117675172, now seen corresponding path program 3 times [2020-12-03 01:14:24,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:24,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518706947] [2020-12-03 01:14:24,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:25,059 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-03 01:14:25,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518706947] [2020-12-03 01:14:25,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:25,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 01:14:25,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536236309] [2020-12-03 01:14:25,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 01:14:25,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:25,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 01:14:25,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-03 01:14:25,062 INFO L87 Difference]: Start difference. First operand 4142 states and 16874 transitions. Second operand 10 states. [2020-12-03 01:14:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:25,747 INFO L93 Difference]: Finished difference Result 6189 states and 24832 transitions. [2020-12-03 01:14:25,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-03 01:14:25,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-03 01:14:25,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:25,764 INFO L225 Difference]: With dead ends: 6189 [2020-12-03 01:14:25,764 INFO L226 Difference]: Without dead ends: 6143 [2020-12-03 01:14:25,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-12-03 01:14:25,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2020-12-03 01:14:25,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 4141. [2020-12-03 01:14:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4141 states. [2020-12-03 01:14:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 16873 transitions. [2020-12-03 01:14:25,894 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 16873 transitions. Word has length 20 [2020-12-03 01:14:25,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:25,895 INFO L481 AbstractCegarLoop]: Abstraction has 4141 states and 16873 transitions. [2020-12-03 01:14:25,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 01:14:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 16873 transitions. [2020-12-03 01:14:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 01:14:25,898 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:25,899 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-03 01:14:25,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-03 01:14:25,899 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-03 01:14:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:25,899 INFO L82 PathProgramCache]: Analyzing trace with hash -240366616, now seen corresponding path program 4 times [2020-12-03 01:14:25,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:25,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42838871] [2020-12-03 01:14:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:26,097 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-03 01:14:26,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42838871] [2020-12-03 01:14:26,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:26,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 01:14:26,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011727530] [2020-12-03 01:14:26,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 01:14:26,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:26,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 01:14:26,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-03 01:14:26,099 INFO L87 Difference]: Start difference. First operand 4141 states and 16873 transitions. Second operand 10 states. [2020-12-03 01:14:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:26,626 INFO L93 Difference]: Finished difference Result 5246 states and 21125 transitions. [2020-12-03 01:14:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 01:14:26,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-03 01:14:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:26,640 INFO L225 Difference]: With dead ends: 5246 [2020-12-03 01:14:26,641 INFO L226 Difference]: Without dead ends: 5200 [2020-12-03 01:14:26,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-12-03 01:14:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2020-12-03 01:14:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 3983. [2020-12-03 01:14:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2020-12-03 01:14:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 16133 transitions. [2020-12-03 01:14:26,743 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 16133 transitions. Word has length 20 [2020-12-03 01:14:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:26,743 INFO L481 AbstractCegarLoop]: Abstraction has 3983 states and 16133 transitions. [2020-12-03 01:14:26,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 01:14:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 16133 transitions. [2020-12-03 01:14:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 01:14:26,746 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:26,747 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-03 01:14:26,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-03 01:14:26,747 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-03 01:14:26,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:26,747 INFO L82 PathProgramCache]: Analyzing trace with hash -565771751, now seen corresponding path program 1 times [2020-12-03 01:14:26,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:26,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118633770] [2020-12-03 01:14:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:26,796 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-03 01:14:26,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118633770] [2020-12-03 01:14:26,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:26,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 01:14:26,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096704288] [2020-12-03 01:14:26,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 01:14:26,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:26,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 01:14:26,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 01:14:26,798 INFO L87 Difference]: Start difference. First operand 3983 states and 16133 transitions. Second operand 6 states. [2020-12-03 01:14:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:27,022 INFO L93 Difference]: Finished difference Result 4762 states and 18800 transitions. [2020-12-03 01:14:27,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 01:14:27,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-03 01:14:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:27,038 INFO L225 Difference]: With dead ends: 4762 [2020-12-03 01:14:27,038 INFO L226 Difference]: Without dead ends: 4687 [2020-12-03 01:14:27,039 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-03 01:14:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-03 01:14:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4305. [2020-12-03 01:14:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2020-12-03 01:14:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 17320 transitions. [2020-12-03 01:14:27,157 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 17320 transitions. Word has length 21 [2020-12-03 01:14:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:27,157 INFO L481 AbstractCegarLoop]: Abstraction has 4305 states and 17320 transitions. [2020-12-03 01:14:27,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 01:14:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 17320 transitions. [2020-12-03 01:14:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 01:14:27,163 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:27,163 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-03 01:14:27,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-03 01:14:27,164 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-03 01:14:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:27,164 INFO L82 PathProgramCache]: Analyzing trace with hash 479599707, now seen corresponding path program 2 times [2020-12-03 01:14:27,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:27,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523116398] [2020-12-03 01:14:27,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:27,223 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-03 01:14:27,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523116398] [2020-12-03 01:14:27,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:27,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 01:14:27,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58317534] [2020-12-03 01:14:27,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 01:14:27,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:27,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 01:14:27,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-03 01:14:27,227 INFO L87 Difference]: Start difference. First operand 4305 states and 17320 transitions. Second operand 6 states. [2020-12-03 01:14:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:27,357 INFO L93 Difference]: Finished difference Result 5233 states and 20429 transitions. [2020-12-03 01:14:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 01:14:27,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-03 01:14:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:27,373 INFO L225 Difference]: With dead ends: 5233 [2020-12-03 01:14:27,373 INFO L226 Difference]: Without dead ends: 4707 [2020-12-03 01:14:27,374 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-03 01:14:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4707 states. [2020-12-03 01:14:27,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4707 to 3933. [2020-12-03 01:14:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3933 states. [2020-12-03 01:14:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 15536 transitions. [2020-12-03 01:14:27,489 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 15536 transitions. Word has length 21 [2020-12-03 01:14:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:27,489 INFO L481 AbstractCegarLoop]: Abstraction has 3933 states and 15536 transitions. [2020-12-03 01:14:27,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 01:14:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 15536 transitions. [2020-12-03 01:14:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 01:14:27,493 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:27,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] [2020-12-03 01:14:27,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-03 01:14:27,494 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-03 01:14:27,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:27,494 INFO L82 PathProgramCache]: Analyzing trace with hash -586116813, now seen corresponding path program 1 times [2020-12-03 01:14:27,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:27,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547041670] [2020-12-03 01:14:27,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:27,702 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-03 01:14:27,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547041670] [2020-12-03 01:14:27,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:27,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 01:14:27,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083745647] [2020-12-03 01:14:27,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 01:14:27,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:27,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 01:14:27,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-03 01:14:27,704 INFO L87 Difference]: Start difference. First operand 3933 states and 15536 transitions. Second operand 10 states. [2020-12-03 01:14:28,169 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2020-12-03 01:14:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:28,472 INFO L93 Difference]: Finished difference Result 4734 states and 18567 transitions. [2020-12-03 01:14:28,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 01:14:28,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-12-03 01:14:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:28,483 INFO L225 Difference]: With dead ends: 4734 [2020-12-03 01:14:28,484 INFO L226 Difference]: Without dead ends: 4685 [2020-12-03 01:14:28,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-03 01:14:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2020-12-03 01:14:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 3841. [2020-12-03 01:14:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2020-12-03 01:14:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 15162 transitions. [2020-12-03 01:14:28,560 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 15162 transitions. Word has length 21 [2020-12-03 01:14:28,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:28,560 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 15162 transitions. [2020-12-03 01:14:28,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 01:14:28,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 15162 transitions. [2020-12-03 01:14:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 01:14:28,568 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:28,568 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-03 01:14:28,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-03 01:14:28,569 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-03 01:14:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:28,569 INFO L82 PathProgramCache]: Analyzing trace with hash -757352757, now seen corresponding path program 1 times [2020-12-03 01:14:28,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:28,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570158355] [2020-12-03 01:14:28,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:28,882 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-03 01:14:28,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570158355] [2020-12-03 01:14:28,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:28,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 01:14:28,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133115385] [2020-12-03 01:14:28,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 01:14:28,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:28,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 01:14:28,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-03 01:14:28,884 INFO L87 Difference]: Start difference. First operand 3841 states and 15162 transitions. Second operand 12 states. [2020-12-03 01:14:29,266 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2020-12-03 01:14:29,492 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2020-12-03 01:14:29,618 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-12-03 01:14:29,760 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2020-12-03 01:14:29,907 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-12-03 01:14:30,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:30,249 INFO L93 Difference]: Finished difference Result 5118 states and 20406 transitions. [2020-12-03 01:14:30,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-03 01:14:30,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-03 01:14:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:30,261 INFO L225 Difference]: With dead ends: 5118 [2020-12-03 01:14:30,261 INFO L226 Difference]: Without dead ends: 4964 [2020-12-03 01:14:30,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2020-12-03 01:14:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4964 states. [2020-12-03 01:14:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4964 to 3443. [2020-12-03 01:14:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2020-12-03 01:14:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 13378 transitions. [2020-12-03 01:14:30,333 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 13378 transitions. Word has length 21 [2020-12-03 01:14:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:30,333 INFO L481 AbstractCegarLoop]: Abstraction has 3443 states and 13378 transitions. [2020-12-03 01:14:30,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 01:14:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 13378 transitions. [2020-12-03 01:14:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 01:14:30,336 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:30,336 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-03 01:14:30,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-03 01:14:30,336 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-03 01:14:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:30,337 INFO L82 PathProgramCache]: Analyzing trace with hash 820571943, now seen corresponding path program 2 times [2020-12-03 01:14:30,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:30,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907497461] [2020-12-03 01:14:30,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:30,600 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-03 01:14:30,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907497461] [2020-12-03 01:14:30,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:30,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 01:14:30,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583018796] [2020-12-03 01:14:30,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 01:14:30,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:30,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 01:14:30,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-03 01:14:30,602 INFO L87 Difference]: Start difference. First operand 3443 states and 13378 transitions. Second operand 12 states. [2020-12-03 01:14:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:31,312 INFO L93 Difference]: Finished difference Result 4562 states and 17491 transitions. [2020-12-03 01:14:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 01:14:31,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-03 01:14:31,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:31,322 INFO L225 Difference]: With dead ends: 4562 [2020-12-03 01:14:31,323 INFO L226 Difference]: Without dead ends: 4510 [2020-12-03 01:14:31,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-03 01:14:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2020-12-03 01:14:31,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 3368. [2020-12-03 01:14:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3368 states. [2020-12-03 01:14:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 12841 transitions. [2020-12-03 01:14:31,399 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 12841 transitions. Word has length 21 [2020-12-03 01:14:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:31,399 INFO L481 AbstractCegarLoop]: Abstraction has 3368 states and 12841 transitions. [2020-12-03 01:14:31,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 01:14:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 12841 transitions. [2020-12-03 01:14:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 01:14:31,402 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:31,403 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-03 01:14:31,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-03 01:14:31,403 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-03 01:14:31,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1673753334, now seen corresponding path program 1 times [2020-12-03 01:14:31,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:31,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210565739] [2020-12-03 01:14:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:31,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-03 01:14:31,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210565739] [2020-12-03 01:14:31,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:31,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-03 01:14:31,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778866816] [2020-12-03 01:14:31,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 01:14:31,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:31,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 01:14:31,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-03 01:14:31,481 INFO L87 Difference]: Start difference. First operand 3368 states and 12841 transitions. Second operand 7 states. [2020-12-03 01:14:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:31,599 INFO L93 Difference]: Finished difference Result 3879 states and 14497 transitions. [2020-12-03 01:14:31,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 01:14:31,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-03 01:14:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:31,607 INFO L225 Difference]: With dead ends: 3879 [2020-12-03 01:14:31,607 INFO L226 Difference]: Without dead ends: 3785 [2020-12-03 01:14:31,607 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-03 01:14:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2020-12-03 01:14:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3369. [2020-12-03 01:14:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3369 states. [2020-12-03 01:14:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 12845 transitions. [2020-12-03 01:14:31,670 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 12845 transitions. Word has length 21 [2020-12-03 01:14:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:31,671 INFO L481 AbstractCegarLoop]: Abstraction has 3369 states and 12845 transitions. [2020-12-03 01:14:31,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 01:14:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 12845 transitions. [2020-12-03 01:14:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 01:14:31,674 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:31,675 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-03 01:14:31,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-03 01:14:31,675 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-03 01:14:31,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:31,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1208728268, now seen corresponding path program 1 times [2020-12-03 01:14:31,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:31,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350861820] [2020-12-03 01:14:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:31,977 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-03 01:14:31,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350861820] [2020-12-03 01:14:31,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:31,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 01:14:31,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500945852] [2020-12-03 01:14:31,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 01:14:31,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:31,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 01:14:31,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-03 01:14:31,980 INFO L87 Difference]: Start difference. First operand 3369 states and 12845 transitions. Second operand 11 states. [2020-12-03 01:14:32,435 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-12-03 01:14:32,678 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-12-03 01:14:32,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:32,994 INFO L93 Difference]: Finished difference Result 4138 states and 15694 transitions. [2020-12-03 01:14:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 01:14:32,995 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-12-03 01:14:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:33,004 INFO L225 Difference]: With dead ends: 4138 [2020-12-03 01:14:33,005 INFO L226 Difference]: Without dead ends: 4089 [2020-12-03 01:14:33,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-12-03 01:14:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2020-12-03 01:14:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 3004. [2020-12-03 01:14:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2020-12-03 01:14:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 11303 transitions. [2020-12-03 01:14:33,087 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 11303 transitions. Word has length 21 [2020-12-03 01:14:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:33,087 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 11303 transitions. [2020-12-03 01:14:33,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 01:14:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 11303 transitions. [2020-12-03 01:14:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 01:14:33,090 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:33,090 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-03 01:14:33,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-03 01:14:33,091 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-03 01:14:33,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:33,091 INFO L82 PathProgramCache]: Analyzing trace with hash 172061386, now seen corresponding path program 2 times [2020-12-03 01:14:33,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:33,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947699658] [2020-12-03 01:14:33,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:33,194 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-03 01:14:33,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947699658] [2020-12-03 01:14:33,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:33,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 01:14:33,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047136759] [2020-12-03 01:14:33,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 01:14:33,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:33,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 01:14:33,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-03 01:14:33,197 INFO L87 Difference]: Start difference. First operand 3004 states and 11303 transitions. Second operand 8 states. [2020-12-03 01:14:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:33,386 INFO L93 Difference]: Finished difference Result 3058 states and 11357 transitions. [2020-12-03 01:14:33,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 01:14:33,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-12-03 01:14:33,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:33,394 INFO L225 Difference]: With dead ends: 3058 [2020-12-03 01:14:33,394 INFO L226 Difference]: Without dead ends: 3058 [2020-12-03 01:14:33,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-03 01:14:33,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-12-03 01:14:33,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2831. [2020-12-03 01:14:33,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-12-03 01:14:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-12-03 01:14:33,445 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-12-03 01:14:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:33,445 INFO L481 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-12-03 01:14:33,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 01:14:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-12-03 01:14:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 01:14:33,448 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:33,448 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-03 01:14:33,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-03 01:14:33,449 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-03 01:14:33,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:33,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1320448504, now seen corresponding path program 1 times [2020-12-03 01:14:33,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:33,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503525419] [2020-12-03 01:14:33,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:33,562 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-03 01:14:33,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503525419] [2020-12-03 01:14:33,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:33,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 01:14:33,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553955509] [2020-12-03 01:14:33,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 01:14:33,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:33,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 01:14:33,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-03 01:14:33,566 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2020-12-03 01:14:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:33,945 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2020-12-03 01:14:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 01:14:33,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-12-03 01:14:33,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:33,955 INFO L225 Difference]: With dead ends: 3550 [2020-12-03 01:14:33,955 INFO L226 Difference]: Without dead ends: 3490 [2020-12-03 01:14:33,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-03 01:14:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2020-12-03 01:14:33,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2020-12-03 01:14:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2020-12-03 01:14:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2020-12-03 01:14:34,006 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2020-12-03 01:14:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:34,006 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2020-12-03 01:14:34,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 01:14:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2020-12-03 01:14:34,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 01:14:34,009 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:34,009 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-03 01:14:34,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-03 01:14:34,010 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-03 01:14:34,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:34,010 INFO L82 PathProgramCache]: Analyzing trace with hash -893918318, now seen corresponding path program 2 times [2020-12-03 01:14:34,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:34,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573020284] [2020-12-03 01:14:34,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:34,137 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-03 01:14:34,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573020284] [2020-12-03 01:14:34,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:34,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 01:14:34,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309055527] [2020-12-03 01:14:34,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-03 01:14:34,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:34,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-03 01:14:34,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-03 01:14:34,139 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2020-12-03 01:14:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:34,585 INFO L93 Difference]: Finished difference Result 3862 states and 14252 transitions. [2020-12-03 01:14:34,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 01:14:34,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-12-03 01:14:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:34,597 INFO L225 Difference]: With dead ends: 3862 [2020-12-03 01:14:34,598 INFO L226 Difference]: Without dead ends: 3802 [2020-12-03 01:14:34,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-03 01:14:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2020-12-03 01:14:34,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2822. [2020-12-03 01:14:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-12-03 01:14:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-12-03 01:14:34,678 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-12-03 01:14:34,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:34,679 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-12-03 01:14:34,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-03 01:14:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-12-03 01:14:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 01:14:34,681 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:34,682 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-03 01:14:34,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-03 01:14:34,682 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-03 01:14:34,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:34,683 INFO L82 PathProgramCache]: Analyzing trace with hash 131153448, now seen corresponding path program 3 times [2020-12-03 01:14:34,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:34,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103799507] [2020-12-03 01:14:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:34,816 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-03 01:14:34,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103799507] [2020-12-03 01:14:34,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:34,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 01:14:34,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015916732] [2020-12-03 01:14:34,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 01:14:34,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:34,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 01:14:34,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-03 01:14:34,818 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2020-12-03 01:14:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:35,341 INFO L93 Difference]: Finished difference Result 4277 states and 15941 transitions. [2020-12-03 01:14:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 01:14:35,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-03 01:14:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:35,352 INFO L225 Difference]: With dead ends: 4277 [2020-12-03 01:14:35,352 INFO L226 Difference]: Without dead ends: 4217 [2020-12-03 01:14:35,353 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-12-03 01:14:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2020-12-03 01:14:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 2818. [2020-12-03 01:14:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2020-12-03 01:14:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 10596 transitions. [2020-12-03 01:14:35,438 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 10596 transitions. Word has length 22 [2020-12-03 01:14:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:35,439 INFO L481 AbstractCegarLoop]: Abstraction has 2818 states and 10596 transitions. [2020-12-03 01:14:35,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 01:14:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 10596 transitions. [2020-12-03 01:14:35,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 01:14:35,441 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:35,441 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-03 01:14:35,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-03 01:14:35,442 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-03 01:14:35,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:35,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1026439080, now seen corresponding path program 4 times [2020-12-03 01:14:35,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:35,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910494329] [2020-12-03 01:14:35,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:35,559 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-03 01:14:35,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910494329] [2020-12-03 01:14:35,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:35,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 01:14:35,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633869077] [2020-12-03 01:14:35,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 01:14:35,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:35,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 01:14:35,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-03 01:14:35,560 INFO L87 Difference]: Start difference. First operand 2818 states and 10596 transitions. Second operand 10 states. [2020-12-03 01:14:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:35,865 INFO L93 Difference]: Finished difference Result 3433 states and 12660 transitions. [2020-12-03 01:14:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:14:35,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-03 01:14:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:35,875 INFO L225 Difference]: With dead ends: 3433 [2020-12-03 01:14:35,876 INFO L226 Difference]: Without dead ends: 3373 [2020-12-03 01:14:35,876 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-03 01:14:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2020-12-03 01:14:35,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 2730. [2020-12-03 01:14:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2020-12-03 01:14:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10232 transitions. [2020-12-03 01:14:35,937 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10232 transitions. Word has length 22 [2020-12-03 01:14:35,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:35,937 INFO L481 AbstractCegarLoop]: Abstraction has 2730 states and 10232 transitions. [2020-12-03 01:14:35,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 01:14:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10232 transitions. [2020-12-03 01:14:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 01:14:35,939 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:35,939 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-03 01:14:35,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-03 01:14:35,939 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-03 01:14:35,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:35,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1544480782, now seen corresponding path program 5 times [2020-12-03 01:14:35,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:35,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673077392] [2020-12-03 01:14:35,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:36,240 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-03 01:14:36,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673077392] [2020-12-03 01:14:36,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:36,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 01:14:36,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117997997] [2020-12-03 01:14:36,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 01:14:36,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:36,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 01:14:36,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-03 01:14:36,242 INFO L87 Difference]: Start difference. First operand 2730 states and 10232 transitions. Second operand 12 states. [2020-12-03 01:14:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:36,752 INFO L93 Difference]: Finished difference Result 3588 states and 13121 transitions. [2020-12-03 01:14:36,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:14:36,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-03 01:14:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:36,761 INFO L225 Difference]: With dead ends: 3588 [2020-12-03 01:14:36,761 INFO L226 Difference]: Without dead ends: 3528 [2020-12-03 01:14:36,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-12-03 01:14:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2020-12-03 01:14:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2670. [2020-12-03 01:14:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-12-03 01:14:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2020-12-03 01:14:36,810 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2020-12-03 01:14:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:36,810 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2020-12-03 01:14:36,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 01:14:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2020-12-03 01:14:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-03 01:14:36,812 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:36,812 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-03 01:14:36,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-03 01:14:36,813 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-03 01:14:36,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:36,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1499150017, now seen corresponding path program 1 times [2020-12-03 01:14:36,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:36,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668220659] [2020-12-03 01:14:36,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:37,196 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-03 01:14:37,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668220659] [2020-12-03 01:14:37,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:37,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 01:14:37,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878589135] [2020-12-03 01:14:37,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 01:14:37,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:37,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 01:14:37,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-03 01:14:37,199 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2020-12-03 01:14:37,718 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-12-03 01:14:37,852 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-12-03 01:14:38,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:38,203 INFO L93 Difference]: Finished difference Result 2896 states and 10368 transitions. [2020-12-03 01:14:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-03 01:14:38,204 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-03 01:14:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:38,212 INFO L225 Difference]: With dead ends: 2896 [2020-12-03 01:14:38,212 INFO L226 Difference]: Without dead ends: 2802 [2020-12-03 01:14:38,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2020-12-03 01:14:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2020-12-03 01:14:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2426. [2020-12-03 01:14:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2020-12-03 01:14:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 8840 transitions. [2020-12-03 01:14:38,258 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 8840 transitions. Word has length 23 [2020-12-03 01:14:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:38,259 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 8840 transitions. [2020-12-03 01:14:38,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 01:14:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 8840 transitions. [2020-12-03 01:14:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-03 01:14:38,261 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:38,261 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-03 01:14:38,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-03 01:14:38,261 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-03 01:14:38,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:38,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1292151056, now seen corresponding path program 1 times [2020-12-03 01:14:38,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:38,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833991292] [2020-12-03 01:14:38,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:38,618 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-03 01:14:38,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833991292] [2020-12-03 01:14:38,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:38,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 01:14:38,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295018133] [2020-12-03 01:14:38,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 01:14:38,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:38,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 01:14:38,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-03 01:14:38,621 INFO L87 Difference]: Start difference. First operand 2426 states and 8840 transitions. Second operand 12 states. [2020-12-03 01:14:39,102 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-12-03 01:14:39,263 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2020-12-03 01:14:39,404 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2020-12-03 01:14:39,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:39,650 INFO L93 Difference]: Finished difference Result 2538 states and 8863 transitions. [2020-12-03 01:14:39,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-03 01:14:39,651 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-03 01:14:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:39,658 INFO L225 Difference]: With dead ends: 2538 [2020-12-03 01:14:39,658 INFO L226 Difference]: Without dead ends: 2419 [2020-12-03 01:14:39,658 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-12-03 01:14:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2020-12-03 01:14:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1794. [2020-12-03 01:14:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-12-03 01:14:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2020-12-03 01:14:39,699 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2020-12-03 01:14:39,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:39,700 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2020-12-03 01:14:39,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 01:14:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2020-12-03 01:14:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 01:14:39,702 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:39,702 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-03 01:14:39,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-03 01:14:39,702 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-03 01:14:39,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:39,703 INFO L82 PathProgramCache]: Analyzing trace with hash -974214744, now seen corresponding path program 1 times [2020-12-03 01:14:39,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:39,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539048119] [2020-12-03 01:14:39,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:39,755 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-03 01:14:39,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539048119] [2020-12-03 01:14:39,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:39,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-03 01:14:39,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521740005] [2020-12-03 01:14:39,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 01:14:39,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:39,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 01:14:39,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 01:14:39,757 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 6 states. [2020-12-03 01:14:39,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:39,991 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2020-12-03 01:14:39,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 01:14:39,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-12-03 01:14:39,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:39,997 INFO L225 Difference]: With dead ends: 2291 [2020-12-03 01:14:39,997 INFO L226 Difference]: Without dead ends: 2227 [2020-12-03 01:14:39,997 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-03 01:14:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2020-12-03 01:14:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2020-12-03 01:14:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-12-03 01:14:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2020-12-03 01:14:40,036 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2020-12-03 01:14:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:40,037 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2020-12-03 01:14:40,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 01:14:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2020-12-03 01:14:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 01:14:40,039 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:40,039 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-03 01:14:40,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-03 01:14:40,040 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-03 01:14:40,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:40,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1120972762, now seen corresponding path program 2 times [2020-12-03 01:14:40,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:40,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937262329] [2020-12-03 01:14:40,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:40,159 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-03 01:14:40,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937262329] [2020-12-03 01:14:40,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:40,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 01:14:40,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776779090] [2020-12-03 01:14:40,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 01:14:40,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:40,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 01:14:40,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-03 01:14:40,161 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 8 states. [2020-12-03 01:14:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:40,656 INFO L93 Difference]: Finished difference Result 2599 states and 8709 transitions. [2020-12-03 01:14:40,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 01:14:40,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-03 01:14:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:40,662 INFO L225 Difference]: With dead ends: 2599 [2020-12-03 01:14:40,663 INFO L226 Difference]: Without dead ends: 2535 [2020-12-03 01:14:40,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-03 01:14:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2020-12-03 01:14:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2102. [2020-12-03 01:14:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-12-03 01:14:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7273 transitions. [2020-12-03 01:14:40,706 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7273 transitions. Word has length 24 [2020-12-03 01:14:40,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:40,706 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7273 transitions. [2020-12-03 01:14:40,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 01:14:40,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7273 transitions. [2020-12-03 01:14:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 01:14:40,709 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:40,709 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-03 01:14:40,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-03 01:14:40,709 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-03 01:14:40,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:40,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1176290112, now seen corresponding path program 3 times [2020-12-03 01:14:40,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:40,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552620062] [2020-12-03 01:14:40,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:40,833 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-03 01:14:40,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552620062] [2020-12-03 01:14:40,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:40,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 01:14:40,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780526363] [2020-12-03 01:14:40,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-03 01:14:40,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:40,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-03 01:14:40,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-03 01:14:40,835 INFO L87 Difference]: Start difference. First operand 2102 states and 7273 transitions. Second operand 9 states. [2020-12-03 01:14:41,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:41,288 INFO L93 Difference]: Finished difference Result 2898 states and 9677 transitions. [2020-12-03 01:14:41,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 01:14:41,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-12-03 01:14:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:41,295 INFO L225 Difference]: With dead ends: 2898 [2020-12-03 01:14:41,295 INFO L226 Difference]: Without dead ends: 2834 [2020-12-03 01:14:41,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-03 01:14:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2020-12-03 01:14:41,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2093. [2020-12-03 01:14:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2020-12-03 01:14:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 7255 transitions. [2020-12-03 01:14:41,327 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 7255 transitions. Word has length 24 [2020-12-03 01:14:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:41,328 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 7255 transitions. [2020-12-03 01:14:41,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-03 01:14:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 7255 transitions. [2020-12-03 01:14:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 01:14:41,330 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:41,330 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-03 01:14:41,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-03 01:14:41,330 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-03 01:14:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:41,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1572220842, now seen corresponding path program 4 times [2020-12-03 01:14:41,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:41,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032996389] [2020-12-03 01:14:41,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:41,482 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-03 01:14:41,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032996389] [2020-12-03 01:14:41,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:41,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-03 01:14:41,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951306753] [2020-12-03 01:14:41,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 01:14:41,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:41,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 01:14:41,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-03 01:14:41,483 INFO L87 Difference]: Start difference. First operand 2093 states and 7255 transitions. Second operand 10 states. [2020-12-03 01:14:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:41,982 INFO L93 Difference]: Finished difference Result 2875 states and 9618 transitions. [2020-12-03 01:14:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 01:14:41,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-12-03 01:14:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:41,990 INFO L225 Difference]: With dead ends: 2875 [2020-12-03 01:14:41,990 INFO L226 Difference]: Without dead ends: 2811 [2020-12-03 01:14:41,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-12-03 01:14:41,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2020-12-03 01:14:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2079. [2020-12-03 01:14:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2020-12-03 01:14:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 7214 transitions. [2020-12-03 01:14:42,041 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 7214 transitions. Word has length 24 [2020-12-03 01:14:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:42,041 INFO L481 AbstractCegarLoop]: Abstraction has 2079 states and 7214 transitions. [2020-12-03 01:14:42,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 01:14:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 7214 transitions. [2020-12-03 01:14:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 01:14:42,044 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:42,044 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-03 01:14:42,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-03 01:14:42,045 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-03 01:14:42,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:42,045 INFO L82 PathProgramCache]: Analyzing trace with hash 438749216, now seen corresponding path program 5 times [2020-12-03 01:14:42,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:42,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741381757] [2020-12-03 01:14:42,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:42,187 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-03 01:14:42,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741381757] [2020-12-03 01:14:42,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:42,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 01:14:42,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089226792] [2020-12-03 01:14:42,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 01:14:42,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:42,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 01:14:42,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-03 01:14:42,188 INFO L87 Difference]: Start difference. First operand 2079 states and 7214 transitions. Second operand 11 states. [2020-12-03 01:14:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:42,535 INFO L93 Difference]: Finished difference Result 3106 states and 10587 transitions. [2020-12-03 01:14:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 01:14:42,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-03 01:14:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:42,545 INFO L225 Difference]: With dead ends: 3106 [2020-12-03 01:14:42,546 INFO L226 Difference]: Without dead ends: 3042 [2020-12-03 01:14:42,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-12-03 01:14:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2020-12-03 01:14:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2071. [2020-12-03 01:14:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2020-12-03 01:14:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7186 transitions. [2020-12-03 01:14:42,601 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7186 transitions. Word has length 24 [2020-12-03 01:14:42,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:42,601 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 7186 transitions. [2020-12-03 01:14:42,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 01:14:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7186 transitions. [2020-12-03 01:14:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 01:14:42,604 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:42,604 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-03 01:14:42,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-03 01:14:42,604 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-03 01:14:42,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:42,605 INFO L82 PathProgramCache]: Analyzing trace with hash 991769996, now seen corresponding path program 6 times [2020-12-03 01:14:42,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:42,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528860820] [2020-12-03 01:14:42,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:42,754 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-03 01:14:42,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528860820] [2020-12-03 01:14:42,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:42,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-03 01:14:42,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753988188] [2020-12-03 01:14:42,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 01:14:42,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:42,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 01:14:42,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-03 01:14:42,758 INFO L87 Difference]: Start difference. First operand 2071 states and 7186 transitions. Second operand 11 states. [2020-12-03 01:14:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:43,051 INFO L93 Difference]: Finished difference Result 2481 states and 8355 transitions. [2020-12-03 01:14:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:14:43,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-03 01:14:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:43,058 INFO L225 Difference]: With dead ends: 2481 [2020-12-03 01:14:43,058 INFO L226 Difference]: Without dead ends: 2417 [2020-12-03 01:14:43,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2020-12-03 01:14:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2020-12-03 01:14:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2039. [2020-12-03 01:14:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2020-12-03 01:14:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 7058 transitions. [2020-12-03 01:14:43,107 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 7058 transitions. Word has length 24 [2020-12-03 01:14:43,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:43,109 INFO L481 AbstractCegarLoop]: Abstraction has 2039 states and 7058 transitions. [2020-12-03 01:14:43,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 01:14:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 7058 transitions. [2020-12-03 01:14:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 01:14:43,112 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:43,112 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-03 01:14:43,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-03 01:14:43,112 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-03 01:14:43,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:43,113 INFO L82 PathProgramCache]: Analyzing trace with hash 71780478, now seen corresponding path program 7 times [2020-12-03 01:14:43,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:43,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065698499] [2020-12-03 01:14:43,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:43,456 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-03 01:14:43,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065698499] [2020-12-03 01:14:43,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:43,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-03 01:14:43,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683876289] [2020-12-03 01:14:43,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-03 01:14:43,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:43,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-03 01:14:43,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-12-03 01:14:43,458 INFO L87 Difference]: Start difference. First operand 2039 states and 7058 transitions. Second operand 13 states. [2020-12-03 01:14:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:44,541 INFO L93 Difference]: Finished difference Result 3018 states and 10169 transitions. [2020-12-03 01:14:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 01:14:44,542 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-12-03 01:14:44,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:44,548 INFO L225 Difference]: With dead ends: 3018 [2020-12-03 01:14:44,548 INFO L226 Difference]: Without dead ends: 2890 [2020-12-03 01:14:44,549 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-03 01:14:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-12-03 01:14:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1971. [2020-12-03 01:14:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2020-12-03 01:14:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 6882 transitions. [2020-12-03 01:14:44,582 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 6882 transitions. Word has length 24 [2020-12-03 01:14:44,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:44,583 INFO L481 AbstractCegarLoop]: Abstraction has 1971 states and 6882 transitions. [2020-12-03 01:14:44,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-03 01:14:44,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 6882 transitions. [2020-12-03 01:14:44,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-03 01:14:44,585 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:44,585 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-03 01:14:44,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-03 01:14:44,585 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-03 01:14:44,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:44,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1318319474, now seen corresponding path program 1 times [2020-12-03 01:14:44,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:44,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346996532] [2020-12-03 01:14:44,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:44,862 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-03 01:14:44,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346996532] [2020-12-03 01:14:44,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:44,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 01:14:44,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468900870] [2020-12-03 01:14:44,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 01:14:44,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:44,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 01:14:44,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-03 01:14:44,863 INFO L87 Difference]: Start difference. First operand 1971 states and 6882 transitions. Second operand 12 states. [2020-12-03 01:14:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:45,317 INFO L93 Difference]: Finished difference Result 3157 states and 10632 transitions. [2020-12-03 01:14:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 01:14:45,318 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-12-03 01:14:45,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:45,325 INFO L225 Difference]: With dead ends: 3157 [2020-12-03 01:14:45,325 INFO L226 Difference]: Without dead ends: 3133 [2020-12-03 01:14:45,326 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-03 01:14:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2020-12-03 01:14:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 1613. [2020-12-03 01:14:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2020-12-03 01:14:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5563 transitions. [2020-12-03 01:14:45,357 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5563 transitions. Word has length 24 [2020-12-03 01:14:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:45,358 INFO L481 AbstractCegarLoop]: Abstraction has 1613 states and 5563 transitions. [2020-12-03 01:14:45,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 01:14:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5563 transitions. [2020-12-03 01:14:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-03 01:14:45,360 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:45,360 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-03 01:14:45,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-03 01:14:45,361 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-03 01:14:45,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:45,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1290250801, now seen corresponding path program 1 times [2020-12-03 01:14:45,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:45,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534816038] [2020-12-03 01:14:45,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:45,592 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-03 01:14:45,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534816038] [2020-12-03 01:14:45,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:45,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 01:14:45,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497319905] [2020-12-03 01:14:45,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 01:14:45,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:45,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 01:14:45,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-03 01:14:45,593 INFO L87 Difference]: Start difference. First operand 1613 states and 5563 transitions. Second operand 12 states. [2020-12-03 01:14:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:46,342 INFO L93 Difference]: Finished difference Result 2298 states and 7608 transitions. [2020-12-03 01:14:46,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 01:14:46,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-03 01:14:46,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:46,347 INFO L225 Difference]: With dead ends: 2298 [2020-12-03 01:14:46,347 INFO L226 Difference]: Without dead ends: 2254 [2020-12-03 01:14:46,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2020-12-03 01:14:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2020-12-03 01:14:46,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1611. [2020-12-03 01:14:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2020-12-03 01:14:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 5567 transitions. [2020-12-03 01:14:46,384 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 5567 transitions. Word has length 26 [2020-12-03 01:14:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:46,385 INFO L481 AbstractCegarLoop]: Abstraction has 1611 states and 5567 transitions. [2020-12-03 01:14:46,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 01:14:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 5567 transitions. [2020-12-03 01:14:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-03 01:14:46,388 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:46,388 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-03 01:14:46,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-03 01:14:46,388 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-03 01:14:46,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:46,388 INFO L82 PathProgramCache]: Analyzing trace with hash -943856693, now seen corresponding path program 2 times [2020-12-03 01:14:46,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:46,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299406465] [2020-12-03 01:14:46,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:46,596 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-03 01:14:46,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299406465] [2020-12-03 01:14:46,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:46,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 01:14:46,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611384553] [2020-12-03 01:14:46,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 01:14:46,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:46,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 01:14:46,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-03 01:14:46,598 INFO L87 Difference]: Start difference. First operand 1611 states and 5567 transitions. Second operand 12 states. [2020-12-03 01:14:47,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:47,120 INFO L93 Difference]: Finished difference Result 2242 states and 7477 transitions. [2020-12-03 01:14:47,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 01:14:47,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-03 01:14:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:47,126 INFO L225 Difference]: With dead ends: 2242 [2020-12-03 01:14:47,126 INFO L226 Difference]: Without dead ends: 2198 [2020-12-03 01:14:47,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-03 01:14:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2020-12-03 01:14:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1587. [2020-12-03 01:14:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-12-03 01:14:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 5509 transitions. [2020-12-03 01:14:47,155 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 5509 transitions. Word has length 26 [2020-12-03 01:14:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:47,156 INFO L481 AbstractCegarLoop]: Abstraction has 1587 states and 5509 transitions. [2020-12-03 01:14:47,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 01:14:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 5509 transitions. [2020-12-03 01:14:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-03 01:14:47,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:47,163 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-03 01:14:47,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-03 01:14:47,163 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-03 01:14:47,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:47,164 INFO L82 PathProgramCache]: Analyzing trace with hash -390835913, now seen corresponding path program 3 times [2020-12-03 01:14:47,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:47,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567532474] [2020-12-03 01:14:47,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:47,391 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-03 01:14:47,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567532474] [2020-12-03 01:14:47,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:47,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 01:14:47,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356402665] [2020-12-03 01:14:47,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 01:14:47,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:47,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 01:14:47,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-03 01:14:47,393 INFO L87 Difference]: Start difference. First operand 1587 states and 5509 transitions. Second operand 12 states. [2020-12-03 01:14:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:47,862 INFO L93 Difference]: Finished difference Result 1640 states and 5473 transitions. [2020-12-03 01:14:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 01:14:47,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-03 01:14:47,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:47,867 INFO L225 Difference]: With dead ends: 1640 [2020-12-03 01:14:47,867 INFO L226 Difference]: Without dead ends: 1596 [2020-12-03 01:14:47,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-03 01:14:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2020-12-03 01:14:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 885. [2020-12-03 01:14:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-03 01:14:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-12-03 01:14:47,883 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-12-03 01:14:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:47,883 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-12-03 01:14:47,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 01:14:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-12-03 01:14:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-03 01:14:47,886 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:47,886 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-03 01:14:47,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-03 01:14:47,886 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-03 01:14:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1977826857, now seen corresponding path program 1 times [2020-12-03 01:14:47,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:47,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63363115] [2020-12-03 01:14:47,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:48,044 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-03 01:14:48,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63363115] [2020-12-03 01:14:48,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:48,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 01:14:48,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690820387] [2020-12-03 01:14:48,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 01:14:48,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:48,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 01:14:48,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-03 01:14:48,047 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-12-03 01:14:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:48,299 INFO L93 Difference]: Finished difference Result 885 states and 3021 transitions. [2020-12-03 01:14:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:14:48,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-03 01:14:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:48,303 INFO L225 Difference]: With dead ends: 885 [2020-12-03 01:14:48,303 INFO L226 Difference]: Without dead ends: 885 [2020-12-03 01:14:48,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-03 01:14:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2020-12-03 01:14:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2020-12-03 01:14:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-03 01:14:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3021 transitions. [2020-12-03 01:14:48,317 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3021 transitions. Word has length 41 [2020-12-03 01:14:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:48,318 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3021 transitions. [2020-12-03 01:14:48,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 01:14:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3021 transitions. [2020-12-03 01:14:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-03 01:14:48,320 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:48,320 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-03 01:14:48,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-03 01:14:48,320 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-03 01:14:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:48,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1154622732, now seen corresponding path program 1 times [2020-12-03 01:14:48,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:48,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190002571] [2020-12-03 01:14:48,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:48,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-03 01:14:48,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190002571] [2020-12-03 01:14:48,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:48,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 01:14:48,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973636437] [2020-12-03 01:14:48,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 01:14:48,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:48,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 01:14:48,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-03 01:14:48,400 INFO L87 Difference]: Start difference. First operand 885 states and 3021 transitions. Second operand 7 states. [2020-12-03 01:14:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:48,560 INFO L93 Difference]: Finished difference Result 885 states and 3017 transitions. [2020-12-03 01:14:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:14:48,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-03 01:14:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:48,563 INFO L225 Difference]: With dead ends: 885 [2020-12-03 01:14:48,563 INFO L226 Difference]: Without dead ends: 741 [2020-12-03 01:14:48,564 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-03 01:14:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-03 01:14:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-03 01:14:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-03 01:14:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2489 transitions. [2020-12-03 01:14:48,575 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2489 transitions. Word has length 41 [2020-12-03 01:14:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:48,575 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2489 transitions. [2020-12-03 01:14:48,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 01:14:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2489 transitions. [2020-12-03 01:14:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-03 01:14:48,577 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:48,577 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-03 01:14:48,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-03 01:14:48,577 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-03 01:14:48,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:48,578 INFO L82 PathProgramCache]: Analyzing trace with hash -267308717, now seen corresponding path program 1 times [2020-12-03 01:14:48,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:48,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664367785] [2020-12-03 01:14:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:48,733 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-03 01:14:48,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664367785] [2020-12-03 01:14:48,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:48,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 01:14:48,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376421926] [2020-12-03 01:14:48,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 01:14:48,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:48,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 01:14:48,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-03 01:14:48,736 INFO L87 Difference]: Start difference. First operand 741 states and 2489 transitions. Second operand 8 states. [2020-12-03 01:14:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:48,942 INFO L93 Difference]: Finished difference Result 741 states and 2481 transitions. [2020-12-03 01:14:48,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:14:48,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-03 01:14:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:48,945 INFO L225 Difference]: With dead ends: 741 [2020-12-03 01:14:48,945 INFO L226 Difference]: Without dead ends: 741 [2020-12-03 01:14:48,945 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-03 01:14:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-03 01:14:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-03 01:14:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-03 01:14:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2481 transitions. [2020-12-03 01:14:48,956 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2481 transitions. Word has length 41 [2020-12-03 01:14:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:48,956 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2481 transitions. [2020-12-03 01:14:48,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 01:14:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2481 transitions. [2020-12-03 01:14:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-03 01:14:48,958 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:48,958 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-03 01:14:48,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-03 01:14:48,959 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-03 01:14:48,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:48,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1194300753, now seen corresponding path program 1 times [2020-12-03 01:14:48,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:48,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757206976] [2020-12-03 01:14:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:14:49,053 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-03 01:14:49,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757206976] [2020-12-03 01:14:49,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:14:49,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 01:14:49,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090546664] [2020-12-03 01:14:49,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 01:14:49,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:14:49,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 01:14:49,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-03 01:14:49,056 INFO L87 Difference]: Start difference. First operand 741 states and 2481 transitions. Second operand 7 states. [2020-12-03 01:14:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:14:49,178 INFO L93 Difference]: Finished difference Result 741 states and 2477 transitions. [2020-12-03 01:14:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:14:49,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-03 01:14:49,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:14:49,180 INFO L225 Difference]: With dead ends: 741 [2020-12-03 01:14:49,181 INFO L226 Difference]: Without dead ends: 495 [2020-12-03 01:14:49,181 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-03 01:14:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-12-03 01:14:49,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2020-12-03 01:14:49,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2020-12-03 01:14:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1606 transitions. [2020-12-03 01:14:49,192 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1606 transitions. Word has length 41 [2020-12-03 01:14:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:14:49,193 INFO L481 AbstractCegarLoop]: Abstraction has 495 states and 1606 transitions. [2020-12-03 01:14:49,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 01:14:49,193 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1606 transitions. [2020-12-03 01:14:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-03 01:14:49,195 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:14:49,195 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-03 01:14:49,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-03 01:14:49,195 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-03 01:14:49,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:14:49,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1766059350, now seen corresponding path program 1 times [2020-12-03 01:14:49,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:14:49,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165974496] [2020-12-03 01:14:49,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:14:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 01:14:49,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 01:14:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 01:14:49,259 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 01:14:49,314 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-03 01:14:49,315 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-03 01:14:49,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-03 01:14:49,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:14:49 BasicIcfg [2020-12-03 01:14:49,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 01:14:49,478 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 01:14:49,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 01:14:49,479 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 01:14:49,479 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:14:00" (3/4) ... [2020-12-03 01:14:49,482 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-03 01:14:49,576 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-03 01:14:49,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 01:14:49,577 INFO L168 Benchmark]: Toolchain (without parser) took 50771.26 ms. Allocated memory was 46.1 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 29.9 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 269.8 MB. Max. memory is 16.1 GB. [2020-12-03 01:14:49,578 INFO L168 Benchmark]: CDTParser took 0.85 ms. Allocated memory is still 46.1 MB. Free memory was 26.8 MB in the beginning and 26.7 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 01:14:49,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 989.30 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 29.6 MB in the beginning and 25.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 17.0 MB. Max. memory is 16.1 GB. [2020-12-03 01:14:49,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.29 ms. Allocated memory is still 56.6 MB. Free memory was 25.9 MB in the beginning and 38.0 MB in the end (delta: -12.1 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. [2020-12-03 01:14:49,579 INFO L168 Benchmark]: Boogie Preprocessor took 65.66 ms. Allocated memory is still 56.6 MB. Free memory was 38.0 MB in the beginning and 36.4 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 01:14:49,580 INFO L168 Benchmark]: RCFGBuilder took 600.57 ms. Allocated memory is still 56.6 MB. Free memory was 36.4 MB in the beginning and 25.1 MB in the end (delta: 11.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 16.1 GB. [2020-12-03 01:14:49,580 INFO L168 Benchmark]: TraceAbstraction took 48942.89 ms. Allocated memory was 56.6 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 24.7 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 234.5 MB. Max. memory is 16.1 GB. [2020-12-03 01:14:49,581 INFO L168 Benchmark]: Witness Printer took 98.26 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-03 01:14:49,583 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.85 ms. Allocated memory is still 46.1 MB. Free memory was 26.8 MB in the beginning and 26.7 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 989.30 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 29.6 MB in the beginning and 25.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 17.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.29 ms. Allocated memory is still 56.6 MB. Free memory was 25.9 MB in the beginning and 38.0 MB in the end (delta: -12.1 MB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 65.66 ms. Allocated memory is still 56.6 MB. Free memory was 38.0 MB in the beginning and 36.4 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 600.57 ms. Allocated memory is still 56.6 MB. Free memory was 36.4 MB in the beginning and 25.1 MB in the end (delta: 11.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 48942.89 ms. Allocated memory was 56.6 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 24.7 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 234.5 MB. Max. memory is 16.1 GB. * Witness Printer took 98.26 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB 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.4s, 1145 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.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: 48.4s, OverallIterations: 53, TraceHistogramMax: 1, AutomataDifference: 27.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 5380 SDtfs, 11076 SDslu, 16167 SDs, 0 SdLazy, 10055 SolverSat, 1668 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 60 SyntacticMatches, 18 SemanticMatches, 625 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 17.5s 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: 5.3s AutomataMinimizationTime, 52 MinimizatonAttempts, 47589 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.8s 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...