/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 12:05:46,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 12:05:46,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 12:05:47,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 12:05:47,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 12:05:47,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 12:05:47,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 12:05:47,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 12:05:47,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 12:05:47,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 12:05:47,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 12:05:47,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 12:05:47,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 12:05:47,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 12:05:47,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 12:05:47,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 12:05:47,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 12:05:47,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 12:05:47,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 12:05:47,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 12:05:47,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 12:05:47,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 12:05:47,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 12:05:47,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 12:05:47,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 12:05:47,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 12:05:47,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 12:05:47,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 12:05:47,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 12:05:47,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 12:05:47,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 12:05:47,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 12:05:47,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 12:05:47,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 12:05:47,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 12:05:47,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 12:05:47,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 12:05:47,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 12:05:47,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 12:05:47,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 12:05:47,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 12:05:47,142 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-09 12:05:47,207 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 12:05:47,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 12:05:47,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 12:05:47,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 12:05:47,214 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 12:05:47,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 12:05:47,215 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 12:05:47,215 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 12:05:47,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 12:05:47,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 12:05:47,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 12:05:47,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 12:05:47,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 12:05:47,218 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 12:05:47,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 12:05:47,218 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 12:05:47,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 12:05:47,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 12:05:47,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 12:05:47,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 12:05:47,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 12:05:47,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 12:05:47,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 12:05:47,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-09 12:05:47,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 12:05:47,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 12:05:47,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 12:05:47,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 12:05:47,229 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-09 12:05:47,229 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 [2020-11-09 12:05:47,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 12:05:47,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 12:05:47,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 12:05:47,711 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 12:05:47,712 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 12:05:47,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-11-09 12:05:47,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0162b11f7/353eb2368cca4f97959cdd85a3c1ed68/FLAG03c5c3a3c [2020-11-09 12:05:48,711 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 12:05:48,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2020-11-09 12:05:48,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0162b11f7/353eb2368cca4f97959cdd85a3c1ed68/FLAG03c5c3a3c [2020-11-09 12:05:48,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0162b11f7/353eb2368cca4f97959cdd85a3c1ed68 [2020-11-09 12:05:48,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 12:05:48,939 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 12:05:48,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 12:05:48,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 12:05:48,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 12:05:48,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:05:48" (1/1) ... [2020-11-09 12:05:48,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@894b467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:05:48, skipping insertion in model container [2020-11-09 12:05:48,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:05:48" (1/1) ... [2020-11-09 12:05:48,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 12:05:49,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 12:05:49,289 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-09 12:05:49,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:05:49,729 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 12:05:49,749 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-09 12:05:49,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:05:50,018 INFO L208 MainTranslator]: Completed translation [2020-11-09 12:05:50,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:05:50 WrapperNode [2020-11-09 12:05:50,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 12:05:50,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 12:05:50,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 12:05:50,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 12:05:50,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:05:50" (1/1) ... [2020-11-09 12:05:50,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:05:50" (1/1) ... [2020-11-09 12:05:50,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 12:05:50,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 12:05:50,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 12:05:50,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 12:05:50,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:05:50" (1/1) ... [2020-11-09 12:05:50,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:05:50" (1/1) ... [2020-11-09 12:05:50,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:05:50" (1/1) ... [2020-11-09 12:05:50,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:05:50" (1/1) ... [2020-11-09 12:05:50,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:05:50" (1/1) ... [2020-11-09 12:05:50,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:05:50" (1/1) ... [2020-11-09 12:05:50,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:05:50" (1/1) ... [2020-11-09 12:05:50,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 12:05:50,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 12:05:50,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 12:05:50,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 12:05:50,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:05:50" (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-11-09 12:05:50,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 12:05:50,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 12:05:50,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 12:05:50,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 12:05:50,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-09 12:05:50,230 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-11-09 12:05:50,230 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-11-09 12:05:50,230 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-11-09 12:05:50,230 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-11-09 12:05:50,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-11-09 12:05:50,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-11-09 12:05:50,231 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-11-09 12:05:50,231 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-11-09 12:05:50,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 12:05:50,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-09 12:05:50,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 12:05:50,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 12:05:50,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 12:05:50,235 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 12:05:50,680 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 12:05:50,680 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-09 12:05:50,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:05:50 BoogieIcfgContainer [2020-11-09 12:05:50,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 12:05:50,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 12:05:50,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 12:05:50,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 12:05:50,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:05:48" (1/3) ... [2020-11-09 12:05:50,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a92f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:05:50, skipping insertion in model container [2020-11-09 12:05:50,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:05:50" (2/3) ... [2020-11-09 12:05:50,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a92f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:05:50, skipping insertion in model container [2020-11-09 12:05:50,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:05:50" (3/3) ... [2020-11-09 12:05:50,696 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-11-09 12:05:50,713 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 12:05:50,713 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-09 12:05:50,718 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-09 12:05:50,719 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 12:05:50,806 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,807 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,807 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,807 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,808 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,808 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,808 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,809 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,809 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,809 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,810 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,810 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,810 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,811 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,811 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,811 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,811 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,812 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,812 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,812 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,813 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,813 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,813 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,813 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,814 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,814 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,814 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,814 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,815 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,815 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,815 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,815 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,816 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,816 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,817 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,817 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,817 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,817 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,817 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,817 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,818 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,819 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,819 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,819 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,819 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,820 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,820 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,820 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,820 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,821 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,821 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,821 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,822 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,822 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,822 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,822 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,823 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,823 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,823 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,823 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,824 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,824 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,824 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,824 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,825 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,825 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,825 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,825 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,825 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,826 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,826 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,826 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,826 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,827 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,827 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,827 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,827 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,828 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,828 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,828 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,829 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,829 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,829 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,829 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,830 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,830 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,830 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,830 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,831 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,831 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,831 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,831 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,831 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,832 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,832 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,832 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,833 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,833 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,833 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,833 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,833 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,834 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,834 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,834 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,834 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,835 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,835 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,835 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,835 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,836 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,836 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,836 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,837 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,837 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,837 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,837 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,838 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,838 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,838 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,838 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,838 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,839 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,839 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,839 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,839 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,839 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,840 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,840 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,840 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,840 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,841 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,841 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,841 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,842 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,842 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,842 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,842 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,843 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,843 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,843 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,843 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,843 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,844 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,844 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,844 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,845 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,845 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,845 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,846 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,846 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,846 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,846 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,847 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,847 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,847 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,847 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,848 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,848 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,848 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,848 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,848 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,849 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,849 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,849 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,850 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,850 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,850 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,850 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,850 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,850 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,851 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,851 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,851 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,851 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,852 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,852 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,852 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,852 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,853 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,853 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,853 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,853 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,853 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,853 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,854 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,854 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,854 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,855 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,855 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,855 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,855 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,856 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,856 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,856 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,856 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,856 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,857 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,857 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,857 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,857 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,861 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,861 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,861 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,862 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,869 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,870 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,870 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,870 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,873 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,873 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,873 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,874 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,876 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,877 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,877 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,877 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,878 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,878 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,881 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,881 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,881 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,882 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,882 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,882 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,882 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,882 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,883 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,883 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,883 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,883 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,883 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,884 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,884 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,884 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,884 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,886 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,887 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,887 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,887 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,887 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,888 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,888 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,891 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,891 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,892 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,892 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,897 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,898 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,898 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,898 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,898 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,899 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,901 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,902 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,902 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,902 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,906 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,906 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,907 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,907 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,909 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,910 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,910 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,910 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,913 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,913 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,914 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:50,914 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:05:51,086 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2020-11-09 12:05:51,102 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-11-09 12:05:51,131 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 12:05:51,131 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 12:05:51,131 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-09 12:05:51,131 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-09 12:05:51,131 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 12:05:51,131 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 12:05:51,132 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 12:05:51,132 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 12:05:51,153 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-09 12:05:51,156 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 252 transitions, 884 flow [2020-11-09 12:05:51,160 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 252 transitions, 884 flow [2020-11-09 12:05:51,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 180 places, 252 transitions, 884 flow [2020-11-09 12:05:51,373 INFO L129 PetriNetUnfolder]: 67/298 cut-off events. [2020-11-09 12:05:51,373 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-11-09 12:05:51,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 298 events. 67/298 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 915 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 387. Up to 24 conditions per place. [2020-11-09 12:05:51,403 INFO L116 LiptonReduction]: Number of co-enabled transitions 4628 [2020-11-09 12:05:52,583 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-11-09 12:05:55,393 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 12:05:55,518 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 12:05:55,671 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-09 12:05:55,794 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 12:05:56,343 WARN L194 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-11-09 12:05:56,629 WARN L194 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-11-09 12:05:56,904 INFO L131 LiptonReduction]: Checked pairs total: 52821 [2020-11-09 12:05:56,904 INFO L133 LiptonReduction]: Total number of compositions: 89 [2020-11-09 12:05:56,914 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 173 transitions, 726 flow [2020-11-09 12:05:57,635 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-11-09 12:05:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-11-09 12:05:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 12:05:57,646 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:05:57,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:05:57,648 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:05:57,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:05:57,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1423321664, now seen corresponding path program 1 times [2020-11-09 12:05:57,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:05:57,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260141929] [2020-11-09 12:05:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:05:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:05:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:05:58,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260141929] [2020-11-09 12:05:58,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:05:58,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:05:58,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609764981] [2020-11-09 12:05:58,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:05:58,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:05:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:05:58,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:05:58,047 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 5 states. [2020-11-09 12:05:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:05:58,413 INFO L93 Difference]: Finished difference Result 4761 states and 19901 transitions. [2020-11-09 12:05:58,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:05:58,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-09 12:05:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:05:58,486 INFO L225 Difference]: With dead ends: 4761 [2020-11-09 12:05:58,486 INFO L226 Difference]: Without dead ends: 4273 [2020-11-09 12:05:58,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:05:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4273 states. [2020-11-09 12:05:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4273 to 3019. [2020-11-09 12:05:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3019 states. [2020-11-09 12:05:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 12273 transitions. [2020-11-09 12:05:58,803 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 12273 transitions. Word has length 9 [2020-11-09 12:05:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:05:58,804 INFO L481 AbstractCegarLoop]: Abstraction has 3019 states and 12273 transitions. [2020-11-09 12:05:58,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:05:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 12273 transitions. [2020-11-09 12:05:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 12:05:58,805 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:05:58,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:05:58,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 12:05:58,806 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:05:58,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:05:58,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1027712446, now seen corresponding path program 2 times [2020-11-09 12:05:58,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:05:58,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362017012] [2020-11-09 12:05:58,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:05:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:05:59,120 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-11-09 12:05:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:05:59,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362017012] [2020-11-09 12:05:59,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:05:59,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:05:59,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677642182] [2020-11-09 12:05:59,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:05:59,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:05:59,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:05:59,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:05:59,145 INFO L87 Difference]: Start difference. First operand 3019 states and 12273 transitions. Second operand 6 states. [2020-11-09 12:05:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:05:59,463 INFO L93 Difference]: Finished difference Result 4277 states and 18060 transitions. [2020-11-09 12:05:59,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:05:59,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-11-09 12:05:59,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:05:59,515 INFO L225 Difference]: With dead ends: 4277 [2020-11-09 12:05:59,515 INFO L226 Difference]: Without dead ends: 4277 [2020-11-09 12:05:59,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:05:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4277 states. [2020-11-09 12:05:59,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4277 to 3019. [2020-11-09 12:05:59,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3019 states. [2020-11-09 12:05:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 12273 transitions. [2020-11-09 12:05:59,719 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 12273 transitions. Word has length 9 [2020-11-09 12:05:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:05:59,722 INFO L481 AbstractCegarLoop]: Abstraction has 3019 states and 12273 transitions. [2020-11-09 12:05:59,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:05:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 12273 transitions. [2020-11-09 12:05:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 12:05:59,723 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:05:59,724 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:05:59,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 12:05:59,724 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:05:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:05:59,725 INFO L82 PathProgramCache]: Analyzing trace with hash 556122090, now seen corresponding path program 3 times [2020-11-09 12:05:59,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:05:59,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150884154] [2020-11-09 12:05:59,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:05:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:05:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:05:59,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150884154] [2020-11-09 12:05:59,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:05:59,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:05:59,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641048338] [2020-11-09 12:05:59,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:05:59,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:05:59,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:05:59,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:05:59,871 INFO L87 Difference]: Start difference. First operand 3019 states and 12273 transitions. Second operand 6 states. [2020-11-09 12:06:00,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:00,213 INFO L93 Difference]: Finished difference Result 5523 states and 23828 transitions. [2020-11-09 12:06:00,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:06:00,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-11-09 12:06:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:00,299 INFO L225 Difference]: With dead ends: 5523 [2020-11-09 12:06:00,300 INFO L226 Difference]: Without dead ends: 5523 [2020-11-09 12:06:00,301 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-11-09 12:06:00,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2020-11-09 12:06:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 3008. [2020-11-09 12:06:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-11-09 12:06:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-11-09 12:06:00,527 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-11-09 12:06:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:00,527 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-11-09 12:06:00,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:06:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-11-09 12:06:00,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:06:00,530 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:00,531 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:06:00,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 12:06:00,532 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:00,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:00,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1988086522, now seen corresponding path program 1 times [2020-11-09 12:06:00,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:00,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412681811] [2020-11-09 12:06:00,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:00,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412681811] [2020-11-09 12:06:00,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:00,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:06:00,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066393862] [2020-11-09 12:06:00,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:06:00,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:00,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:06:00,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:06:00,639 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 5 states. [2020-11-09 12:06:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:00,823 INFO L93 Difference]: Finished difference Result 4187 states and 17338 transitions. [2020-11-09 12:06:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:06:00,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-09 12:06:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:00,849 INFO L225 Difference]: With dead ends: 4187 [2020-11-09 12:06:00,849 INFO L226 Difference]: Without dead ends: 4187 [2020-11-09 12:06:00,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:06:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4187 states. [2020-11-09 12:06:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4187 to 3589. [2020-11-09 12:06:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3589 states. [2020-11-09 12:06:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 15016 transitions. [2020-11-09 12:06:01,098 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 15016 transitions. Word has length 16 [2020-11-09 12:06:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:01,099 INFO L481 AbstractCegarLoop]: Abstraction has 3589 states and 15016 transitions. [2020-11-09 12:06:01,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:06:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 15016 transitions. [2020-11-09 12:06:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:06:01,108 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:01,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:06:01,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 12:06:01,109 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:01,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash 776672030, now seen corresponding path program 2 times [2020-11-09 12:06:01,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:01,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949889965] [2020-11-09 12:06:01,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:01,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949889965] [2020-11-09 12:06:01,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:01,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:06:01,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719343475] [2020-11-09 12:06:01,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:06:01,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:01,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:06:01,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:06:01,198 INFO L87 Difference]: Start difference. First operand 3589 states and 15016 transitions. Second operand 3 states. [2020-11-09 12:06:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:01,315 INFO L93 Difference]: Finished difference Result 5757 states and 23648 transitions. [2020-11-09 12:06:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:06:01,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-11-09 12:06:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:01,345 INFO L225 Difference]: With dead ends: 5757 [2020-11-09 12:06:01,346 INFO L226 Difference]: Without dead ends: 4163 [2020-11-09 12:06:01,346 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-11-09 12:06:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4163 states. [2020-11-09 12:06:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4163 to 3595. [2020-11-09 12:06:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3595 states. [2020-11-09 12:06:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 14094 transitions. [2020-11-09 12:06:01,544 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 14094 transitions. Word has length 16 [2020-11-09 12:06:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:01,545 INFO L481 AbstractCegarLoop]: Abstraction has 3595 states and 14094 transitions. [2020-11-09 12:06:01,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:06:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 14094 transitions. [2020-11-09 12:06:01,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 12:06:01,550 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:01,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:06:01,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 12:06:01,550 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:01,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:01,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1692971290, now seen corresponding path program 1 times [2020-11-09 12:06:01,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:01,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377885648] [2020-11-09 12:06:01,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:01,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377885648] [2020-11-09 12:06:01,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:01,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:06:01,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203699638] [2020-11-09 12:06:01,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:06:01,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:01,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:06:01,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:06:01,646 INFO L87 Difference]: Start difference. First operand 3595 states and 14094 transitions. Second operand 6 states. [2020-11-09 12:06:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:01,948 INFO L93 Difference]: Finished difference Result 4831 states and 19135 transitions. [2020-11-09 12:06:01,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:06:01,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-09 12:06:01,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:01,978 INFO L225 Difference]: With dead ends: 4831 [2020-11-09 12:06:01,979 INFO L226 Difference]: Without dead ends: 4807 [2020-11-09 12:06:01,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:06:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2020-11-09 12:06:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 3588. [2020-11-09 12:06:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-11-09 12:06:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-11-09 12:06:02,153 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-11-09 12:06:02,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:02,154 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-11-09 12:06:02,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:06:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-11-09 12:06:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 12:06:02,156 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:02,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:06:02,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 12:06:02,156 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:02,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:02,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1511808800, now seen corresponding path program 2 times [2020-11-09 12:06:02,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:02,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264967667] [2020-11-09 12:06:02,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:02,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264967667] [2020-11-09 12:06:02,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:02,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:06:02,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159790602] [2020-11-09 12:06:02,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:06:02,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:02,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:06:02,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:06:02,274 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-11-09 12:06:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:02,435 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-11-09 12:06:02,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:06:02,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-09 12:06:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:02,460 INFO L225 Difference]: With dead ends: 4024 [2020-11-09 12:06:02,460 INFO L226 Difference]: Without dead ends: 4024 [2020-11-09 12:06:02,461 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-11-09 12:06:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-11-09 12:06:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-11-09 12:06:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-11-09 12:06:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-11-09 12:06:02,616 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-11-09 12:06:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:02,617 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-11-09 12:06:02,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:06:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-11-09 12:06:02,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 12:06:02,618 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:02,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:06:02,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 12:06:02,619 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:02,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:02,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1715651031, now seen corresponding path program 1 times [2020-11-09 12:06:02,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:02,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105190455] [2020-11-09 12:06:02,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:02,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105190455] [2020-11-09 12:06:02,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:02,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:06:02,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426166081] [2020-11-09 12:06:02,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:06:02,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:02,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:06:02,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:06:02,708 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 5 states. [2020-11-09 12:06:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:02,916 INFO L93 Difference]: Finished difference Result 4639 states and 18148 transitions. [2020-11-09 12:06:02,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:06:02,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-09 12:06:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:02,954 INFO L225 Difference]: With dead ends: 4639 [2020-11-09 12:06:02,954 INFO L226 Difference]: Without dead ends: 4543 [2020-11-09 12:06:02,955 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:06:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2020-11-09 12:06:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 4103. [2020-11-09 12:06:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4103 states. [2020-11-09 12:06:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4103 states to 4103 states and 16284 transitions. [2020-11-09 12:06:03,135 INFO L78 Accepts]: Start accepts. Automaton has 4103 states and 16284 transitions. Word has length 18 [2020-11-09 12:06:03,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:03,135 INFO L481 AbstractCegarLoop]: Abstraction has 4103 states and 16284 transitions. [2020-11-09 12:06:03,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:06:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 16284 transitions. [2020-11-09 12:06:03,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 12:06:03,137 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:03,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:06:03,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 12:06:03,138 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1948840627, now seen corresponding path program 2 times [2020-11-09 12:06:03,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:03,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999669714] [2020-11-09 12:06:03,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:03,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999669714] [2020-11-09 12:06:03,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:03,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:06:03,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018156133] [2020-11-09 12:06:03,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:06:03,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:03,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:06:03,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:06:03,202 INFO L87 Difference]: Start difference. First operand 4103 states and 16284 transitions. Second operand 6 states. [2020-11-09 12:06:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:03,425 INFO L93 Difference]: Finished difference Result 4755 states and 18464 transitions. [2020-11-09 12:06:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:06:03,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-09 12:06:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:03,457 INFO L225 Difference]: With dead ends: 4755 [2020-11-09 12:06:03,457 INFO L226 Difference]: Without dead ends: 4659 [2020-11-09 12:06:03,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:06:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2020-11-09 12:06:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 3713. [2020-11-09 12:06:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-11-09 12:06:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-11-09 12:06:03,690 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-11-09 12:06:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:03,690 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-11-09 12:06:03,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:06:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-11-09 12:06:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 12:06:03,693 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:03,693 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:06:03,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 12:06:03,693 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash -620579829, now seen corresponding path program 3 times [2020-11-09 12:06:03,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:03,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953750598] [2020-11-09 12:06:03,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:03,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953750598] [2020-11-09 12:06:03,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:03,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 12:06:03,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991894991] [2020-11-09 12:06:03,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:06:03,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:03,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:06:03,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:06:03,840 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 8 states. [2020-11-09 12:06:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:04,233 INFO L93 Difference]: Finished difference Result 4973 states and 19765 transitions. [2020-11-09 12:06:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:06:04,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-11-09 12:06:04,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:04,260 INFO L225 Difference]: With dead ends: 4973 [2020-11-09 12:06:04,261 INFO L226 Difference]: Without dead ends: 4899 [2020-11-09 12:06:04,261 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-11-09 12:06:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2020-11-09 12:06:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 4127. [2020-11-09 12:06:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4127 states. [2020-11-09 12:06:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 16610 transitions. [2020-11-09 12:06:04,426 INFO L78 Accepts]: Start accepts. Automaton has 4127 states and 16610 transitions. Word has length 18 [2020-11-09 12:06:04,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:04,427 INFO L481 AbstractCegarLoop]: Abstraction has 4127 states and 16610 transitions. [2020-11-09 12:06:04,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:06:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4127 states and 16610 transitions. [2020-11-09 12:06:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 12:06:04,430 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:04,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:06:04,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 12:06:04,430 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:04,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:04,431 INFO L82 PathProgramCache]: Analyzing trace with hash -570830033, now seen corresponding path program 4 times [2020-11-09 12:06:04,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:04,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81671224] [2020-11-09 12:06:04,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:04,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81671224] [2020-11-09 12:06:04,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:04,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:06:04,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130107126] [2020-11-09 12:06:04,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:06:04,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:04,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:06:04,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:06:04,604 INFO L87 Difference]: Start difference. First operand 4127 states and 16610 transitions. Second operand 10 states. [2020-11-09 12:06:05,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:05,169 INFO L93 Difference]: Finished difference Result 5275 states and 21270 transitions. [2020-11-09 12:06:05,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:06:05,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-11-09 12:06:05,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:05,196 INFO L225 Difference]: With dead ends: 5275 [2020-11-09 12:06:05,196 INFO L226 Difference]: Without dead ends: 5219 [2020-11-09 12:06:05,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-11-09 12:06:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5219 states. [2020-11-09 12:06:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5219 to 4127. [2020-11-09 12:06:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4127 states. [2020-11-09 12:06:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4127 states to 4127 states and 16610 transitions. [2020-11-09 12:06:05,386 INFO L78 Accepts]: Start accepts. Automaton has 4127 states and 16610 transitions. Word has length 18 [2020-11-09 12:06:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:05,387 INFO L481 AbstractCegarLoop]: Abstraction has 4127 states and 16610 transitions. [2020-11-09 12:06:05,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:06:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4127 states and 16610 transitions. [2020-11-09 12:06:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 12:06:05,389 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:05,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:06:05,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 12:06:05,390 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:05,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1495509801, now seen corresponding path program 5 times [2020-11-09 12:06:05,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:05,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396714220] [2020-11-09 12:06:05,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:05,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396714220] [2020-11-09 12:06:05,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:05,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 12:06:05,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400866969] [2020-11-09 12:06:05,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:06:05,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:05,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:06:05,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:06:05,500 INFO L87 Difference]: Start difference. First operand 4127 states and 16610 transitions. Second operand 8 states. [2020-11-09 12:06:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:05,894 INFO L93 Difference]: Finished difference Result 6468 states and 26392 transitions. [2020-11-09 12:06:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:06:05,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-11-09 12:06:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:05,922 INFO L225 Difference]: With dead ends: 6468 [2020-11-09 12:06:05,923 INFO L226 Difference]: Without dead ends: 6394 [2020-11-09 12:06:05,923 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-11-09 12:06:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6394 states. [2020-11-09 12:06:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6394 to 4114. [2020-11-09 12:06:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2020-11-09 12:06:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 16572 transitions. [2020-11-09 12:06:06,184 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 16572 transitions. Word has length 18 [2020-11-09 12:06:06,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:06,185 INFO L481 AbstractCegarLoop]: Abstraction has 4114 states and 16572 transitions. [2020-11-09 12:06:06,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:06:06,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 16572 transitions. [2020-11-09 12:06:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 12:06:06,193 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:06,193 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-11-09 12:06:06,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 12:06:06,193 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:06,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:06,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2124042944, now seen corresponding path program 1 times [2020-11-09 12:06:06,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:06,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850054854] [2020-11-09 12:06:06,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:06,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850054854] [2020-11-09 12:06:06,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:06,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:06:06,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332510341] [2020-11-09 12:06:06,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:06:06,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:06:06,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:06:06,316 INFO L87 Difference]: Start difference. First operand 4114 states and 16572 transitions. Second operand 6 states. [2020-11-09 12:06:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:06,453 INFO L93 Difference]: Finished difference Result 4685 states and 18319 transitions. [2020-11-09 12:06:06,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:06:06,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-09 12:06:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:06,471 INFO L225 Difference]: With dead ends: 4685 [2020-11-09 12:06:06,471 INFO L226 Difference]: Without dead ends: 4685 [2020-11-09 12:06:06,472 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-11-09 12:06:06,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2020-11-09 12:06:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 4129. [2020-11-09 12:06:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-11-09 12:06:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16615 transitions. [2020-11-09 12:06:06,625 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16615 transitions. Word has length 19 [2020-11-09 12:06:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:06,625 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16615 transitions. [2020-11-09 12:06:06,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:06:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16615 transitions. [2020-11-09 12:06:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 12:06:06,632 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:06,632 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-11-09 12:06:06,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 12:06:06,633 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1995336633, now seen corresponding path program 1 times [2020-11-09 12:06:06,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:06,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477271360] [2020-11-09 12:06:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:06,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477271360] [2020-11-09 12:06:06,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:06,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:06:06,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125113853] [2020-11-09 12:06:06,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 12:06:06,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:06,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 12:06:06,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:06:06,823 INFO L87 Difference]: Start difference. First operand 4129 states and 16615 transitions. Second operand 9 states. [2020-11-09 12:06:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:07,293 INFO L93 Difference]: Finished difference Result 5929 states and 24603 transitions. [2020-11-09 12:06:07,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:06:07,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-11-09 12:06:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:07,316 INFO L225 Difference]: With dead ends: 5929 [2020-11-09 12:06:07,317 INFO L226 Difference]: Without dead ends: 5855 [2020-11-09 12:06:07,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:06:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2020-11-09 12:06:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 4117. [2020-11-09 12:06:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4117 states. [2020-11-09 12:06:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4117 states to 4117 states and 16571 transitions. [2020-11-09 12:06:07,548 INFO L78 Accepts]: Start accepts. Automaton has 4117 states and 16571 transitions. Word has length 19 [2020-11-09 12:06:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:07,550 INFO L481 AbstractCegarLoop]: Abstraction has 4117 states and 16571 transitions. [2020-11-09 12:06:07,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 12:06:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4117 states and 16571 transitions. [2020-11-09 12:06:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 12:06:07,555 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:07,555 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-11-09 12:06:07,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 12:06:07,556 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:07,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:07,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1945586837, now seen corresponding path program 2 times [2020-11-09 12:06:07,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:07,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182724048] [2020-11-09 12:06:07,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:07,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182724048] [2020-11-09 12:06:07,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:07,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:06:07,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012328463] [2020-11-09 12:06:07,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 12:06:07,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:07,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 12:06:07,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:06:07,802 INFO L87 Difference]: Start difference. First operand 4117 states and 16571 transitions. Second operand 11 states. [2020-11-09 12:06:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:08,417 INFO L93 Difference]: Finished difference Result 5748 states and 23783 transitions. [2020-11-09 12:06:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:06:08,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-11-09 12:06:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:08,444 INFO L225 Difference]: With dead ends: 5748 [2020-11-09 12:06:08,444 INFO L226 Difference]: Without dead ends: 5686 [2020-11-09 12:06:08,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-11-09 12:06:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5686 states. [2020-11-09 12:06:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5686 to 4066. [2020-11-09 12:06:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4066 states. [2020-11-09 12:06:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 16383 transitions. [2020-11-09 12:06:08,694 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 16383 transitions. Word has length 19 [2020-11-09 12:06:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:08,694 INFO L481 AbstractCegarLoop]: Abstraction has 4066 states and 16383 transitions. [2020-11-09 12:06:08,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 12:06:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 16383 transitions. [2020-11-09 12:06:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 12:06:08,698 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:08,698 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-11-09 12:06:08,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 12:06:08,698 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:08,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:08,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1149139064, now seen corresponding path program 2 times [2020-11-09 12:06:08,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:08,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179204746] [2020-11-09 12:06:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:08,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179204746] [2020-11-09 12:06:08,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:08,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:06:08,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754951652] [2020-11-09 12:06:08,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:06:08,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:08,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:06:08,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:06:08,800 INFO L87 Difference]: Start difference. First operand 4066 states and 16383 transitions. Second operand 7 states. [2020-11-09 12:06:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:08,978 INFO L93 Difference]: Finished difference Result 4549 states and 17853 transitions. [2020-11-09 12:06:08,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:06:08,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-11-09 12:06:08,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:08,995 INFO L225 Difference]: With dead ends: 4549 [2020-11-09 12:06:08,995 INFO L226 Difference]: Without dead ends: 4549 [2020-11-09 12:06:08,996 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-11-09 12:06:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2020-11-09 12:06:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 4013. [2020-11-09 12:06:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2020-11-09 12:06:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16198 transitions. [2020-11-09 12:06:09,157 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16198 transitions. Word has length 19 [2020-11-09 12:06:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:09,157 INFO L481 AbstractCegarLoop]: Abstraction has 4013 states and 16198 transitions. [2020-11-09 12:06:09,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:06:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16198 transitions. [2020-11-09 12:06:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 12:06:09,161 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:09,162 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-11-09 12:06:09,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 12:06:09,162 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:09,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:09,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1420640526, now seen corresponding path program 1 times [2020-11-09 12:06:09,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:09,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155526242] [2020-11-09 12:06:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:09,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155526242] [2020-11-09 12:06:09,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:09,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 12:06:09,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288770892] [2020-11-09 12:06:09,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:06:09,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:09,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:06:09,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:06:09,365 INFO L87 Difference]: Start difference. First operand 4013 states and 16198 transitions. Second operand 8 states. [2020-11-09 12:06:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:09,802 INFO L93 Difference]: Finished difference Result 5053 states and 20226 transitions. [2020-11-09 12:06:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:06:09,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-11-09 12:06:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:09,824 INFO L225 Difference]: With dead ends: 5053 [2020-11-09 12:06:09,825 INFO L226 Difference]: Without dead ends: 5007 [2020-11-09 12:06:09,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:06:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5007 states. [2020-11-09 12:06:09,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5007 to 4013. [2020-11-09 12:06:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4013 states. [2020-11-09 12:06:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4013 states to 4013 states and 16198 transitions. [2020-11-09 12:06:10,000 INFO L78 Accepts]: Start accepts. Automaton has 4013 states and 16198 transitions. Word has length 20 [2020-11-09 12:06:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:10,001 INFO L481 AbstractCegarLoop]: Abstraction has 4013 states and 16198 transitions. [2020-11-09 12:06:10,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:06:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4013 states and 16198 transitions. [2020-11-09 12:06:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 12:06:10,004 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:10,004 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-11-09 12:06:10,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 12:06:10,004 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash 282076670, now seen corresponding path program 2 times [2020-11-09 12:06:10,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:10,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553975660] [2020-11-09 12:06:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:10,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553975660] [2020-11-09 12:06:10,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:10,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:06:10,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986916067] [2020-11-09 12:06:10,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:06:10,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:10,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:06:10,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:06:10,197 INFO L87 Difference]: Start difference. First operand 4013 states and 16198 transitions. Second operand 10 states. [2020-11-09 12:06:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:10,678 INFO L93 Difference]: Finished difference Result 5549 states and 22340 transitions. [2020-11-09 12:06:10,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:06:10,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-11-09 12:06:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:10,697 INFO L225 Difference]: With dead ends: 5549 [2020-11-09 12:06:10,698 INFO L226 Difference]: Without dead ends: 5503 [2020-11-09 12:06:10,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-11-09 12:06:10,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5503 states. [2020-11-09 12:06:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5503 to 4149. [2020-11-09 12:06:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4149 states. [2020-11-09 12:06:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 16837 transitions. [2020-11-09 12:06:10,842 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 16837 transitions. Word has length 20 [2020-11-09 12:06:10,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:10,844 INFO L481 AbstractCegarLoop]: Abstraction has 4149 states and 16837 transitions. [2020-11-09 12:06:10,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:06:10,844 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 16837 transitions. [2020-11-09 12:06:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 12:06:10,847 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:10,847 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-11-09 12:06:10,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 12:06:10,847 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:10,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:10,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1943164257, now seen corresponding path program 1 times [2020-11-09 12:06:10,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:10,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618157855] [2020-11-09 12:06:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:11,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618157855] [2020-11-09 12:06:11,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:11,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:06:11,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432922622] [2020-11-09 12:06:11,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:06:11,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:06:11,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:06:11,006 INFO L87 Difference]: Start difference. First operand 4149 states and 16837 transitions. Second operand 10 states. [2020-11-09 12:06:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:11,551 INFO L93 Difference]: Finished difference Result 6400 states and 26033 transitions. [2020-11-09 12:06:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:06:11,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-11-09 12:06:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:11,576 INFO L225 Difference]: With dead ends: 6400 [2020-11-09 12:06:11,576 INFO L226 Difference]: Without dead ends: 6354 [2020-11-09 12:06:11,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-11-09 12:06:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6354 states. [2020-11-09 12:06:11,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6354 to 3978. [2020-11-09 12:06:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2020-11-09 12:06:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 16074 transitions. [2020-11-09 12:06:11,749 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 16074 transitions. Word has length 20 [2020-11-09 12:06:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:11,749 INFO L481 AbstractCegarLoop]: Abstraction has 3978 states and 16074 transitions. [2020-11-09 12:06:11,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:06:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 16074 transitions. [2020-11-09 12:06:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 12:06:11,754 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06: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] [2020-11-09 12:06:11,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 12:06:11,754 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:11,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:11,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1568244378, now seen corresponding path program 3 times [2020-11-09 12:06:11,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:11,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885749966] [2020-11-09 12:06:11,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:11,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885749966] [2020-11-09 12:06:11,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:11,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:06:11,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52074019] [2020-11-09 12:06:11,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:06:11,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:11,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:06:11,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:06:11,874 INFO L87 Difference]: Start difference. First operand 3978 states and 16074 transitions. Second operand 7 states. [2020-11-09 12:06:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:12,175 INFO L93 Difference]: Finished difference Result 6325 states and 25457 transitions. [2020-11-09 12:06:12,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:06:12,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-11-09 12:06:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:12,196 INFO L225 Difference]: With dead ends: 6325 [2020-11-09 12:06:12,196 INFO L226 Difference]: Without dead ends: 6279 [2020-11-09 12:06:12,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:06:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2020-11-09 12:06:12,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 3948. [2020-11-09 12:06:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2020-11-09 12:06:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 16005 transitions. [2020-11-09 12:06:12,377 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 16005 transitions. Word has length 20 [2020-11-09 12:06:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:12,378 INFO L481 AbstractCegarLoop]: Abstraction has 3948 states and 16005 transitions. [2020-11-09 12:06:12,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:06:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 16005 transitions. [2020-11-09 12:06:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 12:06:12,382 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:12,382 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-11-09 12:06:12,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-09 12:06:12,382 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:12,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1192691367, now seen corresponding path program 1 times [2020-11-09 12:06:12,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:12,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128272768] [2020-11-09 12:06:12,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:12,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128272768] [2020-11-09 12:06:12,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:12,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:06:12,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889834918] [2020-11-09 12:06:12,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:06:12,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:12,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:06:12,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:06:12,453 INFO L87 Difference]: Start difference. First operand 3948 states and 16005 transitions. Second operand 5 states. [2020-11-09 12:06:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:12,642 INFO L93 Difference]: Finished difference Result 4734 states and 18681 transitions. [2020-11-09 12:06:12,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:06:12,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-09 12:06:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:12,664 INFO L225 Difference]: With dead ends: 4734 [2020-11-09 12:06:12,664 INFO L226 Difference]: Without dead ends: 4659 [2020-11-09 12:06:12,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:06:12,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2020-11-09 12:06:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 4277. [2020-11-09 12:06:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4277 states. [2020-11-09 12:06:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4277 states to 4277 states and 17201 transitions. [2020-11-09 12:06:12,780 INFO L78 Accepts]: Start accepts. Automaton has 4277 states and 17201 transitions. Word has length 21 [2020-11-09 12:06:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:12,780 INFO L481 AbstractCegarLoop]: Abstraction has 4277 states and 17201 transitions. [2020-11-09 12:06:12,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:06:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4277 states and 17201 transitions. [2020-11-09 12:06:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 12:06:12,784 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:12,785 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-11-09 12:06:12,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-09 12:06:12,785 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:12,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:12,785 INFO L82 PathProgramCache]: Analyzing trace with hash -796445437, now seen corresponding path program 2 times [2020-11-09 12:06:12,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:12,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570805322] [2020-11-09 12:06:12,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:12,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570805322] [2020-11-09 12:06:12,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:12,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:06:12,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972440831] [2020-11-09 12:06:12,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:06:12,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:06:12,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:06:12,847 INFO L87 Difference]: Start difference. First operand 4277 states and 17201 transitions. Second operand 6 states. [2020-11-09 12:06:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:13,088 INFO L93 Difference]: Finished difference Result 5056 states and 19868 transitions. [2020-11-09 12:06:13,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:06:13,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-09 12:06:13,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:13,106 INFO L225 Difference]: With dead ends: 5056 [2020-11-09 12:06:13,107 INFO L226 Difference]: Without dead ends: 4981 [2020-11-09 12:06:13,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:06:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4981 states. [2020-11-09 12:06:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4981 to 4270. [2020-11-09 12:06:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4270 states. [2020-11-09 12:06:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 17192 transitions. [2020-11-09 12:06:13,260 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 17192 transitions. Word has length 21 [2020-11-09 12:06:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:13,260 INFO L481 AbstractCegarLoop]: Abstraction has 4270 states and 17192 transitions. [2020-11-09 12:06:13,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:06:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 17192 transitions. [2020-11-09 12:06:13,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 12:06:13,265 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:13,266 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-11-09 12:06:13,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-09 12:06:13,266 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:13,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:13,266 INFO L82 PathProgramCache]: Analyzing trace with hash -112710267, now seen corresponding path program 3 times [2020-11-09 12:06:13,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:13,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981273489] [2020-11-09 12:06:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:13,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981273489] [2020-11-09 12:06:13,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:13,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:06:13,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493877071] [2020-11-09 12:06:13,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:06:13,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:13,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:06:13,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:06:13,354 INFO L87 Difference]: Start difference. First operand 4270 states and 17192 transitions. Second operand 6 states. [2020-11-09 12:06:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:13,512 INFO L93 Difference]: Finished difference Result 5197 states and 20300 transitions. [2020-11-09 12:06:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:06:13,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-09 12:06:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:13,530 INFO L225 Difference]: With dead ends: 5197 [2020-11-09 12:06:13,531 INFO L226 Difference]: Without dead ends: 4674 [2020-11-09 12:06:13,531 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-11-09 12:06:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2020-11-09 12:06:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 3901. [2020-11-09 12:06:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2020-11-09 12:06:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 15421 transitions. [2020-11-09 12:06:13,637 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 15421 transitions. Word has length 21 [2020-11-09 12:06:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:13,637 INFO L481 AbstractCegarLoop]: Abstraction has 3901 states and 15421 transitions. [2020-11-09 12:06:13,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:06:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 15421 transitions. [2020-11-09 12:06:13,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 12:06:13,640 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:13,640 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-11-09 12:06:13,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-09 12:06:13,640 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:13,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:13,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1192651111, now seen corresponding path program 1 times [2020-11-09 12:06:13,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:13,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663638927] [2020-11-09 12:06:13,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:13,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663638927] [2020-11-09 12:06:13,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:13,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:06:13,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517864269] [2020-11-09 12:06:13,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:06:13,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:13,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:06:13,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:06:13,805 INFO L87 Difference]: Start difference. First operand 3901 states and 15421 transitions. Second operand 7 states. [2020-11-09 12:06:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:14,005 INFO L93 Difference]: Finished difference Result 4542 states and 17587 transitions. [2020-11-09 12:06:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:06:14,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-09 12:06:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:14,026 INFO L225 Difference]: With dead ends: 4542 [2020-11-09 12:06:14,026 INFO L226 Difference]: Without dead ends: 4387 [2020-11-09 12:06:14,026 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-11-09 12:06:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4387 states. [2020-11-09 12:06:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4387 to 3891. [2020-11-09 12:06:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3891 states. [2020-11-09 12:06:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 15399 transitions. [2020-11-09 12:06:14,168 INFO L78 Accepts]: Start accepts. Automaton has 3891 states and 15399 transitions. Word has length 21 [2020-11-09 12:06:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:14,168 INFO L481 AbstractCegarLoop]: Abstraction has 3891 states and 15399 transitions. [2020-11-09 12:06:14,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:06:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3891 states and 15399 transitions. [2020-11-09 12:06:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 12:06:14,172 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:14,173 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-11-09 12:06:14,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-09 12:06:14,173 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:14,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1805729590, now seen corresponding path program 1 times [2020-11-09 12:06:14,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:14,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949874604] [2020-11-09 12:06:14,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:14,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949874604] [2020-11-09 12:06:14,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:14,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:06:14,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170945451] [2020-11-09 12:06:14,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 12:06:14,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:14,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 12:06:14,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:06:14,401 INFO L87 Difference]: Start difference. First operand 3891 states and 15399 transitions. Second operand 11 states. [2020-11-09 12:06:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:15,043 INFO L93 Difference]: Finished difference Result 4755 states and 18401 transitions. [2020-11-09 12:06:15,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:06:15,044 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-11-09 12:06:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:15,060 INFO L225 Difference]: With dead ends: 4755 [2020-11-09 12:06:15,060 INFO L226 Difference]: Without dead ends: 4706 [2020-11-09 12:06:15,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-11-09 12:06:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4706 states. [2020-11-09 12:06:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4706 to 3503. [2020-11-09 12:06:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2020-11-09 12:06:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 13480 transitions. [2020-11-09 12:06:15,149 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 13480 transitions. Word has length 21 [2020-11-09 12:06:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:15,149 INFO L481 AbstractCegarLoop]: Abstraction has 3503 states and 13480 transitions. [2020-11-09 12:06:15,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 12:06:15,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 13480 transitions. [2020-11-09 12:06:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 12:06:15,153 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:15,153 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-11-09 12:06:15,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-09 12:06:15,153 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:15,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:15,154 INFO L82 PathProgramCache]: Analyzing trace with hash -895791388, now seen corresponding path program 1 times [2020-11-09 12:06:15,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:15,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732139333] [2020-11-09 12:06:15,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:15,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732139333] [2020-11-09 12:06:15,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:15,309 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:06:15,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608146731] [2020-11-09 12:06:15,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:06:15,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:15,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:06:15,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:06:15,310 INFO L87 Difference]: Start difference. First operand 3503 states and 13480 transitions. Second operand 10 states. [2020-11-09 12:06:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:15,833 INFO L93 Difference]: Finished difference Result 4973 states and 19560 transitions. [2020-11-09 12:06:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:06:15,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-11-09 12:06:15,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:15,853 INFO L225 Difference]: With dead ends: 4973 [2020-11-09 12:06:15,853 INFO L226 Difference]: Without dead ends: 4899 [2020-11-09 12:06:15,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:06:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2020-11-09 12:06:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 3757. [2020-11-09 12:06:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3757 states. [2020-11-09 12:06:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 14845 transitions. [2020-11-09 12:06:15,975 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 14845 transitions. Word has length 21 [2020-11-09 12:06:15,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:15,975 INFO L481 AbstractCegarLoop]: Abstraction has 3757 states and 14845 transitions. [2020-11-09 12:06:15,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:06:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 14845 transitions. [2020-11-09 12:06:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 12:06:15,978 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:15,979 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-11-09 12:06:15,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-09 12:06:15,979 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:15,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:15,980 INFO L82 PathProgramCache]: Analyzing trace with hash -846041592, now seen corresponding path program 2 times [2020-11-09 12:06:15,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:15,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7613006] [2020-11-09 12:06:15,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:16,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7613006] [2020-11-09 12:06:16,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:16,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-09 12:06:16,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002327724] [2020-11-09 12:06:16,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:06:16,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:16,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:06:16,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:06:16,245 INFO L87 Difference]: Start difference. First operand 3757 states and 14845 transitions. Second operand 12 states. [2020-11-09 12:06:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:16,715 INFO L93 Difference]: Finished difference Result 4418 states and 17155 transitions. [2020-11-09 12:06:16,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:06:16,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-11-09 12:06:16,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:16,737 INFO L225 Difference]: With dead ends: 4418 [2020-11-09 12:06:16,737 INFO L226 Difference]: Without dead ends: 4262 [2020-11-09 12:06:16,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-11-09 12:06:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2020-11-09 12:06:16,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 3004. [2020-11-09 12:06:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2020-11-09 12:06:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 11303 transitions. [2020-11-09 12:06:16,873 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 11303 transitions. Word has length 21 [2020-11-09 12:06:16,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:16,873 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 11303 transitions. [2020-11-09 12:06:16,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:06:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 11303 transitions. [2020-11-09 12:06:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 12:06:16,876 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:16,876 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-11-09 12:06:16,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-09 12:06:16,876 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:16,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:16,877 INFO L82 PathProgramCache]: Analyzing trace with hash 73563545, now seen corresponding path program 2 times [2020-11-09 12:06:16,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:16,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389930357] [2020-11-09 12:06:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:16,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389930357] [2020-11-09 12:06:16,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:16,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 12:06:16,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195590093] [2020-11-09 12:06:16,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:06:16,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:16,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:06:16,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:06:16,998 INFO L87 Difference]: Start difference. First operand 3004 states and 11303 transitions. Second operand 8 states. [2020-11-09 12:06:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:17,191 INFO L93 Difference]: Finished difference Result 3058 states and 11357 transitions. [2020-11-09 12:06:17,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:06:17,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-11-09 12:06:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:17,205 INFO L225 Difference]: With dead ends: 3058 [2020-11-09 12:06:17,206 INFO L226 Difference]: Without dead ends: 3058 [2020-11-09 12:06:17,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:06:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-11-09 12:06:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2831. [2020-11-09 12:06:17,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2831 states. [2020-11-09 12:06:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 10625 transitions. [2020-11-09 12:06:17,324 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 10625 transitions. Word has length 21 [2020-11-09 12:06:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:17,324 INFO L481 AbstractCegarLoop]: Abstraction has 2831 states and 10625 transitions. [2020-11-09 12:06:17,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:06:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 10625 transitions. [2020-11-09 12:06:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:06:17,328 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:17,328 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-11-09 12:06:17,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-09 12:06:17,329 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:17,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:17,331 INFO L82 PathProgramCache]: Analyzing trace with hash 800776370, now seen corresponding path program 1 times [2020-11-09 12:06:17,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:17,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817036636] [2020-11-09 12:06:17,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:17,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817036636] [2020-11-09 12:06:17,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:17,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 12:06:17,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841391055] [2020-11-09 12:06:17,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:06:17,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:17,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:06:17,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:06:17,450 INFO L87 Difference]: Start difference. First operand 2831 states and 10625 transitions. Second operand 8 states. [2020-11-09 12:06:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:17,710 INFO L93 Difference]: Finished difference Result 3544 states and 13071 transitions. [2020-11-09 12:06:17,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:06:17,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-11-09 12:06:17,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:17,722 INFO L225 Difference]: With dead ends: 3544 [2020-11-09 12:06:17,722 INFO L226 Difference]: Without dead ends: 3484 [2020-11-09 12:06:17,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:06:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3484 states. [2020-11-09 12:06:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 2822. [2020-11-09 12:06:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-11-09 12:06:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-11-09 12:06:17,793 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-11-09 12:06:17,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:17,794 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-11-09 12:06:17,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:06:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-11-09 12:06:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:06:17,797 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:17,797 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-11-09 12:06:17,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-09 12:06:17,797 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:17,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:17,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1754318964, now seen corresponding path program 2 times [2020-11-09 12:06:17,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:17,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11505946] [2020-11-09 12:06:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:17,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11505946] [2020-11-09 12:06:17,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:17,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:06:17,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875031756] [2020-11-09 12:06:17,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 12:06:17,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:17,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 12:06:17,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:06:17,945 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 9 states. [2020-11-09 12:06:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:18,222 INFO L93 Difference]: Finished difference Result 3525 states and 13034 transitions. [2020-11-09 12:06:18,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:06:18,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-09 12:06:18,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:18,234 INFO L225 Difference]: With dead ends: 3525 [2020-11-09 12:06:18,234 INFO L226 Difference]: Without dead ends: 3465 [2020-11-09 12:06:18,234 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-11-09 12:06:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2020-11-09 12:06:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 2822. [2020-11-09 12:06:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-11-09 12:06:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10606 transitions. [2020-11-09 12:06:18,315 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10606 transitions. Word has length 22 [2020-11-09 12:06:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:18,315 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10606 transitions. [2020-11-09 12:06:18,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 12:06:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10606 transitions. [2020-11-09 12:06:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:06:18,318 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:18,318 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-11-09 12:06:18,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-09 12:06:18,318 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:18,318 INFO L82 PathProgramCache]: Analyzing trace with hash -901390894, now seen corresponding path program 3 times [2020-11-09 12:06:18,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:18,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027895496] [2020-11-09 12:06:18,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:18,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027895496] [2020-11-09 12:06:18,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:18,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:06:18,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609541961] [2020-11-09 12:06:18,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 12:06:18,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:18,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 12:06:18,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:06:18,507 INFO L87 Difference]: Start difference. First operand 2822 states and 10606 transitions. Second operand 11 states. [2020-11-09 12:06:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:18,981 INFO L93 Difference]: Finished difference Result 3740 states and 13820 transitions. [2020-11-09 12:06:18,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:06:18,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-11-09 12:06:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:18,994 INFO L225 Difference]: With dead ends: 3740 [2020-11-09 12:06:18,995 INFO L226 Difference]: Without dead ends: 3680 [2020-11-09 12:06:18,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-09 12:06:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2020-11-09 12:06:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 2822. [2020-11-09 12:06:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2020-11-09 12:06:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 10603 transitions. [2020-11-09 12:06:19,060 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 10603 transitions. Word has length 22 [2020-11-09 12:06:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:19,060 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 10603 transitions. [2020-11-09 12:06:19,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 12:06:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 10603 transitions. [2020-11-09 12:06:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:06:19,062 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:19,062 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-11-09 12:06:19,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-09 12:06:19,063 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:19,063 INFO L82 PathProgramCache]: Analyzing trace with hash -261805906, now seen corresponding path program 4 times [2020-11-09 12:06:19,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:19,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110243848] [2020-11-09 12:06:19,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:19,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110243848] [2020-11-09 12:06:19,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:19,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:06:19,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593253652] [2020-11-09 12:06:19,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 12:06:19,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:19,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 12:06:19,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:06:19,190 INFO L87 Difference]: Start difference. First operand 2822 states and 10603 transitions. Second operand 9 states. [2020-11-09 12:06:19,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:19,520 INFO L93 Difference]: Finished difference Result 4237 states and 15414 transitions. [2020-11-09 12:06:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:06:19,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-11-09 12:06:19,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:19,535 INFO L225 Difference]: With dead ends: 4237 [2020-11-09 12:06:19,536 INFO L226 Difference]: Without dead ends: 4177 [2020-11-09 12:06:19,536 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-11-09 12:06:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4177 states. [2020-11-09 12:06:19,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4177 to 2670. [2020-11-09 12:06:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-11-09 12:06:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 9904 transitions. [2020-11-09 12:06:19,604 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 9904 transitions. Word has length 22 [2020-11-09 12:06:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:19,604 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 9904 transitions. [2020-11-09 12:06:19,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 12:06:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 9904 transitions. [2020-11-09 12:06:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 12:06:19,606 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:19,606 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-11-09 12:06:19,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-09 12:06:19,607 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:19,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:19,607 INFO L82 PathProgramCache]: Analyzing trace with hash 618359143, now seen corresponding path program 1 times [2020-11-09 12:06:19,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:19,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033934741] [2020-11-09 12:06:19,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:19,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033934741] [2020-11-09 12:06:19,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:19,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-09 12:06:19,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488786635] [2020-11-09 12:06:19,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:06:19,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:19,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:06:19,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:06:19,831 INFO L87 Difference]: Start difference. First operand 2670 states and 9904 transitions. Second operand 12 states. [2020-11-09 12:06:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:20,241 INFO L93 Difference]: Finished difference Result 3103 states and 11113 transitions. [2020-11-09 12:06:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:06:20,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-11-09 12:06:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:20,251 INFO L225 Difference]: With dead ends: 3103 [2020-11-09 12:06:20,252 INFO L226 Difference]: Without dead ends: 3007 [2020-11-09 12:06:20,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-11-09 12:06:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2020-11-09 12:06:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2170. [2020-11-09 12:06:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2020-11-09 12:06:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2020-11-09 12:06:20,325 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 23 [2020-11-09 12:06:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:20,325 INFO L481 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2020-11-09 12:06:20,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:06:20,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2020-11-09 12:06:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 12:06:20,329 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:20,329 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-11-09 12:06:20,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-09 12:06:20,329 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:20,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1823757131, now seen corresponding path program 1 times [2020-11-09 12:06:20,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:20,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032718768] [2020-11-09 12:06:20,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:20,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032718768] [2020-11-09 12:06:20,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:20,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:06:20,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732105138] [2020-11-09 12:06:20,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:06:20,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:20,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:06:20,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:06:20,466 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 10 states. [2020-11-09 12:06:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:20,845 INFO L93 Difference]: Finished difference Result 3115 states and 11153 transitions. [2020-11-09 12:06:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:06:20,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-11-09 12:06:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:20,854 INFO L225 Difference]: With dead ends: 3115 [2020-11-09 12:06:20,855 INFO L226 Difference]: Without dead ends: 3058 [2020-11-09 12:06:20,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-11-09 12:06:20,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-11-09 12:06:20,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2130. [2020-11-09 12:06:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2020-11-09 12:06:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 7633 transitions. [2020-11-09 12:06:20,914 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 7633 transitions. Word has length 23 [2020-11-09 12:06:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:20,914 INFO L481 AbstractCegarLoop]: Abstraction has 2130 states and 7633 transitions. [2020-11-09 12:06:20,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:06:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 7633 transitions. [2020-11-09 12:06:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 12:06:20,916 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:20,916 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-11-09 12:06:20,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-09 12:06:20,916 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:20,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:20,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1618282095, now seen corresponding path program 2 times [2020-11-09 12:06:20,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:20,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243633179] [2020-11-09 12:06:20,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:21,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243633179] [2020-11-09 12:06:21,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:21,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-09 12:06:21,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869417769] [2020-11-09 12:06:21,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:06:21,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:21,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:06:21,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:06:21,118 INFO L87 Difference]: Start difference. First operand 2130 states and 7633 transitions. Second operand 12 states. [2020-11-09 12:06:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:21,526 INFO L93 Difference]: Finished difference Result 2799 states and 9853 transitions. [2020-11-09 12:06:21,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:06:21,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-11-09 12:06:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:21,534 INFO L225 Difference]: With dead ends: 2799 [2020-11-09 12:06:21,534 INFO L226 Difference]: Without dead ends: 2682 [2020-11-09 12:06:21,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2020-11-09 12:06:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2020-11-09 12:06:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 1794. [2020-11-09 12:06:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1794 states. [2020-11-09 12:06:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 6287 transitions. [2020-11-09 12:06:21,598 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 6287 transitions. Word has length 23 [2020-11-09 12:06:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:21,599 INFO L481 AbstractCegarLoop]: Abstraction has 1794 states and 6287 transitions. [2020-11-09 12:06:21,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:06:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 6287 transitions. [2020-11-09 12:06:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-09 12:06:21,600 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:21,601 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-11-09 12:06:21,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-09 12:06:21,601 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:21,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1881126218, now seen corresponding path program 1 times [2020-11-09 12:06:21,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:21,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600163071] [2020-11-09 12:06:21,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:21,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600163071] [2020-11-09 12:06:21,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:21,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:06:21,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487786893] [2020-11-09 12:06:21,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:06:21,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:21,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:06:21,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:06:21,644 INFO L87 Difference]: Start difference. First operand 1794 states and 6287 transitions. Second operand 5 states. [2020-11-09 12:06:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:21,775 INFO L93 Difference]: Finished difference Result 2298 states and 7732 transitions. [2020-11-09 12:06:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:06:21,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-11-09 12:06:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:21,782 INFO L225 Difference]: With dead ends: 2298 [2020-11-09 12:06:21,782 INFO L226 Difference]: Without dead ends: 2234 [2020-11-09 12:06:21,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:06:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2020-11-09 12:06:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2113. [2020-11-09 12:06:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2020-11-09 12:06:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 7288 transitions. [2020-11-09 12:06:21,821 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 7288 transitions. Word has length 24 [2020-11-09 12:06:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:21,821 INFO L481 AbstractCegarLoop]: Abstraction has 2113 states and 7288 transitions. [2020-11-09 12:06:21,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:06:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 7288 transitions. [2020-11-09 12:06:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-09 12:06:21,824 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:21,824 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-11-09 12:06:21,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-09 12:06:21,824 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:21,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1170381166, now seen corresponding path program 2 times [2020-11-09 12:06:21,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:21,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667810817] [2020-11-09 12:06:21,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:21,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-11-09 12:06:21,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667810817] [2020-11-09 12:06:21,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:21,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:06:21,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864022924] [2020-11-09 12:06:21,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:06:21,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:21,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:06:21,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:06:21,879 INFO L87 Difference]: Start difference. First operand 2113 states and 7288 transitions. Second operand 6 states. [2020-11-09 12:06:22,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:22,072 INFO L93 Difference]: Finished difference Result 2610 states and 8724 transitions. [2020-11-09 12:06:22,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:06:22,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-11-09 12:06:22,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:22,079 INFO L225 Difference]: With dead ends: 2610 [2020-11-09 12:06:22,079 INFO L226 Difference]: Without dead ends: 2546 [2020-11-09 12:06:22,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:06:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2020-11-09 12:06:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2106. [2020-11-09 12:06:22,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-11-09 12:06:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7279 transitions. [2020-11-09 12:06:22,118 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7279 transitions. Word has length 24 [2020-11-09 12:06:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:22,118 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7279 transitions. [2020-11-09 12:06:22,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:06:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7279 transitions. [2020-11-09 12:06:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-09 12:06:22,120 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:22,120 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-11-09 12:06:22,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-09 12:06:22,120 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:22,121 INFO L82 PathProgramCache]: Analyzing trace with hash -705054292, now seen corresponding path program 3 times [2020-11-09 12:06:22,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:22,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675395891] [2020-11-09 12:06:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:22,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675395891] [2020-11-09 12:06:22,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:22,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 12:06:22,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687060881] [2020-11-09 12:06:22,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:06:22,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:22,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:06:22,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:06:22,219 INFO L87 Difference]: Start difference. First operand 2106 states and 7279 transitions. Second operand 8 states. [2020-11-09 12:06:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:22,472 INFO L93 Difference]: Finished difference Result 2590 states and 8691 transitions. [2020-11-09 12:06:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:06:22,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-11-09 12:06:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:22,479 INFO L225 Difference]: With dead ends: 2590 [2020-11-09 12:06:22,479 INFO L226 Difference]: Without dead ends: 2526 [2020-11-09 12:06:22,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:06:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2020-11-09 12:06:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2093. [2020-11-09 12:06:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2020-11-09 12:06:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 7255 transitions. [2020-11-09 12:06:22,516 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 7255 transitions. Word has length 24 [2020-11-09 12:06:22,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:22,517 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 7255 transitions. [2020-11-09 12:06:22,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:06:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 7255 transitions. [2020-11-09 12:06:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-09 12:06:22,519 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:22,519 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-11-09 12:06:22,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-09 12:06:22,519 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:22,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1595569430, now seen corresponding path program 1 times [2020-11-09 12:06:22,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:22,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393344459] [2020-11-09 12:06:22,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:22,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393344459] [2020-11-09 12:06:22,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:22,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:06:22,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945937204] [2020-11-09 12:06:22,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:06:22,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:22,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:06:22,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:06:22,667 INFO L87 Difference]: Start difference. First operand 2093 states and 7255 transitions. Second operand 10 states. [2020-11-09 12:06:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:22,971 INFO L93 Difference]: Finished difference Result 2558 states and 8708 transitions. [2020-11-09 12:06:22,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:06:22,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-11-09 12:06:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:22,979 INFO L225 Difference]: With dead ends: 2558 [2020-11-09 12:06:22,979 INFO L226 Difference]: Without dead ends: 2534 [2020-11-09 12:06:22,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-11-09 12:06:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2020-11-09 12:06:23,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 2093. [2020-11-09 12:06:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2020-11-09 12:06:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 7255 transitions. [2020-11-09 12:06:23,039 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 7255 transitions. Word has length 24 [2020-11-09 12:06:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:23,039 INFO L481 AbstractCegarLoop]: Abstraction has 2093 states and 7255 transitions. [2020-11-09 12:06:23,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:06:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 7255 transitions. [2020-11-09 12:06:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-09 12:06:23,042 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:23,042 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-11-09 12:06:23,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-09 12:06:23,043 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:23,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1636815590, now seen corresponding path program 2 times [2020-11-09 12:06:23,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:23,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541204179] [2020-11-09 12:06:23,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:23,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541204179] [2020-11-09 12:06:23,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:23,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:06:23,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753612574] [2020-11-09 12:06:23,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 12:06:23,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:23,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 12:06:23,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:06:23,215 INFO L87 Difference]: Start difference. First operand 2093 states and 7255 transitions. Second operand 11 states. [2020-11-09 12:06:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:23,643 INFO L93 Difference]: Finished difference Result 3188 states and 11079 transitions. [2020-11-09 12:06:23,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 12:06:23,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-11-09 12:06:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:23,653 INFO L225 Difference]: With dead ends: 3188 [2020-11-09 12:06:23,653 INFO L226 Difference]: Without dead ends: 3164 [2020-11-09 12:06:23,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2020-11-09 12:06:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2020-11-09 12:06:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 1733. [2020-11-09 12:06:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2020-11-09 12:06:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2020-11-09 12:06:23,692 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2020-11-09 12:06:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:23,693 INFO L481 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2020-11-09 12:06:23,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 12:06:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2020-11-09 12:06:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-09 12:06:23,695 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:23,695 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-11-09 12:06:23,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-09 12:06:23,695 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:23,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:23,695 INFO L82 PathProgramCache]: Analyzing trace with hash -645522248, now seen corresponding path program 4 times [2020-11-09 12:06:23,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:23,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268712468] [2020-11-09 12:06:23,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:23,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268712468] [2020-11-09 12:06:23,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:23,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:06:23,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933723130] [2020-11-09 12:06:23,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:06:23,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:23,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:06:23,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:06:23,842 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 10 states. [2020-11-09 12:06:24,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:24,183 INFO L93 Difference]: Finished difference Result 2175 states and 7230 transitions. [2020-11-09 12:06:24,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:06:24,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-11-09 12:06:24,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:24,189 INFO L225 Difference]: With dead ends: 2175 [2020-11-09 12:06:24,189 INFO L226 Difference]: Without dead ends: 2111 [2020-11-09 12:06:24,190 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-11-09 12:06:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2020-11-09 12:06:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1733. [2020-11-09 12:06:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2020-11-09 12:06:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 5933 transitions. [2020-11-09 12:06:24,216 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 5933 transitions. Word has length 24 [2020-11-09 12:06:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:24,216 INFO L481 AbstractCegarLoop]: Abstraction has 1733 states and 5933 transitions. [2020-11-09 12:06:24,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:06:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 5933 transitions. [2020-11-09 12:06:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-09 12:06:24,218 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:24,218 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-11-09 12:06:24,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-09 12:06:24,218 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:24,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:24,219 INFO L82 PathProgramCache]: Analyzing trace with hash -651468708, now seen corresponding path program 5 times [2020-11-09 12:06:24,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:24,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23024638] [2020-11-09 12:06:24,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:24,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23024638] [2020-11-09 12:06:24,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:24,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-09 12:06:24,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494741207] [2020-11-09 12:06:24,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:06:24,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:24,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:06:24,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:06:24,435 INFO L87 Difference]: Start difference. First operand 1733 states and 5933 transitions. Second operand 12 states. [2020-11-09 12:06:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:24,833 INFO L93 Difference]: Finished difference Result 2400 states and 7955 transitions. [2020-11-09 12:06:24,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:06:24,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-11-09 12:06:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:24,840 INFO L225 Difference]: With dead ends: 2400 [2020-11-09 12:06:24,840 INFO L226 Difference]: Without dead ends: 2272 [2020-11-09 12:06:24,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2020-11-09 12:06:24,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2020-11-09 12:06:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1669. [2020-11-09 12:06:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2020-11-09 12:06:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 5719 transitions. [2020-11-09 12:06:24,884 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 5719 transitions. Word has length 24 [2020-11-09 12:06:24,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:24,884 INFO L481 AbstractCegarLoop]: Abstraction has 1669 states and 5719 transitions. [2020-11-09 12:06:24,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:06:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 5719 transitions. [2020-11-09 12:06:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-09 12:06:24,888 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:24,888 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-11-09 12:06:24,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-09 12:06:24,888 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:24,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:24,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1516154866, now seen corresponding path program 6 times [2020-11-09 12:06:24,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:24,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242759247] [2020-11-09 12:06:24,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:25,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242759247] [2020-11-09 12:06:25,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:25,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:06:25,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371797480] [2020-11-09 12:06:25,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:06:25,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:25,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:06:25,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:06:25,050 INFO L87 Difference]: Start difference. First operand 1669 states and 5719 transitions. Second operand 10 states. [2020-11-09 12:06:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:25,366 INFO L93 Difference]: Finished difference Result 2576 states and 8317 transitions. [2020-11-09 12:06:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:06:25,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-11-09 12:06:25,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:25,372 INFO L225 Difference]: With dead ends: 2576 [2020-11-09 12:06:25,372 INFO L226 Difference]: Without dead ends: 2512 [2020-11-09 12:06:25,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-11-09 12:06:25,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2020-11-09 12:06:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 1489. [2020-11-09 12:06:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1489 states. [2020-11-09 12:06:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 5033 transitions. [2020-11-09 12:06:25,404 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 5033 transitions. Word has length 24 [2020-11-09 12:06:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:25,404 INFO L481 AbstractCegarLoop]: Abstraction has 1489 states and 5033 transitions. [2020-11-09 12:06:25,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:06:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 5033 transitions. [2020-11-09 12:06:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-09 12:06:25,407 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:25,407 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-11-09 12:06:25,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-09 12:06:25,408 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:25,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:25,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1490897436, now seen corresponding path program 1 times [2020-11-09 12:06:25,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:25,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15852407] [2020-11-09 12:06:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:25,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15852407] [2020-11-09 12:06:25,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:25,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 12:06:25,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128967283] [2020-11-09 12:06:25,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:06:25,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:25,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:06:25,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:06:25,556 INFO L87 Difference]: Start difference. First operand 1489 states and 5033 transitions. Second operand 10 states. [2020-11-09 12:06:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:25,928 INFO L93 Difference]: Finished difference Result 2094 states and 6830 transitions. [2020-11-09 12:06:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:06:25,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-11-09 12:06:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:25,935 INFO L225 Difference]: With dead ends: 2094 [2020-11-09 12:06:25,935 INFO L226 Difference]: Without dead ends: 2072 [2020-11-09 12:06:25,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-11-09 12:06:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2020-11-09 12:06:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1485. [2020-11-09 12:06:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2020-11-09 12:06:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 5028 transitions. [2020-11-09 12:06:25,979 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 5028 transitions. Word has length 26 [2020-11-09 12:06:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:25,980 INFO L481 AbstractCegarLoop]: Abstraction has 1485 states and 5028 transitions. [2020-11-09 12:06:25,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:06:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 5028 transitions. [2020-11-09 12:06:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-09 12:06:25,982 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:25,983 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-11-09 12:06:25,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-09 12:06:25,983 INFO L429 AbstractCegarLoop]: === Iteration 45 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:25,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1992969286, now seen corresponding path program 2 times [2020-11-09 12:06:25,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:25,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27152565] [2020-11-09 12:06:25,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:26,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27152565] [2020-11-09 12:06:26,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:26,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-09 12:06:26,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132993176] [2020-11-09 12:06:26,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 12:06:26,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:26,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 12:06:26,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:06:26,204 INFO L87 Difference]: Start difference. First operand 1485 states and 5028 transitions. Second operand 12 states. [2020-11-09 12:06:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:26,704 INFO L93 Difference]: Finished difference Result 1538 states and 4992 transitions. [2020-11-09 12:06:26,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-09 12:06:26,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-11-09 12:06:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:26,708 INFO L225 Difference]: With dead ends: 1538 [2020-11-09 12:06:26,708 INFO L226 Difference]: Without dead ends: 1494 [2020-11-09 12:06:26,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2020-11-09 12:06:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2020-11-09 12:06:26,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 885. [2020-11-09 12:06:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-11-09 12:06:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-11-09 12:06:26,729 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-11-09 12:06:26,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:26,729 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-11-09 12:06:26,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 12:06:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-11-09 12:06:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-09 12:06:26,731 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:26,731 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-11-09 12:06:26,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-09 12:06:26,731 INFO L429 AbstractCegarLoop]: === Iteration 46 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:26,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:26,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1378312331, now seen corresponding path program 1 times [2020-11-09 12:06:26,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:26,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596828465] [2020-11-09 12:06:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:26,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596828465] [2020-11-09 12:06:26,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:26,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:06:26,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428200741] [2020-11-09 12:06:26,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:06:26,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:26,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:06:26,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:06:26,822 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-11-09 12:06:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:27,014 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2020-11-09 12:06:27,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:06:27,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-11-09 12:06:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:27,018 INFO L225 Difference]: With dead ends: 885 [2020-11-09 12:06:27,018 INFO L226 Difference]: Without dead ends: 867 [2020-11-09 12:06:27,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:06:27,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2020-11-09 12:06:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2020-11-09 12:06:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2020-11-09 12:06:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 2960 transitions. [2020-11-09 12:06:27,034 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 2960 transitions. Word has length 41 [2020-11-09 12:06:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:27,035 INFO L481 AbstractCegarLoop]: Abstraction has 867 states and 2960 transitions. [2020-11-09 12:06:27,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:06:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 2960 transitions. [2020-11-09 12:06:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-09 12:06:27,037 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:27,037 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:06:27,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-09 12:06:27,037 INFO L429 AbstractCegarLoop]: === Iteration 47 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:27,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:27,037 INFO L82 PathProgramCache]: Analyzing trace with hash 797706649, now seen corresponding path program 1 times [2020-11-09 12:06:27,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:27,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439772607] [2020-11-09 12:06:27,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:27,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439772607] [2020-11-09 12:06:27,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:27,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 12:06:27,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892950504] [2020-11-09 12:06:27,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:06:27,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:27,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:06:27,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:06:27,143 INFO L87 Difference]: Start difference. First operand 867 states and 2960 transitions. Second operand 8 states. [2020-11-09 12:06:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:27,323 INFO L93 Difference]: Finished difference Result 867 states and 2956 transitions. [2020-11-09 12:06:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:06:27,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-11-09 12:06:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:27,327 INFO L225 Difference]: With dead ends: 867 [2020-11-09 12:06:27,327 INFO L226 Difference]: Without dead ends: 819 [2020-11-09 12:06:27,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:06:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2020-11-09 12:06:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2020-11-09 12:06:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-11-09 12:06:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2020-11-09 12:06:27,344 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2020-11-09 12:06:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:27,345 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2020-11-09 12:06:27,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:06:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2020-11-09 12:06:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-09 12:06:27,346 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:27,347 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-11-09 12:06:27,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-09 12:06:27,347 INFO L429 AbstractCegarLoop]: === Iteration 48 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash -179469333, now seen corresponding path program 1 times [2020-11-09 12:06:27,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:27,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497062947] [2020-11-09 12:06:27,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:06:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:06:27,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497062947] [2020-11-09 12:06:27,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:06:27,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 12:06:27,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302672884] [2020-11-09 12:06:27,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 12:06:27,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:06:27,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 12:06:27,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:06:27,549 INFO L87 Difference]: Start difference. First operand 819 states and 2784 transitions. Second operand 10 states. [2020-11-09 12:06:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:06:27,762 INFO L93 Difference]: Finished difference Result 819 states and 2776 transitions. [2020-11-09 12:06:27,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:06:27,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2020-11-09 12:06:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:06:27,765 INFO L225 Difference]: With dead ends: 819 [2020-11-09 12:06:27,765 INFO L226 Difference]: Without dead ends: 735 [2020-11-09 12:06:27,765 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-11-09 12:06:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2020-11-09 12:06:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2020-11-09 12:06:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2020-11-09 12:06:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 2470 transitions. [2020-11-09 12:06:27,783 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 2470 transitions. Word has length 41 [2020-11-09 12:06:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:06:27,783 INFO L481 AbstractCegarLoop]: Abstraction has 735 states and 2470 transitions. [2020-11-09 12:06:27,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 12:06:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 2470 transitions. [2020-11-09 12:06:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-09 12:06:27,785 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:06:27,786 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-11-09 12:06:27,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-11-09 12:06:27,786 INFO L429 AbstractCegarLoop]: === Iteration 49 === [thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err6INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION]=== [2020-11-09 12:06:27,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:06:27,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1631305437, now seen corresponding path program 1 times [2020-11-09 12:06:27,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:06:27,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971674390] [2020-11-09 12:06:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:06:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:06:27,827 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:06:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:06:27,872 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:06:27,935 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 12:06:27,935 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 12:06:27,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-11-09 12:06:28,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:06:28 BasicIcfg [2020-11-09 12:06:28,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 12:06:28,103 INFO L168 Benchmark]: Toolchain (without parser) took 39171.53 ms. Allocated memory was 151.0 MB in the beginning and 883.9 MB in the end (delta: 733.0 MB). Free memory was 124.7 MB in the beginning and 769.4 MB in the end (delta: -644.7 MB). Peak memory consumption was 89.3 MB. Max. memory is 8.0 GB. [2020-11-09 12:06:28,103 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 12:06:28,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1074.75 ms. Allocated memory is still 151.0 MB. Free memory was 124.0 MB in the beginning and 82.7 MB in the end (delta: 41.3 MB). Peak memory consumption was 42.0 MB. Max. memory is 8.0 GB. [2020-11-09 12:06:28,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.84 ms. Allocated memory is still 151.0 MB. Free memory was 82.7 MB in the beginning and 80.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:06:28,104 INFO L168 Benchmark]: Boogie Preprocessor took 35.98 ms. Allocated memory is still 151.0 MB. Free memory was 80.1 MB in the beginning and 78.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:06:28,104 INFO L168 Benchmark]: RCFGBuilder took 545.77 ms. Allocated memory is still 151.0 MB. Free memory was 78.5 MB in the beginning and 51.8 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. [2020-11-09 12:06:28,105 INFO L168 Benchmark]: TraceAbstraction took 37415.69 ms. Allocated memory was 151.0 MB in the beginning and 883.9 MB in the end (delta: 733.0 MB). Free memory was 51.8 MB in the beginning and 769.4 MB in the end (delta: -717.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 8.0 GB. [2020-11-09 12:06:28,108 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 122.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1074.75 ms. Allocated memory is still 151.0 MB. Free memory was 124.0 MB in the beginning and 82.7 MB in the end (delta: 41.3 MB). Peak memory consumption was 42.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 79.84 ms. Allocated memory is still 151.0 MB. Free memory was 82.7 MB in the beginning and 80.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.98 ms. Allocated memory is still 151.0 MB. Free memory was 80.1 MB in the beginning and 78.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 545.77 ms. Allocated memory is still 151.0 MB. Free memory was 78.5 MB in the beginning and 51.8 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 37415.69 ms. Allocated memory was 151.0 MB in the beginning and 883.9 MB in the end (delta: 733.0 MB). Free memory was 51.8 MB in the beginning and 769.4 MB in the end (delta: -717.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 3872 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 1174 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.7s, 180 PlacesBefore, 101 PlacesAfterwards, 252 TransitionsBefore, 173 TransitionsAfterwards, 4628 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 52821 MoverChecksTotal - CounterExampleResult [Line: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1116] 0 char *v; [L1153] 0 pthread_t t; [L1154] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1155] 0 \read(t) VAL [arg={0:0}, v={0:0}] [L1138] 1 pthread_t t1, t2, t3, t4, t5; [L1139] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={0:0}] [L1140] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={0:0}] [L1119] 2 v = malloc(sizeof(char)) [L1120] 2 return 0; [L1140] 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))={1:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={1:0}] [L1141] 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))={1:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={1:0}] [L1142] 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))={1:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={1:0}] [L1125] 3 v[0] = 'X' [L1127] 3 return 0; [L1143] FCALL, FORK 1 pthread_create(&t4, 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}, malloc(sizeof(char))={1:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={1:0}] [L1144] 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}, malloc(sizeof(char))={1:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={1:0}] [L1145] 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}, malloc(sizeof(char))={1:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={1:0}] [L1145] 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}, malloc(sizeof(char))={1:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={1:0}] [L1146] 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}, malloc(sizeof(char))={1:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={1:0}] [L1125] 6 v[0] = 'X' [L1127] 6 return 0; [L1125] 5 v[0] = 'X' [L1127] 5 return 0; [L1132] 4 v[0] = 'Y' [L1134] 4 return 0; [L1146] 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))={1:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={1:0}] [L1147] 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))={1:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={1:0}] [L1147] 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))={1:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={1:0}] [L1148] 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))={1:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={1:0}] [L1148] 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))={1:0}, t1={13:0}, t2={10:0}, t3={6:0}, t4={11:0}, t5={14:0}, v={1:0}] [L1149] 1 return 0; [L1149] 1 return 0; [L1149] 1 return 0; [L1149] 1 return 0; [L1149] 1 return 0; [L1149] 1 return 0; [L1155] 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))={1:0}, v={1:0}] [L1156] 0 v[0] [L1115] COND TRUE 0 !expression [L12] COND FALSE 0 !(0) [L12] 0 __assert_fail ("0", "singleton.c", 3, __extension__ __PRETTY_FUNCTION__) 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))={1:0}, v={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 36.8s, OverallIterations: 49, TraceHistogramMax: 1, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 5020 SDtfs, 9342 SDslu, 12893 SDs, 0 SdLazy, 7709 SolverSat, 1105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 536 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4277occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 48 MinimizatonAttempts, 43479 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1072 NumberOfCodeBlocks, 1072 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 983 ConstructedInterpolants, 0 QuantifiedInterpolants, 217984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 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...