./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/singleton.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3e5ce664 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 ../../../trunk/examples/svcomp/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-3e5ce66 [2020-12-02 21:39:38,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 21:39:38,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 21:39:38,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 21:39:38,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 21:39:38,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 21:39:38,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 21:39:38,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 21:39:38,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 21:39:38,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 21:39:38,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 21:39:38,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 21:39:38,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 21:39:38,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 21:39:38,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 21:39:38,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 21:39:38,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 21:39:38,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 21:39:38,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 21:39:38,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 21:39:38,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 21:39:38,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 21:39:38,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 21:39:38,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 21:39:38,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 21:39:38,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 21:39:38,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 21:39:38,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 21:39:38,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 21:39:38,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 21:39:38,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 21:39:38,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 21:39:38,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 21:39:38,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 21:39:38,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 21:39:38,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 21:39:38,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 21:39:38,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 21:39:38,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 21:39:38,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 21:39:38,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 21:39:38,268 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 21:39:38,305 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 21:39:38,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 21:39:38,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 21:39:38,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 21:39:38,307 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 21:39:38,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 21:39:38,307 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 21:39:38,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 21:39:38,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 21:39:38,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 21:39:38,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 21:39:38,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 21:39:38,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 21:39:38,309 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 21:39:38,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 21:39:38,309 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 21:39:38,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 21:39:38,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 21:39:38,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 21:39:38,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 21:39:38,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 21:39:38,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 21:39:38,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 21:39:38,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 21:39:38,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 21:39:38,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 21:39:38,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 21:39:38,312 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 21:39:38,312 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-02 21:39:38,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 21:39:38,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 21:39:38,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 21:39:38,703 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 21:39:38,704 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 21:39:38,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-12-02 21:39:38,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d36cfa92/22ea4b1f26af4474b3fce809779664a9/FLAG3f5c20585 [2020-12-02 21:39:39,500 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 21:39:39,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2020-12-02 21:39:39,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d36cfa92/22ea4b1f26af4474b3fce809779664a9/FLAG3f5c20585 [2020-12-02 21:39:39,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d36cfa92/22ea4b1f26af4474b3fce809779664a9 [2020-12-02 21:39:39,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 21:39:39,762 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 21:39:39,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 21:39:39,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 21:39:39,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 21:39:39,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:39:39" (1/1) ... [2020-12-02 21:39:39,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@90f0410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:39, skipping insertion in model container [2020-12-02 21:39:39,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:39:39" (1/1) ... [2020-12-02 21:39:39,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 21:39:39,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 21:39:40,179 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-02 21:39:40,551 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2020-12-02 21:39:40,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 21:39:40,606 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 21:39:40,642 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-02 21:39:40,676 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2020-12-02 21:39:40,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 21:39:40,963 INFO L208 MainTranslator]: Completed translation [2020-12-02 21:39:40,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:40 WrapperNode [2020-12-02 21:39:40,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 21:39:40,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 21:39:40,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 21:39:40,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 21:39:40,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:40" (1/1) ... [2020-12-02 21:39:41,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:40" (1/1) ... [2020-12-02 21:39:41,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 21:39:41,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 21:39:41,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 21:39:41,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 21:39:41,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:40" (1/1) ... [2020-12-02 21:39:41,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:40" (1/1) ... [2020-12-02 21:39:41,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:40" (1/1) ... [2020-12-02 21:39:41,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:40" (1/1) ... [2020-12-02 21:39:41,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:40" (1/1) ... [2020-12-02 21:39:41,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:40" (1/1) ... [2020-12-02 21:39:41,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:40" (1/1) ... [2020-12-02 21:39:41,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 21:39:41,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 21:39:41,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 21:39:41,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 21:39:41,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:40" (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-02 21:39:41,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-02 21:39:41,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 21:39:41,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 21:39:41,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-02 21:39:41,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-02 21:39:41,180 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-12-02 21:39:41,181 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-12-02 21:39:41,181 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-12-02 21:39:41,181 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-12-02 21:39:41,181 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-12-02 21:39:41,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-12-02 21:39:41,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-12-02 21:39:41,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-12-02 21:39:41,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-02 21:39:41,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-02 21:39:41,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 21:39:41,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 21:39:41,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 21:39:41,185 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-02 21:39:41,690 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 21:39:41,691 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-12-02 21:39:41,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:39:41 BoogieIcfgContainer [2020-12-02 21:39:41,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 21:39:41,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 21:39:41,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 21:39:41,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 21:39:41,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:39:39" (1/3) ... [2020-12-02 21:39:41,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1137466a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:39:41, skipping insertion in model container [2020-12-02 21:39:41,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:39:40" (2/3) ... [2020-12-02 21:39:41,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1137466a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:39:41, skipping insertion in model container [2020-12-02 21:39:41,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:39:41" (3/3) ... [2020-12-02 21:39:41,702 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-12-02 21:39:41,717 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-02 21:39:41,718 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 21:39:41,722 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 21:39:41,723 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-02 21:39:41,776 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,776 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,777 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,777 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,777 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,778 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,778 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,778 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,778 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,779 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,779 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,779 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,780 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,780 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,780 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,781 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,781 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,781 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,782 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,782 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,782 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,782 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,783 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,783 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,784 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,784 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,784 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,785 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,785 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,785 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,786 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,786 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,786 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,787 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,787 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,787 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,787 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,788 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,788 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,788 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,789 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,789 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,790 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,790 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,790 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,790 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,791 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,791 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,791 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,792 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,792 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,792 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,792 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,793 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,793 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,793 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,793 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,794 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,794 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,794 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,795 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,795 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,795 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,795 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,796 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,796 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,796 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,796 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,797 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,797 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,797 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,797 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,798 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,798 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,798 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,799 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,799 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,799 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,799 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,799 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,800 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,800 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,800 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,801 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,801 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,801 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,801 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,802 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,802 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,802 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,802 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,803 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,803 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,803 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,803 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,804 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,804 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,804 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,804 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,805 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,805 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,805 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,805 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,806 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,806 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,806 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,806 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,807 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,807 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,807 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,808 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,808 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,818 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,818 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,819 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,819 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,819 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,820 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,820 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,820 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,821 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,821 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,821 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,821 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,822 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,822 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,822 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,823 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,823 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,823 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,824 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,824 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,824 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,825 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,825 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,825 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,825 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,826 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,826 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,826 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,826 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,827 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,827 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,827 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,828 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,828 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,828 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,828 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,829 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,829 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,829 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,830 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,830 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,830 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,831 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,831 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,831 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,831 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,832 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,832 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,832 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,833 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,833 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,833 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,834 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,834 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,834 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,834 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,835 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,835 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,835 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,835 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,836 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,836 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,836 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,837 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,837 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,837 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,837 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,838 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,838 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,838 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,838 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,839 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,839 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,839 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,840 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,840 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,840 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,841 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,841 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,841 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,841 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,842 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,842 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,842 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,842 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,843 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,843 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,843 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,846 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,846 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,846 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,847 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,852 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,853 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,853 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,853 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,856 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,856 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,856 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,857 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,859 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,860 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,860 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,860 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,860 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,861 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,863 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,863 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,864 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,864 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,864 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,864 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,865 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,865 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,865 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,866 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,866 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,866 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,866 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,867 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,867 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,867 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,868 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,868 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,868 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,868 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,869 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,869 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,869 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,869 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,872 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,873 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,873 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,873 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,876 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,876 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,876 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,876 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,877 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,877 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,879 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,880 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,880 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,880 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,883 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,883 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,883 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,884 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,886 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,886 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,887 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,887 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,889 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,889 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,890 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:41,890 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-02 21:39:42,058 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2020-12-02 21:39:42,071 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-12-02 21:39:42,093 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 21:39:42,093 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 21:39:42,093 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 21:39:42,094 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 21:39:42,094 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 21:39:42,094 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 21:39:42,094 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 21:39:42,094 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 21:39:42,113 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-02 21:39:42,115 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-02 21:39:42,118 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 248 transitions, 876 flow [2020-12-02 21:39:42,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 248 transitions, 876 flow [2020-12-02 21:39:42,236 INFO L129 PetriNetUnfolder]: 61/274 cut-off events. [2020-12-02 21:39:42,236 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-12-02 21:39:42,244 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-02 21:39:42,257 INFO L116 LiptonReduction]: Number of co-enabled transitions 4156 [2020-12-02 21:39:45,461 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-02 21:39:45,573 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-02 21:39:45,703 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2020-12-02 21:39:45,815 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-12-02 21:39:46,202 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-02 21:39:46,431 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2020-12-02 21:39:46,614 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-02 21:39:46,732 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-02 21:39:46,849 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-02 21:39:46,964 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-12-02 21:39:47,243 INFO L131 LiptonReduction]: Checked pairs total: 49018 [2020-12-02 21:39:47,244 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-12-02 21:39:47,250 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 173 transitions, 726 flow [2020-12-02 21:39:47,739 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-12-02 21:39:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-12-02 21:39:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-02 21:39:47,747 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:47,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:39:47,749 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-02 21:39:47,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:47,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1391244601, now seen corresponding path program 1 times [2020-12-02 21:39:47,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:47,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905378050] [2020-12-02 21:39:47,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:48,074 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-02 21:39:48,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905378050] [2020-12-02 21:39:48,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:48,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 21:39:48,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862456616] [2020-12-02 21:39:48,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 21:39:48,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:48,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 21:39:48,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 21:39:48,100 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-12-02 21:39:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:48,611 INFO L93 Difference]: Finished difference Result 6012 states and 25679 transitions. [2020-12-02 21:39:48,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:39:48,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-02 21:39:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:48,691 INFO L225 Difference]: With dead ends: 6012 [2020-12-02 21:39:48,691 INFO L226 Difference]: Without dead ends: 5524 [2020-12-02 21:39:48,693 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-02 21:39:48,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2020-12-02 21:39:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 3018. [2020-12-02 21:39:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-12-02 21:39:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-12-02 21:39:49,006 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-12-02 21:39:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:49,006 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-12-02 21:39:49,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 21:39:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-12-02 21:39:49,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-02 21:39:49,008 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:49,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:39:49,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 21:39:49,011 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-02 21:39:49,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:49,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1473766845, now seen corresponding path program 2 times [2020-12-02 21:39:49,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:49,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834545866] [2020-12-02 21:39:49,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:49,174 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-02 21:39:49,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834545866] [2020-12-02 21:39:49,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:49,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 21:39:49,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286143000] [2020-12-02 21:39:49,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 21:39:49,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:49,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 21:39:49,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-02 21:39:49,185 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-12-02 21:39:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:49,464 INFO L93 Difference]: Finished difference Result 4266 states and 18042 transitions. [2020-12-02 21:39:49,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 21:39:49,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-12-02 21:39:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:49,509 INFO L225 Difference]: With dead ends: 4266 [2020-12-02 21:39:49,509 INFO L226 Difference]: Without dead ends: 4266 [2020-12-02 21:39:49,510 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-02 21:39:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2020-12-02 21:39:49,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 3008. [2020-12-02 21:39:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-12-02 21:39:49,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-12-02 21:39:49,755 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-12-02 21:39:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:49,755 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-12-02 21:39:49,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 21:39:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-12-02 21:39:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-02 21:39:49,758 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:49,758 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:39:49,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 21:39:49,759 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-02 21:39:49,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:49,759 INFO L82 PathProgramCache]: Analyzing trace with hash -658761216, now seen corresponding path program 1 times [2020-12-02 21:39:49,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:49,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022166201] [2020-12-02 21:39:49,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:49,877 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-02 21:39:49,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022166201] [2020-12-02 21:39:49,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:49,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 21:39:49,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498639914] [2020-12-02 21:39:49,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-02 21:39:49,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:49,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-02 21:39:49,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-02 21:39:49,882 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-12-02 21:39:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:49,970 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-12-02 21:39:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-02 21:39:49,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-02 21:39:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:50,023 INFO L225 Difference]: With dead ends: 4848 [2020-12-02 21:39:50,023 INFO L226 Difference]: Without dead ends: 3558 [2020-12-02 21:39:50,023 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-02 21:39:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-12-02 21:39:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-12-02 21:39:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-12-02 21:39:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-12-02 21:39:50,187 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-12-02 21:39:50,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:50,188 INFO L481 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-12-02 21:39:50,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-02 21:39:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-12-02 21:39:50,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 21:39:50,192 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:50,193 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:39:50,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 21:39:50,193 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-02 21:39:50,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:50,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1053238145, now seen corresponding path program 1 times [2020-12-02 21:39:50,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:50,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152729079] [2020-12-02 21:39:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:50,323 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-02 21:39:50,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152729079] [2020-12-02 21:39:50,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:50,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 21:39:50,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823639292] [2020-12-02 21:39:50,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 21:39:50,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:50,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 21:39:50,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-02 21:39:50,327 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-12-02 21:39:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:50,598 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-12-02 21:39:50,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 21:39:50,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-02 21:39:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:50,620 INFO L225 Difference]: With dead ends: 4417 [2020-12-02 21:39:50,620 INFO L226 Difference]: Without dead ends: 4393 [2020-12-02 21:39:50,621 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-02 21:39:50,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-12-02 21:39:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-12-02 21:39:50,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-12-02 21:39:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-12-02 21:39:50,847 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-12-02 21:39:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:50,847 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-12-02 21:39:50,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 21:39:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-12-02 21:39:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 21:39:50,850 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:50,850 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:39:50,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 21:39:50,850 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-02 21:39:50,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:50,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1471262403, now seen corresponding path program 2 times [2020-12-02 21:39:50,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:50,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720488730] [2020-12-02 21:39:50,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:50,925 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-02 21:39:50,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720488730] [2020-12-02 21:39:50,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:50,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 21:39:50,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251311398] [2020-12-02 21:39:50,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 21:39:50,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:50,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 21:39:50,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 21:39:50,928 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-12-02 21:39:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:51,034 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-12-02 21:39:51,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 21:39:51,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-02 21:39:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:51,052 INFO L225 Difference]: With dead ends: 4024 [2020-12-02 21:39:51,053 INFO L226 Difference]: Without dead ends: 4024 [2020-12-02 21:39:51,053 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-02 21:39:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-12-02 21:39:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-12-02 21:39:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-12-02 21:39:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-12-02 21:39:51,271 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-12-02 21:39:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:51,272 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-12-02 21:39:51,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 21:39:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-12-02 21:39:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 21:39:51,274 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:51,274 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-02 21:39:51,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 21:39:51,274 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-02 21:39:51,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:51,275 INFO L82 PathProgramCache]: Analyzing trace with hash -564581282, now seen corresponding path program 1 times [2020-12-02 21:39:51,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:51,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037499324] [2020-12-02 21:39:51,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:51,355 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-02 21:39:51,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037499324] [2020-12-02 21:39:51,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:51,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 21:39:51,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105343964] [2020-12-02 21:39:51,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 21:39:51,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:51,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 21:39:51,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-02 21:39:51,359 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-12-02 21:39:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:51,549 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-12-02 21:39:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 21:39:51,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-02 21:39:51,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:51,569 INFO L225 Difference]: With dead ends: 4225 [2020-12-02 21:39:51,570 INFO L226 Difference]: Without dead ends: 4129 [2020-12-02 21:39:51,570 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-02 21:39:51,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-12-02 21:39:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-12-02 21:39:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-12-02 21:39:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-12-02 21:39:51,757 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-12-02 21:39:51,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:51,758 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-12-02 21:39:51,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 21:39:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-12-02 21:39:51,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 21:39:51,760 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:51,760 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-02 21:39:51,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 21:39:51,761 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-02 21:39:51,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:51,761 INFO L82 PathProgramCache]: Analyzing trace with hash -490731172, now seen corresponding path program 2 times [2020-12-02 21:39:51,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:51,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168808890] [2020-12-02 21:39:51,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:51,913 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-02 21:39:51,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168808890] [2020-12-02 21:39:51,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:51,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 21:39:51,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239316086] [2020-12-02 21:39:51,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 21:39:51,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:51,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 21:39:51,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 21:39:51,917 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2020-12-02 21:39:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:52,324 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-12-02 21:39:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 21:39:52,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-02 21:39:52,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:52,354 INFO L225 Difference]: With dead ends: 4979 [2020-12-02 21:39:52,355 INFO L226 Difference]: Without dead ends: 4905 [2020-12-02 21:39:52,355 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-02 21:39:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-12-02 21:39:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-12-02 21:39:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-02 21:39:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-12-02 21:39:52,572 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-12-02 21:39:52,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:52,573 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-12-02 21:39:52,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 21:39:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-12-02 21:39:52,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 21:39:52,574 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:52,574 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-02 21:39:52,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-02 21:39:52,575 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-02 21:39:52,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:52,575 INFO L82 PathProgramCache]: Analyzing trace with hash 991975414, now seen corresponding path program 3 times [2020-12-02 21:39:52,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:52,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370397820] [2020-12-02 21:39:52,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:52,670 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-02 21:39:52,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370397820] [2020-12-02 21:39:52,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:52,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 21:39:52,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37963161] [2020-12-02 21:39:52,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 21:39:52,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:52,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 21:39:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-02 21:39:52,673 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 9 states. [2020-12-02 21:39:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:53,039 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-12-02 21:39:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 21:39:53,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-02 21:39:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:53,070 INFO L225 Difference]: With dead ends: 6735 [2020-12-02 21:39:53,070 INFO L226 Difference]: Without dead ends: 6661 [2020-12-02 21:39:53,071 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-02 21:39:53,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-12-02 21:39:53,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-12-02 21:39:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-12-02 21:39:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-12-02 21:39:53,280 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-12-02 21:39:53,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:53,280 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-12-02 21:39:53,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 21:39:53,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-12-02 21:39:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 21:39:53,282 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:53,283 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-02 21:39:53,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-02 21:39:53,283 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-02 21:39:53,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:53,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1869283970, now seen corresponding path program 4 times [2020-12-02 21:39:53,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:53,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897383888] [2020-12-02 21:39:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:53,420 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-02 21:39:53,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897383888] [2020-12-02 21:39:53,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:53,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 21:39:53,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600932712] [2020-12-02 21:39:53,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 21:39:53,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:53,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 21:39:53,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-02 21:39:53,423 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 9 states. [2020-12-02 21:39:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:53,780 INFO L93 Difference]: Finished difference Result 5385 states and 21914 transitions. [2020-12-02 21:39:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:39:53,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-12-02 21:39:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:53,804 INFO L225 Difference]: With dead ends: 5385 [2020-12-02 21:39:53,804 INFO L226 Difference]: Without dead ends: 5311 [2020-12-02 21:39:53,805 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-02 21:39:53,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2020-12-02 21:39:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4125. [2020-12-02 21:39:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4125 states. [2020-12-02 21:39:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4125 states to 4125 states and 16604 transitions. [2020-12-02 21:39:53,941 INFO L78 Accepts]: Start accepts. Automaton has 4125 states and 16604 transitions. Word has length 18 [2020-12-02 21:39:53,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:53,942 INFO L481 AbstractCegarLoop]: Abstraction has 4125 states and 16604 transitions. [2020-12-02 21:39:53,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 21:39:53,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4125 states and 16604 transitions. [2020-12-02 21:39:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-02 21:39:53,944 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:53,944 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-02 21:39:53,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-02 21:39:53,944 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-02 21:39:53,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:53,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1339896726, now seen corresponding path program 5 times [2020-12-02 21:39:53,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:53,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713513631] [2020-12-02 21:39:53,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:54,140 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-02 21:39:54,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713513631] [2020-12-02 21:39:54,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:54,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 21:39:54,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922641252] [2020-12-02 21:39:54,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 21:39:54,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:54,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 21:39:54,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-02 21:39:54,143 INFO L87 Difference]: Start difference. First operand 4125 states and 16604 transitions. Second operand 11 states. [2020-12-02 21:39:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:54,785 INFO L93 Difference]: Finished difference Result 5686 states and 23415 transitions. [2020-12-02 21:39:54,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 21:39:54,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-12-02 21:39:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:54,812 INFO L225 Difference]: With dead ends: 5686 [2020-12-02 21:39:54,813 INFO L226 Difference]: Without dead ends: 5630 [2020-12-02 21:39:54,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-02 21:39:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2020-12-02 21:39:54,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4116. [2020-12-02 21:39:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2020-12-02 21:39:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 16578 transitions. [2020-12-02 21:39:55,005 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 16578 transitions. Word has length 18 [2020-12-02 21:39:55,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:55,006 INFO L481 AbstractCegarLoop]: Abstraction has 4116 states and 16578 transitions. [2020-12-02 21:39:55,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 21:39:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 16578 transitions. [2020-12-02 21:39:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 21:39:55,008 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:55,008 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-02 21:39:55,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-02 21:39:55,009 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-02 21:39:55,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:55,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1845549347, now seen corresponding path program 1 times [2020-12-02 21:39:55,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:55,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191699339] [2020-12-02 21:39:55,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:55,083 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-02 21:39:55,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191699339] [2020-12-02 21:39:55,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:55,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 21:39:55,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644669169] [2020-12-02 21:39:55,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 21:39:55,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:55,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 21:39:55,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 21:39:55,086 INFO L87 Difference]: Start difference. First operand 4116 states and 16578 transitions. Second operand 6 states. [2020-12-02 21:39:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:55,194 INFO L93 Difference]: Finished difference Result 4687 states and 18325 transitions. [2020-12-02 21:39:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 21:39:55,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-02 21:39:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:55,217 INFO L225 Difference]: With dead ends: 4687 [2020-12-02 21:39:55,217 INFO L226 Difference]: Without dead ends: 4687 [2020-12-02 21:39:55,218 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-02 21:39:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-02 21:39:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4131. [2020-12-02 21:39:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-12-02 21:39:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16621 transitions. [2020-12-02 21:39:55,346 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16621 transitions. Word has length 19 [2020-12-02 21:39:55,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:55,347 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16621 transitions. [2020-12-02 21:39:55,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 21:39:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16621 transitions. [2020-12-02 21:39:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 21:39:55,349 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:55,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:39:55,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-02 21:39:55,350 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-02 21:39:55,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash 838752707, now seen corresponding path program 2 times [2020-12-02 21:39:55,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:55,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412368684] [2020-12-02 21:39:55,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:55,451 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-02 21:39:55,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412368684] [2020-12-02 21:39:55,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:55,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 21:39:55,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016107893] [2020-12-02 21:39:55,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 21:39:55,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:55,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 21:39:55,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 21:39:55,454 INFO L87 Difference]: Start difference. First operand 4131 states and 16621 transitions. Second operand 7 states. [2020-12-02 21:39:55,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:55,560 INFO L93 Difference]: Finished difference Result 4619 states and 18100 transitions. [2020-12-02 21:39:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 21:39:55,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-12-02 21:39:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:55,578 INFO L225 Difference]: With dead ends: 4619 [2020-12-02 21:39:55,578 INFO L226 Difference]: Without dead ends: 4619 [2020-12-02 21:39:55,579 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-02 21:39:55,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2020-12-02 21:39:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4078. [2020-12-02 21:39:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2020-12-02 21:39:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 16436 transitions. [2020-12-02 21:39:55,705 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 16436 transitions. Word has length 19 [2020-12-02 21:39:55,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:55,705 INFO L481 AbstractCegarLoop]: Abstraction has 4078 states and 16436 transitions. [2020-12-02 21:39:55,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 21:39:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 16436 transitions. [2020-12-02 21:39:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 21:39:55,708 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:55,708 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-02 21:39:55,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-02 21:39:55,708 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-02 21:39:55,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:55,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1368539430, now seen corresponding path program 1 times [2020-12-02 21:39:55,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:55,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165248439] [2020-12-02 21:39:55,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:39:55,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165248439] [2020-12-02 21:39:55,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:55,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 21:39:55,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767293649] [2020-12-02 21:39:55,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 21:39:55,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:55,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 21:39:55,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-12-02 21:39:55,974 INFO L87 Difference]: Start difference. First operand 4078 states and 16436 transitions. Second operand 10 states. [2020-12-02 21:39:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:56,568 INFO L93 Difference]: Finished difference Result 5300 states and 21612 transitions. [2020-12-02 21:39:56,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 21:39:56,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-12-02 21:39:56,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:56,589 INFO L225 Difference]: With dead ends: 5300 [2020-12-02 21:39:56,589 INFO L226 Difference]: Without dead ends: 5226 [2020-12-02 21:39:56,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-12-02 21:39:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2020-12-02 21:39:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 4066. [2020-12-02 21:39:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2020-12-02 21:39:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 16392 transitions. [2020-12-02 21:39:56,754 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 16392 transitions. Word has length 19 [2020-12-02 21:39:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:56,754 INFO L481 AbstractCegarLoop]: Abstraction has 4066 states and 16392 transitions. [2020-12-02 21:39:56,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 21:39:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 16392 transitions. [2020-12-02 21:39:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 21:39:56,757 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:56,757 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-02 21:39:56,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-02 21:39:56,758 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-02 21:39:56,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:56,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1392670140, now seen corresponding path program 2 times [2020-12-02 21:39:56,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:56,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952675797] [2020-12-02 21:39:56,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:57,015 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-02 21:39:57,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952675797] [2020-12-02 21:39:57,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:57,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 21:39:57,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997818903] [2020-12-02 21:39:57,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 21:39:57,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:57,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 21:39:57,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-02 21:39:57,018 INFO L87 Difference]: Start difference. First operand 4066 states and 16392 transitions. Second operand 12 states. [2020-12-02 21:39:57,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:57,888 INFO L93 Difference]: Finished difference Result 5713 states and 23638 transitions. [2020-12-02 21:39:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 21:39:57,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2020-12-02 21:39:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:57,904 INFO L225 Difference]: With dead ends: 5713 [2020-12-02 21:39:57,904 INFO L226 Difference]: Without dead ends: 5651 [2020-12-02 21:39:57,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2020-12-02 21:39:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2020-12-02 21:39:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 4021. [2020-12-02 21:39:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2020-12-02 21:39:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 16226 transitions. [2020-12-02 21:39:58,063 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 16226 transitions. Word has length 19 [2020-12-02 21:39:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:58,063 INFO L481 AbstractCegarLoop]: Abstraction has 4021 states and 16226 transitions. [2020-12-02 21:39:58,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 21:39:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 16226 transitions. [2020-12-02 21:39:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 21:39:58,066 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:58,067 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:39:58,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-02 21:39:58,067 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-02 21:39:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:58,068 INFO L82 PathProgramCache]: Analyzing trace with hash -638770199, now seen corresponding path program 1 times [2020-12-02 21:39:58,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:58,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924175679] [2020-12-02 21:39:58,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:58,140 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-02 21:39:58,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924175679] [2020-12-02 21:39:58,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:58,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 21:39:58,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831688530] [2020-12-02 21:39:58,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 21:39:58,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:58,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 21:39:58,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-02 21:39:58,143 INFO L87 Difference]: Start difference. First operand 4021 states and 16226 transitions. Second operand 8 states. [2020-12-02 21:39:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:58,423 INFO L93 Difference]: Finished difference Result 6240 states and 25278 transitions. [2020-12-02 21:39:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 21:39:58,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-02 21:39:58,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:58,446 INFO L225 Difference]: With dead ends: 6240 [2020-12-02 21:39:58,446 INFO L226 Difference]: Without dead ends: 6194 [2020-12-02 21:39:58,447 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-02 21:39:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6194 states. [2020-12-02 21:39:58,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6194 to 4020. [2020-12-02 21:39:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2020-12-02 21:39:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 16225 transitions. [2020-12-02 21:39:58,625 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 16225 transitions. Word has length 20 [2020-12-02 21:39:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:58,625 INFO L481 AbstractCegarLoop]: Abstraction has 4020 states and 16225 transitions. [2020-12-02 21:39:58,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 21:39:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 16225 transitions. [2020-12-02 21:39:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 21:39:58,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:58,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:39:58,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-02 21:39:58,629 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-02 21:39:58,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:58,630 INFO L82 PathProgramCache]: Analyzing trace with hash -78568143, now seen corresponding path program 2 times [2020-12-02 21:39:58,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:58,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336655407] [2020-12-02 21:39:58,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:39:58,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336655407] [2020-12-02 21:39:58,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:58,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 21:39:58,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727448162] [2020-12-02 21:39:58,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 21:39:58,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:58,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 21:39:58,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-02 21:39:58,709 INFO L87 Difference]: Start difference. First operand 4020 states and 16225 transitions. Second operand 8 states. [2020-12-02 21:39:58,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:58,951 INFO L93 Difference]: Finished difference Result 5057 states and 20246 transitions. [2020-12-02 21:39:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:39:58,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-02 21:39:58,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:58,969 INFO L225 Difference]: With dead ends: 5057 [2020-12-02 21:39:58,969 INFO L226 Difference]: Without dead ends: 5011 [2020-12-02 21:39:58,970 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-02 21:39:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2020-12-02 21:39:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 4017. [2020-12-02 21:39:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4017 states. [2020-12-02 21:39:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 16218 transitions. [2020-12-02 21:39:59,166 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 16218 transitions. Word has length 20 [2020-12-02 21:39:59,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:59,166 INFO L481 AbstractCegarLoop]: Abstraction has 4017 states and 16218 transitions. [2020-12-02 21:39:59,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 21:39:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 16218 transitions. [2020-12-02 21:39:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 21:39:59,169 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:59,170 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-02 21:39:59,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-02 21:39:59,170 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-02 21:39:59,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:59,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1686883325, now seen corresponding path program 3 times [2020-12-02 21:39:59,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:59,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479347922] [2020-12-02 21:39:59,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:39:59,335 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-02 21:39:59,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479347922] [2020-12-02 21:39:59,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:39:59,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 21:39:59,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147045005] [2020-12-02 21:39:59,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 21:39:59,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:39:59,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 21:39:59,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-02 21:39:59,338 INFO L87 Difference]: Start difference. First operand 4017 states and 16218 transitions. Second operand 9 states. [2020-12-02 21:39:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:39:59,724 INFO L93 Difference]: Finished difference Result 5047 states and 20222 transitions. [2020-12-02 21:39:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 21:39:59,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-12-02 21:39:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:39:59,741 INFO L225 Difference]: With dead ends: 5047 [2020-12-02 21:39:59,741 INFO L226 Difference]: Without dead ends: 5001 [2020-12-02 21:39:59,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-12-02 21:39:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2020-12-02 21:39:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4010. [2020-12-02 21:39:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4010 states. [2020-12-02 21:39:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 16199 transitions. [2020-12-02 21:39:59,861 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 16199 transitions. Word has length 20 [2020-12-02 21:39:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:39:59,862 INFO L481 AbstractCegarLoop]: Abstraction has 4010 states and 16199 transitions. [2020-12-02 21:39:59,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 21:39:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 16199 transitions. [2020-12-02 21:39:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 21:39:59,865 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:39:59,865 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-02 21:39:59,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-02 21:39:59,865 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-02 21:39:59,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:39:59,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1644928641, now seen corresponding path program 4 times [2020-12-02 21:39:59,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:39:59,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781581579] [2020-12-02 21:39:59,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:39:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:00,050 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-02 21:40:00,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781581579] [2020-12-02 21:40:00,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:00,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 21:40:00,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698294596] [2020-12-02 21:40:00,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 21:40:00,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:00,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 21:40:00,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-12-02 21:40:00,052 INFO L87 Difference]: Start difference. First operand 4010 states and 16199 transitions. Second operand 11 states. [2020-12-02 21:40:00,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:00,671 INFO L93 Difference]: Finished difference Result 5545 states and 22382 transitions. [2020-12-02 21:40:00,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 21:40:00,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-02 21:40:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:00,686 INFO L225 Difference]: With dead ends: 5545 [2020-12-02 21:40:00,686 INFO L226 Difference]: Without dead ends: 5499 [2020-12-02 21:40:00,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-12-02 21:40:00,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2020-12-02 21:40:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4140. [2020-12-02 21:40:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-02 21:40:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16867 transitions. [2020-12-02 21:40:00,811 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16867 transitions. Word has length 20 [2020-12-02 21:40:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:00,812 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16867 transitions. [2020-12-02 21:40:00,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 21:40:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16867 transitions. [2020-12-02 21:40:00,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 21:40:00,815 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:00,815 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-02 21:40:00,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-02 21:40:00,816 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-02 21:40:00,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:00,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1818104208, now seen corresponding path program 1 times [2020-12-02 21:40:00,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:00,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861625461] [2020-12-02 21:40:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:00,990 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-02 21:40:00,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861625461] [2020-12-02 21:40:00,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:00,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 21:40:00,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256763162] [2020-12-02 21:40:00,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 21:40:00,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:00,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 21:40:00,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-02 21:40:00,994 INFO L87 Difference]: Start difference. First operand 4140 states and 16867 transitions. Second operand 11 states. [2020-12-02 21:40:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:01,776 INFO L93 Difference]: Finished difference Result 6397 states and 25724 transitions. [2020-12-02 21:40:01,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-02 21:40:01,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-02 21:40:01,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:01,792 INFO L225 Difference]: With dead ends: 6397 [2020-12-02 21:40:01,792 INFO L226 Difference]: Without dead ends: 6351 [2020-12-02 21:40:01,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-02 21:40:01,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6351 states. [2020-12-02 21:40:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6351 to 4140. [2020-12-02 21:40:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2020-12-02 21:40:01,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 16868 transitions. [2020-12-02 21:40:01,933 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 16868 transitions. Word has length 20 [2020-12-02 21:40:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:01,934 INFO L481 AbstractCegarLoop]: Abstraction has 4140 states and 16868 transitions. [2020-12-02 21:40:01,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 21:40:01,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 16868 transitions. [2020-12-02 21:40:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 21:40:01,938 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:01,938 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-02 21:40:01,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-02 21:40:01,939 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-02 21:40:01,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:01,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1599554532, now seen corresponding path program 2 times [2020-12-02 21:40:01,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:01,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207451547] [2020-12-02 21:40:01,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:02,106 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-02 21:40:02,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207451547] [2020-12-02 21:40:02,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:02,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 21:40:02,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994016244] [2020-12-02 21:40:02,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 21:40:02,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:02,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 21:40:02,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-02 21:40:02,112 INFO L87 Difference]: Start difference. First operand 4140 states and 16868 transitions. Second operand 11 states. [2020-12-02 21:40:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:02,826 INFO L93 Difference]: Finished difference Result 5409 states and 21869 transitions. [2020-12-02 21:40:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-02 21:40:02,826 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-02 21:40:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:02,839 INFO L225 Difference]: With dead ends: 5409 [2020-12-02 21:40:02,839 INFO L226 Difference]: Without dead ends: 5363 [2020-12-02 21:40:02,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2020-12-02 21:40:02,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2020-12-02 21:40:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 4142. [2020-12-02 21:40:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4142 states. [2020-12-02 21:40:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 16874 transitions. [2020-12-02 21:40:02,951 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 16874 transitions. Word has length 20 [2020-12-02 21:40:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:02,951 INFO L481 AbstractCegarLoop]: Abstraction has 4142 states and 16874 transitions. [2020-12-02 21:40:02,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 21:40:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 16874 transitions. [2020-12-02 21:40:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 21:40:02,954 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:02,955 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-02 21:40:02,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-02 21:40:02,955 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-02 21:40:02,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:02,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1117675172, now seen corresponding path program 3 times [2020-12-02 21:40:02,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:02,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552631135] [2020-12-02 21:40:02,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:03,077 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-02 21:40:03,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552631135] [2020-12-02 21:40:03,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:03,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 21:40:03,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379897635] [2020-12-02 21:40:03,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 21:40:03,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:03,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 21:40:03,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-02 21:40:03,079 INFO L87 Difference]: Start difference. First operand 4142 states and 16874 transitions. Second operand 10 states. [2020-12-02 21:40:03,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:03,589 INFO L93 Difference]: Finished difference Result 6189 states and 24832 transitions. [2020-12-02 21:40:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 21:40:03,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-02 21:40:03,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:03,609 INFO L225 Difference]: With dead ends: 6189 [2020-12-02 21:40:03,609 INFO L226 Difference]: Without dead ends: 6143 [2020-12-02 21:40:03,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-12-02 21:40:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6143 states. [2020-12-02 21:40:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6143 to 4141. [2020-12-02 21:40:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4141 states. [2020-12-02 21:40:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 16873 transitions. [2020-12-02 21:40:03,740 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 16873 transitions. Word has length 20 [2020-12-02 21:40:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:03,741 INFO L481 AbstractCegarLoop]: Abstraction has 4141 states and 16873 transitions. [2020-12-02 21:40:03,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 21:40:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 16873 transitions. [2020-12-02 21:40:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 21:40:03,744 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:03,744 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-02 21:40:03,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-02 21:40:03,745 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-02 21:40:03,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:03,745 INFO L82 PathProgramCache]: Analyzing trace with hash -240366616, now seen corresponding path program 4 times [2020-12-02 21:40:03,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:03,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464622221] [2020-12-02 21:40:03,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:03,867 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-02 21:40:03,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464622221] [2020-12-02 21:40:03,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:03,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 21:40:03,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649403318] [2020-12-02 21:40:03,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 21:40:03,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:03,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 21:40:03,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-02 21:40:03,870 INFO L87 Difference]: Start difference. First operand 4141 states and 16873 transitions. Second operand 10 states. [2020-12-02 21:40:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:04,244 INFO L93 Difference]: Finished difference Result 5246 states and 21125 transitions. [2020-12-02 21:40:04,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 21:40:04,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-12-02 21:40:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:04,257 INFO L225 Difference]: With dead ends: 5246 [2020-12-02 21:40:04,257 INFO L226 Difference]: Without dead ends: 5200 [2020-12-02 21:40:04,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-12-02 21:40:04,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2020-12-02 21:40:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 3983. [2020-12-02 21:40:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2020-12-02 21:40:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 16133 transitions. [2020-12-02 21:40:04,349 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 16133 transitions. Word has length 20 [2020-12-02 21:40:04,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:04,349 INFO L481 AbstractCegarLoop]: Abstraction has 3983 states and 16133 transitions. [2020-12-02 21:40:04,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 21:40:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 16133 transitions. [2020-12-02 21:40:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 21:40:04,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:04,353 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-02 21:40:04,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-02 21:40:04,353 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-02 21:40:04,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:04,354 INFO L82 PathProgramCache]: Analyzing trace with hash -565771751, now seen corresponding path program 1 times [2020-12-02 21:40:04,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:04,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056775789] [2020-12-02 21:40:04,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:04,396 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-02 21:40:04,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056775789] [2020-12-02 21:40:04,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:04,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 21:40:04,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509346214] [2020-12-02 21:40:04,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 21:40:04,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:04,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 21:40:04,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-02 21:40:04,399 INFO L87 Difference]: Start difference. First operand 3983 states and 16133 transitions. Second operand 6 states. [2020-12-02 21:40:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:04,579 INFO L93 Difference]: Finished difference Result 4762 states and 18800 transitions. [2020-12-02 21:40:04,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 21:40:04,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-02 21:40:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:04,590 INFO L225 Difference]: With dead ends: 4762 [2020-12-02 21:40:04,590 INFO L226 Difference]: Without dead ends: 4687 [2020-12-02 21:40:04,591 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-02 21:40:04,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2020-12-02 21:40:04,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4305. [2020-12-02 21:40:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4305 states. [2020-12-02 21:40:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 17320 transitions. [2020-12-02 21:40:04,674 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 17320 transitions. Word has length 21 [2020-12-02 21:40:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:04,674 INFO L481 AbstractCegarLoop]: Abstraction has 4305 states and 17320 transitions. [2020-12-02 21:40:04,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 21:40:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 17320 transitions. [2020-12-02 21:40:04,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 21:40:04,678 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:04,678 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-02 21:40:04,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-02 21:40:04,678 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-02 21:40:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash 479599707, now seen corresponding path program 2 times [2020-12-02 21:40:04,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:04,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295641830] [2020-12-02 21:40:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:04,723 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-02 21:40:04,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295641830] [2020-12-02 21:40:04,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:04,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 21:40:04,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847916830] [2020-12-02 21:40:04,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 21:40:04,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:04,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 21:40:04,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 21:40:04,725 INFO L87 Difference]: Start difference. First operand 4305 states and 17320 transitions. Second operand 6 states. [2020-12-02 21:40:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:04,815 INFO L93 Difference]: Finished difference Result 5233 states and 20429 transitions. [2020-12-02 21:40:04,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 21:40:04,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-02 21:40:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:04,827 INFO L225 Difference]: With dead ends: 5233 [2020-12-02 21:40:04,828 INFO L226 Difference]: Without dead ends: 4707 [2020-12-02 21:40:04,828 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-02 21:40:04,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4707 states. [2020-12-02 21:40:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4707 to 3933. [2020-12-02 21:40:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3933 states. [2020-12-02 21:40:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 15536 transitions. [2020-12-02 21:40:04,936 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 15536 transitions. Word has length 21 [2020-12-02 21:40:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:04,936 INFO L481 AbstractCegarLoop]: Abstraction has 3933 states and 15536 transitions. [2020-12-02 21:40:04,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 21:40:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 15536 transitions. [2020-12-02 21:40:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 21:40:04,939 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:04,940 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-02 21:40:04,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-02 21:40:04,940 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-02 21:40:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash -586116813, now seen corresponding path program 1 times [2020-12-02 21:40:04,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:04,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818730845] [2020-12-02 21:40:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:05,106 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-02 21:40:05,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818730845] [2020-12-02 21:40:05,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:05,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 21:40:05,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917871371] [2020-12-02 21:40:05,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 21:40:05,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 21:40:05,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-02 21:40:05,108 INFO L87 Difference]: Start difference. First operand 3933 states and 15536 transitions. Second operand 10 states. [2020-12-02 21:40:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:05,676 INFO L93 Difference]: Finished difference Result 4734 states and 18567 transitions. [2020-12-02 21:40:05,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 21:40:05,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-12-02 21:40:05,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:05,688 INFO L225 Difference]: With dead ends: 4734 [2020-12-02 21:40:05,688 INFO L226 Difference]: Without dead ends: 4685 [2020-12-02 21:40:05,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-02 21:40:05,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2020-12-02 21:40:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 3841. [2020-12-02 21:40:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2020-12-02 21:40:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 15162 transitions. [2020-12-02 21:40:05,756 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 15162 transitions. Word has length 21 [2020-12-02 21:40:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:05,756 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 15162 transitions. [2020-12-02 21:40:05,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 21:40:05,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 15162 transitions. [2020-12-02 21:40:05,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 21:40:05,760 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:05,760 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-02 21:40:05,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-02 21:40:05,760 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-02 21:40:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:05,761 INFO L82 PathProgramCache]: Analyzing trace with hash -757352757, now seen corresponding path program 1 times [2020-12-02 21:40:05,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:05,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512483768] [2020-12-02 21:40:05,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:06,051 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-02 21:40:06,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512483768] [2020-12-02 21:40:06,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:06,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 21:40:06,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907184226] [2020-12-02 21:40:06,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 21:40:06,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:06,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 21:40:06,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-02 21:40:06,055 INFO L87 Difference]: Start difference. First operand 3841 states and 15162 transitions. Second operand 12 states. [2020-12-02 21:40:07,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:07,090 INFO L93 Difference]: Finished difference Result 5118 states and 20406 transitions. [2020-12-02 21:40:07,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-02 21:40:07,090 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-02 21:40:07,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:07,101 INFO L225 Difference]: With dead ends: 5118 [2020-12-02 21:40:07,101 INFO L226 Difference]: Without dead ends: 4964 [2020-12-02 21:40:07,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2020-12-02 21:40:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4964 states. [2020-12-02 21:40:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4964 to 3443. [2020-12-02 21:40:07,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3443 states. [2020-12-02 21:40:07,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3443 states to 3443 states and 13378 transitions. [2020-12-02 21:40:07,168 INFO L78 Accepts]: Start accepts. Automaton has 3443 states and 13378 transitions. Word has length 21 [2020-12-02 21:40:07,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:07,168 INFO L481 AbstractCegarLoop]: Abstraction has 3443 states and 13378 transitions. [2020-12-02 21:40:07,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 21:40:07,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3443 states and 13378 transitions. [2020-12-02 21:40:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 21:40:07,170 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:07,170 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-02 21:40:07,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-02 21:40:07,170 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-02 21:40:07,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:07,171 INFO L82 PathProgramCache]: Analyzing trace with hash 820571943, now seen corresponding path program 2 times [2020-12-02 21:40:07,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:07,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125384983] [2020-12-02 21:40:07,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:07,394 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-02 21:40:07,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125384983] [2020-12-02 21:40:07,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:07,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 21:40:07,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021315634] [2020-12-02 21:40:07,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 21:40:07,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:07,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 21:40:07,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-02 21:40:07,397 INFO L87 Difference]: Start difference. First operand 3443 states and 13378 transitions. Second operand 12 states. [2020-12-02 21:40:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:07,934 INFO L93 Difference]: Finished difference Result 4562 states and 17491 transitions. [2020-12-02 21:40:07,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 21:40:07,935 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-12-02 21:40:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:07,945 INFO L225 Difference]: With dead ends: 4562 [2020-12-02 21:40:07,945 INFO L226 Difference]: Without dead ends: 4510 [2020-12-02 21:40:07,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-02 21:40:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2020-12-02 21:40:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 3368. [2020-12-02 21:40:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3368 states. [2020-12-02 21:40:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 12841 transitions. [2020-12-02 21:40:08,075 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 12841 transitions. Word has length 21 [2020-12-02 21:40:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:08,075 INFO L481 AbstractCegarLoop]: Abstraction has 3368 states and 12841 transitions. [2020-12-02 21:40:08,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 21:40:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 12841 transitions. [2020-12-02 21:40:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 21:40:08,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:08,077 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-02 21:40:08,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-02 21:40:08,078 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-02 21:40:08,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:08,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1673753334, now seen corresponding path program 1 times [2020-12-02 21:40:08,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:08,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626743411] [2020-12-02 21:40:08,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:08,184 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-02 21:40:08,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626743411] [2020-12-02 21:40:08,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:08,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-02 21:40:08,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123750446] [2020-12-02 21:40:08,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 21:40:08,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:08,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 21:40:08,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-02 21:40:08,187 INFO L87 Difference]: Start difference. First operand 3368 states and 12841 transitions. Second operand 7 states. [2020-12-02 21:40:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:08,294 INFO L93 Difference]: Finished difference Result 3879 states and 14497 transitions. [2020-12-02 21:40:08,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 21:40:08,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-02 21:40:08,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:08,307 INFO L225 Difference]: With dead ends: 3879 [2020-12-02 21:40:08,308 INFO L226 Difference]: Without dead ends: 3785 [2020-12-02 21:40:08,308 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-02 21:40:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2020-12-02 21:40:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3369. [2020-12-02 21:40:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3369 states. [2020-12-02 21:40:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 12845 transitions. [2020-12-02 21:40:08,419 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 12845 transitions. Word has length 21 [2020-12-02 21:40:08,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:08,419 INFO L481 AbstractCegarLoop]: Abstraction has 3369 states and 12845 transitions. [2020-12-02 21:40:08,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 21:40:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 12845 transitions. [2020-12-02 21:40:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 21:40:08,423 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:08,423 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-02 21:40:08,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-02 21:40:08,424 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-02 21:40:08,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:08,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1208728268, now seen corresponding path program 1 times [2020-12-02 21:40:08,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:08,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789062793] [2020-12-02 21:40:08,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:08,689 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-02 21:40:08,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789062793] [2020-12-02 21:40:08,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:08,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 21:40:08,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178561483] [2020-12-02 21:40:08,690 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 21:40:08,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:08,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 21:40:08,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-02 21:40:08,691 INFO L87 Difference]: Start difference. First operand 3369 states and 12845 transitions. Second operand 11 states. [2020-12-02 21:40:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:09,554 INFO L93 Difference]: Finished difference Result 4138 states and 15694 transitions. [2020-12-02 21:40:09,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 21:40:09,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-12-02 21:40:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:09,565 INFO L225 Difference]: With dead ends: 4138 [2020-12-02 21:40:09,565 INFO L226 Difference]: Without dead ends: 4089 [2020-12-02 21:40:09,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-12-02 21:40:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2020-12-02 21:40:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 3004. [2020-12-02 21:40:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2020-12-02 21:40:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 11303 transitions. [2020-12-02 21:40:09,658 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 11303 transitions. Word has length 21 [2020-12-02 21:40:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:09,658 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 11303 transitions. [2020-12-02 21:40:09,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 21:40:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 11303 transitions. [2020-12-02 21:40:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 21:40:09,662 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:09,662 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-02 21:40:09,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-02 21:40:09,662 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-02 21:40:09,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash 172061386, now seen corresponding path program 2 times [2020-12-02 21:40:09,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:09,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331057163] [2020-12-02 21:40:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:09,756 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-02 21:40:09,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331057163] [2020-12-02 21:40:09,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:09,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 21:40:09,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947192040] [2020-12-02 21:40:09,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 21:40:09,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:09,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 21:40:09,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-02 21:40:09,759 INFO L87 Difference]: Start difference. First operand 3004 states and 11303 transitions. Second operand 8 states. [2020-12-02 21:40:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:09,908 INFO L93 Difference]: Finished difference Result 3058 states and 11357 transitions. [2020-12-02 21:40:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 21:40:09,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-12-02 21:40:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:09,917 INFO L225 Difference]: With dead ends: 3058 [2020-12-02 21:40:09,917 INFO L226 Difference]: Without dead ends: 3058 [2020-12-02 21:40:09,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-02 21:40:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-12-02 21:40:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2831. [2020-12-02 21:40:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-12-02 21:40:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-12-02 21:40:09,976 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-12-02 21:40:09,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:09,977 INFO L481 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-12-02 21:40:09,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 21:40:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-12-02 21:40:09,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 21:40:09,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:09,980 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-02 21:40:09,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-02 21:40:09,980 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-02 21:40:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:09,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1320448504, now seen corresponding path program 1 times [2020-12-02 21:40:09,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:09,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883468794] [2020-12-02 21:40:09,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:10,076 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-02 21:40:10,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883468794] [2020-12-02 21:40:10,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:10,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 21:40:10,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776082740] [2020-12-02 21:40:10,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 21:40:10,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:10,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 21:40:10,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 21:40:10,079 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2020-12-02 21:40:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:10,426 INFO L93 Difference]: Finished difference Result 3550 states and 13085 transitions. [2020-12-02 21:40:10,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 21:40:10,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-12-02 21:40:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:10,440 INFO L225 Difference]: With dead ends: 3550 [2020-12-02 21:40:10,440 INFO L226 Difference]: Without dead ends: 3490 [2020-12-02 21:40:10,441 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-02 21:40:10,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2020-12-02 21:40:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 2828. [2020-12-02 21:40:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2020-12-02 21:40:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 10620 transitions. [2020-12-02 21:40:10,547 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 10620 transitions. Word has length 22 [2020-12-02 21:40:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:10,547 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 10620 transitions. [2020-12-02 21:40:10,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 21:40:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 10620 transitions. [2020-12-02 21:40:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 21:40:10,551 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:10,551 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-02 21:40:10,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-02 21:40:10,552 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-02 21:40:10,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:10,552 INFO L82 PathProgramCache]: Analyzing trace with hash -893918318, now seen corresponding path program 2 times [2020-12-02 21:40:10,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:10,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725829732] [2020-12-02 21:40:10,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:10,708 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-02 21:40:10,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725829732] [2020-12-02 21:40:10,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:10,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 21:40:10,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243570049] [2020-12-02 21:40:10,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 21:40:10,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:10,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 21:40:10,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-02 21:40:10,713 INFO L87 Difference]: Start difference. First operand 2828 states and 10620 transitions. Second operand 9 states. [2020-12-02 21:40:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:11,079 INFO L93 Difference]: Finished difference Result 3862 states and 14252 transitions. [2020-12-02 21:40:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 21:40:11,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-12-02 21:40:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:11,091 INFO L225 Difference]: With dead ends: 3862 [2020-12-02 21:40:11,091 INFO L226 Difference]: Without dead ends: 3802 [2020-12-02 21:40:11,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-02 21:40:11,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2020-12-02 21:40:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 2822. [2020-12-02 21:40:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-12-02 21:40:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-12-02 21:40:11,170 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-12-02 21:40:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:11,171 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-12-02 21:40:11,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 21:40:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-12-02 21:40:11,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 21:40:11,174 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:11,174 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-02 21:40:11,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-02 21:40:11,175 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-02 21:40:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:11,176 INFO L82 PathProgramCache]: Analyzing trace with hash 131153448, now seen corresponding path program 3 times [2020-12-02 21:40:11,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:11,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759190149] [2020-12-02 21:40:11,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:11,307 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-02 21:40:11,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759190149] [2020-12-02 21:40:11,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:11,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 21:40:11,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285085974] [2020-12-02 21:40:11,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 21:40:11,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:11,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 21:40:11,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 21:40:11,310 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 10 states. [2020-12-02 21:40:11,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:11,680 INFO L93 Difference]: Finished difference Result 4277 states and 15941 transitions. [2020-12-02 21:40:11,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 21:40:11,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-02 21:40:11,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:11,690 INFO L225 Difference]: With dead ends: 4277 [2020-12-02 21:40:11,690 INFO L226 Difference]: Without dead ends: 4217 [2020-12-02 21:40:11,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-12-02 21:40:11,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2020-12-02 21:40:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 2818. [2020-12-02 21:40:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2818 states. [2020-12-02 21:40:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 10596 transitions. [2020-12-02 21:40:11,751 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 10596 transitions. Word has length 22 [2020-12-02 21:40:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:11,751 INFO L481 AbstractCegarLoop]: Abstraction has 2818 states and 10596 transitions. [2020-12-02 21:40:11,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 21:40:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 10596 transitions. [2020-12-02 21:40:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 21:40:11,754 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:11,754 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-02 21:40:11,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-02 21:40:11,755 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-02 21:40:11,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:11,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1026439080, now seen corresponding path program 4 times [2020-12-02 21:40:11,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:11,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823845761] [2020-12-02 21:40:11,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:11,863 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-02 21:40:11,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823845761] [2020-12-02 21:40:11,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:11,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 21:40:11,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675251094] [2020-12-02 21:40:11,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 21:40:11,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:11,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 21:40:11,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-02 21:40:11,866 INFO L87 Difference]: Start difference. First operand 2818 states and 10596 transitions. Second operand 10 states. [2020-12-02 21:40:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:12,110 INFO L93 Difference]: Finished difference Result 3433 states and 12660 transitions. [2020-12-02 21:40:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:40:12,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-02 21:40:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:12,118 INFO L225 Difference]: With dead ends: 3433 [2020-12-02 21:40:12,118 INFO L226 Difference]: Without dead ends: 3373 [2020-12-02 21:40:12,119 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-02 21:40:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2020-12-02 21:40:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 2730. [2020-12-02 21:40:12,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2020-12-02 21:40:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10232 transitions. [2020-12-02 21:40:12,164 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10232 transitions. Word has length 22 [2020-12-02 21:40:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:12,164 INFO L481 AbstractCegarLoop]: Abstraction has 2730 states and 10232 transitions. [2020-12-02 21:40:12,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 21:40:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10232 transitions. [2020-12-02 21:40:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 21:40:12,167 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:12,167 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-02 21:40:12,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-02 21:40:12,167 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-02 21:40:12,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:12,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1544480782, now seen corresponding path program 5 times [2020-12-02 21:40:12,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:12,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336069713] [2020-12-02 21:40:12,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:12,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-02 21:40:12,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336069713] [2020-12-02 21:40:12,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:12,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 21:40:12,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286440720] [2020-12-02 21:40:12,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 21:40:12,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:12,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 21:40:12,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-02 21:40:12,386 INFO L87 Difference]: Start difference. First operand 2730 states and 10232 transitions. Second operand 12 states. [2020-12-02 21:40:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:12,827 INFO L93 Difference]: Finished difference Result 3588 states and 13121 transitions. [2020-12-02 21:40:12,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:40:12,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-02 21:40:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:12,836 INFO L225 Difference]: With dead ends: 3588 [2020-12-02 21:40:12,836 INFO L226 Difference]: Without dead ends: 3528 [2020-12-02 21:40:12,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-12-02 21:40:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2020-12-02 21:40:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 2670. [2020-12-02 21:40:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-12-02 21:40:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2020-12-02 21:40:12,880 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2020-12-02 21:40:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:12,881 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2020-12-02 21:40:12,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 21:40:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2020-12-02 21:40:12,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 21:40:12,883 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:12,883 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-02 21:40:12,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-02 21:40:12,883 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-02 21:40:12,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:12,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1499150017, now seen corresponding path program 1 times [2020-12-02 21:40:12,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:12,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79699164] [2020-12-02 21:40:12,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:40:13,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79699164] [2020-12-02 21:40:13,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:13,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 21:40:13,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754542533] [2020-12-02 21:40:13,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 21:40:13,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:13,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 21:40:13,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-02 21:40:13,154 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2020-12-02 21:40:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:13,918 INFO L93 Difference]: Finished difference Result 2896 states and 10368 transitions. [2020-12-02 21:40:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 21:40:13,918 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-02 21:40:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:13,925 INFO L225 Difference]: With dead ends: 2896 [2020-12-02 21:40:13,925 INFO L226 Difference]: Without dead ends: 2802 [2020-12-02 21:40:13,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2020-12-02 21:40:13,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2020-12-02 21:40:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2426. [2020-12-02 21:40:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2020-12-02 21:40:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 8840 transitions. [2020-12-02 21:40:13,964 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 8840 transitions. Word has length 23 [2020-12-02 21:40:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:13,964 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 8840 transitions. [2020-12-02 21:40:13,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 21:40:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 8840 transitions. [2020-12-02 21:40:13,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 21:40:13,966 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:13,966 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:40:13,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-02 21:40:13,966 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-02 21:40:13,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:13,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1292151056, now seen corresponding path program 1 times [2020-12-02 21:40:13,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:13,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224254239] [2020-12-02 21:40:13,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:14,255 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-02 21:40:14,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224254239] [2020-12-02 21:40:14,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:14,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 21:40:14,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334151605] [2020-12-02 21:40:14,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 21:40:14,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:14,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 21:40:14,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-12-02 21:40:14,258 INFO L87 Difference]: Start difference. First operand 2426 states and 8840 transitions. Second operand 12 states. [2020-12-02 21:40:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:15,011 INFO L93 Difference]: Finished difference Result 2538 states and 8863 transitions. [2020-12-02 21:40:15,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 21:40:15,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-12-02 21:40:15,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:15,016 INFO L225 Difference]: With dead ends: 2538 [2020-12-02 21:40:15,017 INFO L226 Difference]: Without dead ends: 2419 [2020-12-02 21:40:15,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-12-02 21:40:15,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2020-12-02 21:40:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 1794. [2020-12-02 21:40:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-12-02 21:40:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2020-12-02 21:40:15,046 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2020-12-02 21:40:15,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:15,046 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2020-12-02 21:40:15,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 21:40:15,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2020-12-02 21:40:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 21:40:15,048 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:15,048 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-02 21:40:15,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-02 21:40:15,048 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-02 21:40:15,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:15,049 INFO L82 PathProgramCache]: Analyzing trace with hash -974214744, now seen corresponding path program 1 times [2020-12-02 21:40:15,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:15,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120162427] [2020-12-02 21:40:15,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:15,091 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-02 21:40:15,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120162427] [2020-12-02 21:40:15,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:15,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-02 21:40:15,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999501094] [2020-12-02 21:40:15,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 21:40:15,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:15,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 21:40:15,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-02 21:40:15,094 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 6 states. [2020-12-02 21:40:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:15,253 INFO L93 Difference]: Finished difference Result 2291 states and 7723 transitions. [2020-12-02 21:40:15,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 21:40:15,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-12-02 21:40:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:15,259 INFO L225 Difference]: With dead ends: 2291 [2020-12-02 21:40:15,260 INFO L226 Difference]: Without dead ends: 2227 [2020-12-02 21:40:15,260 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-02 21:40:15,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2020-12-02 21:40:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2106. [2020-12-02 21:40:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-12-02 21:40:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2020-12-02 21:40:15,307 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2020-12-02 21:40:15,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:15,307 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2020-12-02 21:40:15,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 21:40:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2020-12-02 21:40:15,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 21:40:15,311 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:15,311 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-02 21:40:15,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-02 21:40:15,311 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-02 21:40:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:15,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1120972762, now seen corresponding path program 2 times [2020-12-02 21:40:15,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:15,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687519028] [2020-12-02 21:40:15,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:40:15,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687519028] [2020-12-02 21:40:15,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:15,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 21:40:15,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886436008] [2020-12-02 21:40:15,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 21:40:15,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:15,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 21:40:15,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 21:40:15,414 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 8 states. [2020-12-02 21:40:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:15,751 INFO L93 Difference]: Finished difference Result 2599 states and 8709 transitions. [2020-12-02 21:40:15,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 21:40:15,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-02 21:40:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:15,758 INFO L225 Difference]: With dead ends: 2599 [2020-12-02 21:40:15,758 INFO L226 Difference]: Without dead ends: 2535 [2020-12-02 21:40:15,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-12-02 21:40:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2020-12-02 21:40:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2102. [2020-12-02 21:40:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2020-12-02 21:40:15,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7273 transitions. [2020-12-02 21:40:15,813 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7273 transitions. Word has length 24 [2020-12-02 21:40:15,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:15,814 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7273 transitions. [2020-12-02 21:40:15,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 21:40:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7273 transitions. [2020-12-02 21:40:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 21:40:15,817 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:15,817 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-02 21:40:15,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-02 21:40:15,817 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-02 21:40:15,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:15,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1176290112, now seen corresponding path program 3 times [2020-12-02 21:40:15,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:15,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199929137] [2020-12-02 21:40:15,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:15,948 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-02 21:40:15,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199929137] [2020-12-02 21:40:15,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:15,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 21:40:15,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824066801] [2020-12-02 21:40:15,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 21:40:15,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:15,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 21:40:15,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-02 21:40:15,951 INFO L87 Difference]: Start difference. First operand 2102 states and 7273 transitions. Second operand 9 states. [2020-12-02 21:40:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:16,352 INFO L93 Difference]: Finished difference Result 2898 states and 9677 transitions. [2020-12-02 21:40:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 21:40:16,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-12-02 21:40:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:16,360 INFO L225 Difference]: With dead ends: 2898 [2020-12-02 21:40:16,360 INFO L226 Difference]: Without dead ends: 2834 [2020-12-02 21:40:16,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-12-02 21:40:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2020-12-02 21:40:16,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2093. [2020-12-02 21:40:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2020-12-02 21:40:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 7255 transitions. [2020-12-02 21:40:16,414 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 7255 transitions. Word has length 24 [2020-12-02 21:40:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:16,414 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 7255 transitions. [2020-12-02 21:40:16,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 21:40:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 7255 transitions. [2020-12-02 21:40:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 21:40:16,418 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:16,418 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-02 21:40:16,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-02 21:40:16,418 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-02 21:40:16,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:16,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1572220842, now seen corresponding path program 4 times [2020-12-02 21:40:16,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:16,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424660852] [2020-12-02 21:40:16,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:16,581 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-02 21:40:16,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424660852] [2020-12-02 21:40:16,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:16,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-02 21:40:16,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515061214] [2020-12-02 21:40:16,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 21:40:16,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:16,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 21:40:16,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-02 21:40:16,584 INFO L87 Difference]: Start difference. First operand 2093 states and 7255 transitions. Second operand 10 states. [2020-12-02 21:40:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:16,993 INFO L93 Difference]: Finished difference Result 2875 states and 9618 transitions. [2020-12-02 21:40:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 21:40:16,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-12-02 21:40:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:17,000 INFO L225 Difference]: With dead ends: 2875 [2020-12-02 21:40:17,000 INFO L226 Difference]: Without dead ends: 2811 [2020-12-02 21:40:17,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-12-02 21:40:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2020-12-02 21:40:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2079. [2020-12-02 21:40:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2020-12-02 21:40:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 7214 transitions. [2020-12-02 21:40:17,048 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 7214 transitions. Word has length 24 [2020-12-02 21:40:17,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:17,048 INFO L481 AbstractCegarLoop]: Abstraction has 2079 states and 7214 transitions. [2020-12-02 21:40:17,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 21:40:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 7214 transitions. [2020-12-02 21:40:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 21:40:17,051 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:17,051 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-02 21:40:17,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-02 21:40:17,052 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-02 21:40:17,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:17,054 INFO L82 PathProgramCache]: Analyzing trace with hash 438749216, now seen corresponding path program 5 times [2020-12-02 21:40:17,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:17,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161725092] [2020-12-02 21:40:17,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:17,191 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-02 21:40:17,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161725092] [2020-12-02 21:40:17,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:17,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 21:40:17,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187159124] [2020-12-02 21:40:17,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 21:40:17,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:17,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 21:40:17,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-02 21:40:17,194 INFO L87 Difference]: Start difference. First operand 2079 states and 7214 transitions. Second operand 11 states. [2020-12-02 21:40:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:17,511 INFO L93 Difference]: Finished difference Result 3106 states and 10587 transitions. [2020-12-02 21:40:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 21:40:17,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-02 21:40:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:17,518 INFO L225 Difference]: With dead ends: 3106 [2020-12-02 21:40:17,518 INFO L226 Difference]: Without dead ends: 3042 [2020-12-02 21:40:17,519 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-02 21:40:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2020-12-02 21:40:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2071. [2020-12-02 21:40:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2020-12-02 21:40:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7186 transitions. [2020-12-02 21:40:17,554 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7186 transitions. Word has length 24 [2020-12-02 21:40:17,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:17,555 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 7186 transitions. [2020-12-02 21:40:17,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 21:40:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7186 transitions. [2020-12-02 21:40:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 21:40:17,557 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:17,557 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-02 21:40:17,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-02 21:40:17,558 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-02 21:40:17,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:17,558 INFO L82 PathProgramCache]: Analyzing trace with hash 991769996, now seen corresponding path program 6 times [2020-12-02 21:40:17,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:17,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706543346] [2020-12-02 21:40:17,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:17,712 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-02 21:40:17,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706543346] [2020-12-02 21:40:17,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:17,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-02 21:40:17,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362616224] [2020-12-02 21:40:17,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 21:40:17,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 21:40:17,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-12-02 21:40:17,714 INFO L87 Difference]: Start difference. First operand 2071 states and 7186 transitions. Second operand 11 states. [2020-12-02 21:40:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:17,964 INFO L93 Difference]: Finished difference Result 2481 states and 8355 transitions. [2020-12-02 21:40:17,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:40:17,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-02 21:40:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:17,970 INFO L225 Difference]: With dead ends: 2481 [2020-12-02 21:40:17,970 INFO L226 Difference]: Without dead ends: 2417 [2020-12-02 21:40:17,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2020-12-02 21:40:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2020-12-02 21:40:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2039. [2020-12-02 21:40:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2020-12-02 21:40:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 7058 transitions. [2020-12-02 21:40:18,002 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 7058 transitions. Word has length 24 [2020-12-02 21:40:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:18,003 INFO L481 AbstractCegarLoop]: Abstraction has 2039 states and 7058 transitions. [2020-12-02 21:40:18,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 21:40:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 7058 transitions. [2020-12-02 21:40:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 21:40:18,006 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:18,006 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-02 21:40:18,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-02 21:40:18,006 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-02 21:40:18,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:18,006 INFO L82 PathProgramCache]: Analyzing trace with hash 71780478, now seen corresponding path program 7 times [2020-12-02 21:40:18,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:18,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660205962] [2020-12-02 21:40:18,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:18,261 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-02 21:40:18,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660205962] [2020-12-02 21:40:18,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:18,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-02 21:40:18,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580183616] [2020-12-02 21:40:18,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-02 21:40:18,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:18,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-02 21:40:18,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-12-02 21:40:18,263 INFO L87 Difference]: Start difference. First operand 2039 states and 7058 transitions. Second operand 13 states. [2020-12-02 21:40:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:19,138 INFO L93 Difference]: Finished difference Result 3018 states and 10169 transitions. [2020-12-02 21:40:19,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 21:40:19,139 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-12-02 21:40:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:19,146 INFO L225 Difference]: With dead ends: 3018 [2020-12-02 21:40:19,146 INFO L226 Difference]: Without dead ends: 2890 [2020-12-02 21:40:19,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2020-12-02 21:40:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-12-02 21:40:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1971. [2020-12-02 21:40:19,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2020-12-02 21:40:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 6882 transitions. [2020-12-02 21:40:19,180 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 6882 transitions. Word has length 24 [2020-12-02 21:40:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:19,180 INFO L481 AbstractCegarLoop]: Abstraction has 1971 states and 6882 transitions. [2020-12-02 21:40:19,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-02 21:40:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 6882 transitions. [2020-12-02 21:40:19,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-02 21:40:19,182 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:19,182 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-02 21:40:19,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-02 21:40:19,182 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-02 21:40:19,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:19,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1318319474, now seen corresponding path program 1 times [2020-12-02 21:40:19,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:19,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358490187] [2020-12-02 21:40:19,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:19,401 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-02 21:40:19,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358490187] [2020-12-02 21:40:19,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:19,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 21:40:19,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178956569] [2020-12-02 21:40:19,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 21:40:19,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:19,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 21:40:19,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-02 21:40:19,404 INFO L87 Difference]: Start difference. First operand 1971 states and 6882 transitions. Second operand 12 states. [2020-12-02 21:40:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:19,748 INFO L93 Difference]: Finished difference Result 3157 states and 10632 transitions. [2020-12-02 21:40:19,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-02 21:40:19,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-12-02 21:40:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:19,755 INFO L225 Difference]: With dead ends: 3157 [2020-12-02 21:40:19,755 INFO L226 Difference]: Without dead ends: 3133 [2020-12-02 21:40:19,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-02 21:40:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2020-12-02 21:40:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 1613. [2020-12-02 21:40:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2020-12-02 21:40:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5563 transitions. [2020-12-02 21:40:19,787 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 5563 transitions. Word has length 24 [2020-12-02 21:40:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:19,787 INFO L481 AbstractCegarLoop]: Abstraction has 1613 states and 5563 transitions. [2020-12-02 21:40:19,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 21:40:19,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 5563 transitions. [2020-12-02 21:40:19,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 21:40:19,790 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:19,790 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-02 21:40:19,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-02 21:40:19,791 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-02 21:40:19,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:19,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1290250801, now seen corresponding path program 1 times [2020-12-02 21:40:19,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:19,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374420705] [2020-12-02 21:40:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:19,992 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-02 21:40:19,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374420705] [2020-12-02 21:40:19,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:19,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 21:40:19,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081131837] [2020-12-02 21:40:19,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 21:40:19,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:19,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 21:40:19,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-02 21:40:19,995 INFO L87 Difference]: Start difference. First operand 1613 states and 5563 transitions. Second operand 12 states. [2020-12-02 21:40:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:20,613 INFO L93 Difference]: Finished difference Result 2298 states and 7608 transitions. [2020-12-02 21:40:20,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 21:40:20,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-02 21:40:20,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:20,620 INFO L225 Difference]: With dead ends: 2298 [2020-12-02 21:40:20,620 INFO L226 Difference]: Without dead ends: 2254 [2020-12-02 21:40:20,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2020-12-02 21:40:20,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2020-12-02 21:40:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1611. [2020-12-02 21:40:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2020-12-02 21:40:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 5567 transitions. [2020-12-02 21:40:20,660 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 5567 transitions. Word has length 26 [2020-12-02 21:40:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:20,660 INFO L481 AbstractCegarLoop]: Abstraction has 1611 states and 5567 transitions. [2020-12-02 21:40:20,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 21:40:20,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 5567 transitions. [2020-12-02 21:40:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 21:40:20,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:20,664 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-02 21:40:20,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-02 21:40:20,664 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-02 21:40:20,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:20,665 INFO L82 PathProgramCache]: Analyzing trace with hash -943856693, now seen corresponding path program 2 times [2020-12-02 21:40:20,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:20,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769967884] [2020-12-02 21:40:20,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:20,857 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-02 21:40:20,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769967884] [2020-12-02 21:40:20,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:20,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 21:40:20,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376418632] [2020-12-02 21:40:20,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 21:40:20,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:20,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 21:40:20,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-02 21:40:20,859 INFO L87 Difference]: Start difference. First operand 1611 states and 5567 transitions. Second operand 12 states. [2020-12-02 21:40:21,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:21,289 INFO L93 Difference]: Finished difference Result 2242 states and 7477 transitions. [2020-12-02 21:40:21,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 21:40:21,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-02 21:40:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:21,295 INFO L225 Difference]: With dead ends: 2242 [2020-12-02 21:40:21,295 INFO L226 Difference]: Without dead ends: 2198 [2020-12-02 21:40:21,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-02 21:40:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2020-12-02 21:40:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1587. [2020-12-02 21:40:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-12-02 21:40:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 5509 transitions. [2020-12-02 21:40:21,321 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 5509 transitions. Word has length 26 [2020-12-02 21:40:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:21,321 INFO L481 AbstractCegarLoop]: Abstraction has 1587 states and 5509 transitions. [2020-12-02 21:40:21,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 21:40:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 5509 transitions. [2020-12-02 21:40:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-02 21:40:21,323 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:21,324 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-02 21:40:21,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-02 21:40:21,324 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-02 21:40:21,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:21,324 INFO L82 PathProgramCache]: Analyzing trace with hash -390835913, now seen corresponding path program 3 times [2020-12-02 21:40:21,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:21,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112405928] [2020-12-02 21:40:21,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:21,510 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-02 21:40:21,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112405928] [2020-12-02 21:40:21,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:21,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-02 21:40:21,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907703141] [2020-12-02 21:40:21,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 21:40:21,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:21,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 21:40:21,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-02 21:40:21,511 INFO L87 Difference]: Start difference. First operand 1587 states and 5509 transitions. Second operand 12 states. [2020-12-02 21:40:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:21,907 INFO L93 Difference]: Finished difference Result 1640 states and 5473 transitions. [2020-12-02 21:40:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 21:40:21,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-12-02 21:40:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:21,912 INFO L225 Difference]: With dead ends: 1640 [2020-12-02 21:40:21,913 INFO L226 Difference]: Without dead ends: 1596 [2020-12-02 21:40:21,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-02 21:40:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2020-12-02 21:40:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 885. [2020-12-02 21:40:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-02 21:40:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-12-02 21:40:21,940 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-12-02 21:40:21,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:21,940 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-12-02 21:40:21,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 21:40:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-12-02 21:40:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 21:40:21,943 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:21,943 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-02 21:40:21,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-02 21:40:21,944 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-02 21:40:21,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1977826857, now seen corresponding path program 1 times [2020-12-02 21:40:21,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:21,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242148815] [2020-12-02 21:40:21,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:22,072 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-02 21:40:22,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242148815] [2020-12-02 21:40:22,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:22,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 21:40:22,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897085890] [2020-12-02 21:40:22,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 21:40:22,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:22,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 21:40:22,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 21:40:22,075 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-12-02 21:40:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:22,268 INFO L93 Difference]: Finished difference Result 885 states and 3021 transitions. [2020-12-02 21:40:22,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:40:22,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-02 21:40:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:22,271 INFO L225 Difference]: With dead ends: 885 [2020-12-02 21:40:22,271 INFO L226 Difference]: Without dead ends: 885 [2020-12-02 21:40:22,272 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-02 21:40:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2020-12-02 21:40:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2020-12-02 21:40:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-02 21:40:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3021 transitions. [2020-12-02 21:40:22,285 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3021 transitions. Word has length 41 [2020-12-02 21:40:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:22,285 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3021 transitions. [2020-12-02 21:40:22,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 21:40:22,286 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3021 transitions. [2020-12-02 21:40:22,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 21:40:22,287 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:22,288 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-02 21:40:22,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-02 21:40:22,288 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-02 21:40:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:22,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1154622732, now seen corresponding path program 1 times [2020-12-02 21:40:22,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:22,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010201815] [2020-12-02 21:40:22,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:22,361 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-02 21:40:22,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010201815] [2020-12-02 21:40:22,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:22,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 21:40:22,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992645551] [2020-12-02 21:40:22,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 21:40:22,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:22,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 21:40:22,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-02 21:40:22,364 INFO L87 Difference]: Start difference. First operand 885 states and 3021 transitions. Second operand 7 states. [2020-12-02 21:40:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:22,493 INFO L93 Difference]: Finished difference Result 885 states and 3017 transitions. [2020-12-02 21:40:22,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:40:22,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-02 21:40:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:22,496 INFO L225 Difference]: With dead ends: 885 [2020-12-02 21:40:22,496 INFO L226 Difference]: Without dead ends: 741 [2020-12-02 21:40:22,496 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-02 21:40:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-02 21:40:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-02 21:40:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-02 21:40:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2489 transitions. [2020-12-02 21:40:22,522 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2489 transitions. Word has length 41 [2020-12-02 21:40:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:22,522 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2489 transitions. [2020-12-02 21:40:22,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 21:40:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2489 transitions. [2020-12-02 21:40:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 21:40:22,524 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:22,524 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-02 21:40:22,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-02 21:40:22,524 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-02 21:40:22,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:22,525 INFO L82 PathProgramCache]: Analyzing trace with hash -267308717, now seen corresponding path program 1 times [2020-12-02 21:40:22,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:22,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243435308] [2020-12-02 21:40:22,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:22,646 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-02 21:40:22,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243435308] [2020-12-02 21:40:22,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:22,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-02 21:40:22,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048506630] [2020-12-02 21:40:22,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 21:40:22,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:22,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 21:40:22,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-02 21:40:22,649 INFO L87 Difference]: Start difference. First operand 741 states and 2489 transitions. Second operand 8 states. [2020-12-02 21:40:22,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:22,807 INFO L93 Difference]: Finished difference Result 741 states and 2481 transitions. [2020-12-02 21:40:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:40:22,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-12-02 21:40:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:22,809 INFO L225 Difference]: With dead ends: 741 [2020-12-02 21:40:22,810 INFO L226 Difference]: Without dead ends: 741 [2020-12-02 21:40:22,810 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-02 21:40:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2020-12-02 21:40:22,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2020-12-02 21:40:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2020-12-02 21:40:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2481 transitions. [2020-12-02 21:40:22,826 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2481 transitions. Word has length 41 [2020-12-02 21:40:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:22,826 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 2481 transitions. [2020-12-02 21:40:22,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 21:40:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2481 transitions. [2020-12-02 21:40:22,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 21:40:22,829 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:22,829 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-02 21:40:22,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-02 21:40:22,829 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-02 21:40:22,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:22,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1194300753, now seen corresponding path program 1 times [2020-12-02 21:40:22,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:22,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727484478] [2020-12-02 21:40:22,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:40:22,897 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-02 21:40:22,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727484478] [2020-12-02 21:40:22,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:40:22,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-02 21:40:22,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428349775] [2020-12-02 21:40:22,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-02 21:40:22,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:40:22,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-02 21:40:22,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-02 21:40:22,900 INFO L87 Difference]: Start difference. First operand 741 states and 2481 transitions. Second operand 7 states. [2020-12-02 21:40:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:40:23,006 INFO L93 Difference]: Finished difference Result 741 states and 2477 transitions. [2020-12-02 21:40:23,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:40:23,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-02 21:40:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:40:23,008 INFO L225 Difference]: With dead ends: 741 [2020-12-02 21:40:23,008 INFO L226 Difference]: Without dead ends: 495 [2020-12-02 21:40:23,008 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-02 21:40:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-12-02 21:40:23,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2020-12-02 21:40:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2020-12-02 21:40:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1606 transitions. [2020-12-02 21:40:23,016 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1606 transitions. Word has length 41 [2020-12-02 21:40:23,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:40:23,017 INFO L481 AbstractCegarLoop]: Abstraction has 495 states and 1606 transitions. [2020-12-02 21:40:23,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-02 21:40:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1606 transitions. [2020-12-02 21:40:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-02 21:40:23,018 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:40:23,018 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-02 21:40:23,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-02 21:40:23,018 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-02 21:40:23,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:40:23,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1766059350, now seen corresponding path program 1 times [2020-12-02 21:40:23,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:40:23,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571730412] [2020-12-02 21:40:23,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:40:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 21:40:23,037 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 21:40:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 21:40:23,055 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 21:40:23,096 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 21:40:23,097 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 21:40:23,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-02 21:40:23,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:40:23 BasicIcfg [2020-12-02 21:40:23,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 21:40:23,228 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 21:40:23,228 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 21:40:23,229 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 21:40:23,230 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:39:41" (3/4) ... [2020-12-02 21:40:23,232 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-02 21:40:23,314 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 21:40:23,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 21:40:23,316 INFO L168 Benchmark]: Toolchain (without parser) took 43554.50 ms. Allocated memory was 41.9 MB in the beginning and 1.7 GB in the end (delta: 1.7 GB). Free memory was 25.5 MB in the beginning and 1.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 322.9 MB. Max. memory is 16.1 GB. [2020-12-02 21:40:23,316 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 33.6 MB. Free memory was 16.5 MB in the beginning and 16.5 MB in the end (delta: 19.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 21:40:23,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1197.82 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 25.4 MB in the beginning and 29.6 MB in the end (delta: -4.3 MB). Peak memory consumption was 16.7 MB. Max. memory is 16.1 GB. [2020-12-02 21:40:23,317 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.69 ms. Allocated memory is still 52.4 MB. Free memory was 29.6 MB in the beginning and 27.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-02 21:40:23,318 INFO L168 Benchmark]: Boogie Preprocessor took 31.95 ms. Allocated memory is still 52.4 MB. Free memory was 27.2 MB in the beginning and 25.8 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 21:40:23,318 INFO L168 Benchmark]: RCFGBuilder took 612.14 ms. Allocated memory is still 52.4 MB. Free memory was 25.8 MB in the beginning and 28.7 MB in the end (delta: -2.9 MB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. [2020-12-02 21:40:23,319 INFO L168 Benchmark]: TraceAbstraction took 41532.59 ms. Allocated memory was 52.4 MB in the beginning and 1.7 GB in the end (delta: 1.7 GB). Free memory was 28.4 MB in the beginning and 1.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 294.2 MB. Max. memory is 16.1 GB. [2020-12-02 21:40:23,319 INFO L168 Benchmark]: Witness Printer took 86.61 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-02 21:40:23,322 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.52 ms. Allocated memory is still 33.6 MB. Free memory was 16.5 MB in the beginning and 16.5 MB in the end (delta: 19.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1197.82 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 25.4 MB in the beginning and 29.6 MB in the end (delta: -4.3 MB). Peak memory consumption was 16.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.69 ms. Allocated memory is still 52.4 MB. Free memory was 29.6 MB in the beginning and 27.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.95 ms. Allocated memory is still 52.4 MB. Free memory was 27.2 MB in the beginning and 25.8 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 612.14 ms. Allocated memory is still 52.4 MB. Free memory was 25.8 MB in the beginning and 28.7 MB in the end (delta: -2.9 MB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 41532.59 ms. Allocated memory was 52.4 MB in the beginning and 1.7 GB in the end (delta: 1.7 GB). Free memory was 28.4 MB in the beginning and 1.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 294.2 MB. Max. memory is 16.1 GB. * Witness Printer took 86.61 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 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.3s, 1145 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.1s, 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: 41.0s, OverallIterations: 53, TraceHistogramMax: 1, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 5380 SDtfs, 11076 SDslu, 16167 SDs, 0 SdLazy, 10055 SolverSat, 1668 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 60 SyntacticMatches, 18 SemanticMatches, 625 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 13.4s 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.6s SatisfiabilityAnalysisTime, 6.6s 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...