/usr/bin/java -Xmx16000000000 -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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-11 15:03:30,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-11 15:03:30,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-11 15:03:30,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-11 15:03:30,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-11 15:03:30,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-11 15:03:30,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-11 15:03:30,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-11 15:03:30,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-11 15:03:30,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-11 15:03:30,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-11 15:03:30,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-11 15:03:30,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-11 15:03:30,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-11 15:03:30,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-11 15:03:30,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-11 15:03:30,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-11 15:03:30,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-11 15:03:30,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-11 15:03:30,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-11 15:03:30,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-11 15:03:30,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-11 15:03:30,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-11 15:03:30,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-11 15:03:30,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-11 15:03:30,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-11 15:03:30,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-11 15:03:30,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-11 15:03:30,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-11 15:03:30,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-11 15:03:30,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-11 15:03:30,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-11 15:03:30,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-11 15:03:30,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-11 15:03:30,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-11 15:03:30,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-11 15:03:30,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-11 15:03:30,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-11 15:03:30,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-11 15:03:30,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-11 15:03:30,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-11 15:03:30,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2020-11-11 15:03:30,460 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-11 15:03:30,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-11 15:03:30,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-11 15:03:30,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-11 15:03:30,468 INFO L138 SettingsManager]: * Use SBE=true [2020-11-11 15:03:30,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-11 15:03:30,469 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-11 15:03:30,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-11 15:03:30,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-11 15:03:30,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-11 15:03:30,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-11 15:03:30,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-11 15:03:30,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-11 15:03:30,472 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-11 15:03:30,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-11 15:03:30,472 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-11 15:03:30,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-11 15:03:30,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-11 15:03:30,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-11 15:03:30,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-11 15:03:30,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-11 15:03:30,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-11 15:03:30,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-11 15:03:30,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-11 15:03:30,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-11 15:03:30,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-11 15:03:30,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-11 15:03:30,476 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-11-11 15:03:30,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-11 15:03:30,477 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-11 15:03:30,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-11 15:03:31,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-11 15:03:31,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-11 15:03:31,024 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-11 15:03:31,026 INFO L275 PluginConnector]: CDTParser initialized [2020-11-11 15:03:31,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-11-11 15:03:31,151 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b267bfd3/fe0080db350c4bfe963abb8bf4a5da5d/FLAG65af3140a [2020-11-11 15:03:32,103 INFO L306 CDTParser]: Found 1 translation units. [2020-11-11 15:03:32,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2020-11-11 15:03:32,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b267bfd3/fe0080db350c4bfe963abb8bf4a5da5d/FLAG65af3140a [2020-11-11 15:03:32,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b267bfd3/fe0080db350c4bfe963abb8bf4a5da5d [2020-11-11 15:03:32,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-11 15:03:32,267 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-11 15:03:32,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-11 15:03:32,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-11 15:03:32,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-11 15:03:32,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:03:32" (1/1) ... [2020-11-11 15:03:32,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d46cbcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:03:32, skipping insertion in model container [2020-11-11 15:03:32,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:03:32" (1/1) ... [2020-11-11 15:03:32,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-11 15:03:32,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-11 15:03:32,709 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-11 15:03:33,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 15:03:33,184 INFO L203 MainTranslator]: Completed pre-run [2020-11-11 15:03:33,218 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-11 15:03:33,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 15:03:33,551 INFO L208 MainTranslator]: Completed translation [2020-11-11 15:03:33,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:03:33 WrapperNode [2020-11-11 15:03:33,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-11 15:03:33,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-11 15:03:33,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-11 15:03:33,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-11 15:03:33,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:03:33" (1/1) ... [2020-11-11 15:03:33,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:03:33" (1/1) ... [2020-11-11 15:03:33,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-11 15:03:33,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-11 15:03:33,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-11 15:03:33,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-11 15:03:33,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:03:33" (1/1) ... [2020-11-11 15:03:33,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:03:33" (1/1) ... [2020-11-11 15:03:33,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:03:33" (1/1) ... [2020-11-11 15:03:33,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:03:33" (1/1) ... [2020-11-11 15:03:33,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:03:33" (1/1) ... [2020-11-11 15:03:33,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:03:33" (1/1) ... [2020-11-11 15:03:33,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:03:33" (1/1) ... [2020-11-11 15:03:33,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-11 15:03:33,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-11 15:03:33,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-11 15:03:33,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-11 15:03:33,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:03:33" (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-11 15:03:33,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-11 15:03:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-11 15:03:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-11 15:03:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-11 15:03:33,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-11 15:03:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-11-11 15:03:33,820 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-11-11 15:03:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-11-11 15:03:33,820 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-11-11 15:03:33,820 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-11-11 15:03:33,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-11-11 15:03:33,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-11-11 15:03:33,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-11-11 15:03:33,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-11 15:03:33,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-11 15:03:33,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-11 15:03:33,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-11 15:03:33,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-11 15:03:33,825 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-11 15:03:34,435 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-11 15:03:34,436 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-11 15:03:34,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:03:34 BoogieIcfgContainer [2020-11-11 15:03:34,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-11 15:03:34,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-11 15:03:34,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-11 15:03:34,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-11 15:03:34,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 03:03:32" (1/3) ... [2020-11-11 15:03:34,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d22c802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:03:34, skipping insertion in model container [2020-11-11 15:03:34,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:03:33" (2/3) ... [2020-11-11 15:03:34,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d22c802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:03:34, skipping insertion in model container [2020-11-11 15:03:34,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:03:34" (3/3) ... [2020-11-11 15:03:34,453 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-11-11 15:03:34,475 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-11 15:03:34,476 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-11 15:03:34,480 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-11 15:03:34,482 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-11 15:03:34,548 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,549 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,549 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,549 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,550 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,550 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,551 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,551 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,551 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,552 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,552 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,552 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,553 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,553 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,553 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,554 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,554 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,555 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,555 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,555 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,556 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,556 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,556 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,556 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,557 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,557 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,558 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,558 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,558 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,558 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,559 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,559 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,560 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,560 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,561 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,561 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,561 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,561 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,562 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,562 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,563 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,564 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,564 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,564 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,564 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,564 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,565 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,565 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,565 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,566 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,566 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,566 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,567 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,567 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,567 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,567 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,568 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,568 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,569 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,569 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,569 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,570 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,570 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,570 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,571 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,571 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,571 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,571 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,571 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,572 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,572 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,572 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,573 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,573 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,573 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,574 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,574 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,574 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,574 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,575 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,575 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,575 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,575 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,576 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,576 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,576 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,576 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,577 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,577 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,577 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,578 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,578 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,578 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,578 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,579 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,579 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,579 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,579 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,580 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,580 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,580 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,580 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,581 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,581 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,581 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,581 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,582 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,582 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,582 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,582 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,583 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,583 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,583 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,583 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,584 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,584 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,584 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,584 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,585 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,585 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,585 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,585 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,586 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,586 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,586 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,586 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,586 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,587 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,587 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,587 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,587 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,588 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,588 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,588 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,589 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,589 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,589 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,590 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,590 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,590 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,590 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,591 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,591 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,591 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,591 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,592 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,592 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,592 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,592 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,593 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,593 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,593 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,593 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,594 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,594 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,594 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,595 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,595 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,595 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,595 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,596 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,596 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,596 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,596 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,597 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,597 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,597 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,597 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,598 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,598 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,598 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,598 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,599 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,599 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,599 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,599 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,600 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,600 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,600 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,600 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,601 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,601 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,601 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,601 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,602 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,602 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,602 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,603 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,603 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,603 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,604 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,604 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,604 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,604 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,604 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,605 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,605 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,605 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,606 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,606 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,609 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,610 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,610 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,611 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,619 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,620 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,620 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,621 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,624 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,625 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,625 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,625 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,630 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,630 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,631 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,631 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,631 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,632 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,636 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,637 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,637 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,637 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,637 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,638 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,638 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,638 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,638 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,639 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,639 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,639 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,640 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,640 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,640 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,640 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,640 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,641 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,641 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,641 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,642 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,642 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,642 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,642 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,647 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,648 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,648 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,648 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,653 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,653 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,654 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,654 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,654 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,655 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,658 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,658 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,659 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,659 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,663 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,663 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,664 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,664 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,668 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,669 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,669 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,669 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,673 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,673 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,673 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,673 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 15:03:34,948 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2020-11-11 15:03:34,966 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-11-11 15:03:35,000 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-11 15:03:35,001 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-11 15:03:35,001 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-11 15:03:35,001 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-11 15:03:35,001 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-11 15:03:35,002 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-11 15:03:35,002 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-11 15:03:35,002 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-11 15:03:35,025 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 180 places, 252 transitions, 884 flow [2020-11-11 15:03:43,714 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 56417 states, 56411 states have (on average 4.312492244420414) internal successors, (243272), 56416 states have internal predecessors, (243272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:03:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 56417 states, 56411 states have (on average 4.312492244420414) internal successors, (243272), 56416 states have internal predecessors, (243272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:03:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-11 15:03:43,871 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:03:43,872 INFO L494 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] [2020-11-11 15:03:43,873 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-11 15:03:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:03:43,886 INFO L82 PathProgramCache]: Analyzing trace with hash 23006340, now seen corresponding path program 1 times [2020-11-11 15:03:43,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:03:43,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115879697] [2020-11-11 15:03:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:03:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:03:44,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-11 15:03:44,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115879697] [2020-11-11 15:03:44,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:03:44,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 15:03:44,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465648145] [2020-11-11 15:03:44,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 15:03:44,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:03:44,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 15:03:44,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-11 15:03:44,574 INFO L87 Difference]: Start difference. First operand has 56417 states, 56411 states have (on average 4.312492244420414) internal successors, (243272), 56416 states have internal predecessors, (243272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:03:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:03:46,788 INFO L93 Difference]: Finished difference Result 58525 states and 251290 transitions. [2020-11-11 15:03:46,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 15:03:46,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2020-11-11 15:03:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:03:47,460 INFO L225 Difference]: With dead ends: 58525 [2020-11-11 15:03:47,461 INFO L226 Difference]: Without dead ends: 42600 [2020-11-11 15:03:47,464 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11 15:03:48,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42600 states. [2020-11-11 15:03:50,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42600 to 35961. [2020-11-11 15:03:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35961 states, 35958 states have (on average 4.297764058067746) internal successors, (154539), 35960 states have internal predecessors, (154539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:03:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35961 states to 35961 states and 154539 transitions. [2020-11-11 15:03:50,733 INFO L78 Accepts]: Start accepts. Automaton has 35961 states and 154539 transitions. Word has length 38 [2020-11-11 15:03:50,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:03:50,734 INFO L481 AbstractCegarLoop]: Abstraction has 35961 states and 154539 transitions. [2020-11-11 15:03:50,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:03:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 35961 states and 154539 transitions. [2020-11-11 15:03:50,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-11 15:03:50,746 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:03:50,746 INFO L494 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] [2020-11-11 15:03:50,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-11 15:03:50,747 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-11 15:03:50,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:03:50,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1362606300, now seen corresponding path program 2 times [2020-11-11 15:03:50,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:03:50,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271629588] [2020-11-11 15:03:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:03:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:03:50,988 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-11 15:03:50,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271629588] [2020-11-11 15:03:50,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:03:50,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-11 15:03:50,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068903962] [2020-11-11 15:03:50,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-11 15:03:50,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:03:50,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-11 15:03:50,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-11 15:03:50,996 INFO L87 Difference]: Start difference. First operand 35961 states and 154539 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:03:52,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:03:52,353 INFO L93 Difference]: Finished difference Result 42618 states and 185820 transitions. [2020-11-11 15:03:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 15:03:52,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2020-11-11 15:03:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:03:53,370 INFO L225 Difference]: With dead ends: 42618 [2020-11-11 15:03:53,371 INFO L226 Difference]: Without dead ends: 42618 [2020-11-11 15:03:53,372 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-11-11 15:03:53,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42618 states. [2020-11-11 15:03:55,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42618 to 35961. [2020-11-11 15:03:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35961 states, 35958 states have (on average 4.297764058067746) internal successors, (154539), 35960 states have internal predecessors, (154539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:03:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35961 states to 35961 states and 154539 transitions. [2020-11-11 15:03:55,971 INFO L78 Accepts]: Start accepts. Automaton has 35961 states and 154539 transitions. Word has length 38 [2020-11-11 15:03:55,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:03:55,971 INFO L481 AbstractCegarLoop]: Abstraction has 35961 states and 154539 transitions. [2020-11-11 15:03:55,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:03:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 35961 states and 154539 transitions. [2020-11-11 15:03:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-11 15:03:55,974 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:03:55,974 INFO L494 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] [2020-11-11 15:03:55,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-11 15:03:55,975 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-11 15:03:55,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:03:55,976 INFO L82 PathProgramCache]: Analyzing trace with hash 16789342, now seen corresponding path program 3 times [2020-11-11 15:03:55,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:03:55,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286716873] [2020-11-11 15:03:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:03:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:03:56,237 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-11 15:03:56,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286716873] [2020-11-11 15:03:56,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:03:56,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-11 15:03:56,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753599741] [2020-11-11 15:03:56,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-11 15:03:56,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:03:56,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-11 15:03:56,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-11 15:03:56,246 INFO L87 Difference]: Start difference. First operand 35961 states and 154539 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:03:57,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:03:57,228 INFO L93 Difference]: Finished difference Result 49225 states and 217017 transitions. [2020-11-11 15:03:57,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-11 15:03:57,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2020-11-11 15:03:57,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:03:58,247 INFO L225 Difference]: With dead ends: 49225 [2020-11-11 15:03:58,247 INFO L226 Difference]: Without dead ends: 49225 [2020-11-11 15:03:58,249 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-11-11 15:03:58,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49225 states. [2020-11-11 15:04:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49225 to 35912. [2020-11-11 15:04:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35912 states, 35910 states have (on average 4.3011974380395435) internal successors, (154456), 35911 states have internal predecessors, (154456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 154456 transitions. [2020-11-11 15:04:00,279 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 154456 transitions. Word has length 38 [2020-11-11 15:04:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:00,280 INFO L481 AbstractCegarLoop]: Abstraction has 35912 states and 154456 transitions. [2020-11-11 15:04:00,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 154456 transitions. [2020-11-11 15:04:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-11 15:04:00,291 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:00,291 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:00,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-11 15:04:00,292 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-11 15:04:00,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:00,293 INFO L82 PathProgramCache]: Analyzing trace with hash 836868884, now seen corresponding path program 1 times [2020-11-11 15:04:00,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:00,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98182350] [2020-11-11 15:04:00,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:00,393 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-11 15:04:00,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98182350] [2020-11-11 15:04:00,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:00,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 15:04:00,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527648614] [2020-11-11 15:04:00,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 15:04:00,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:00,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 15:04:00,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-11 15:04:00,396 INFO L87 Difference]: Start difference. First operand 35912 states and 154456 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:01,586 INFO L93 Difference]: Finished difference Result 42102 states and 182263 transitions. [2020-11-11 15:04:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 15:04:01,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2020-11-11 15:04:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:01,781 INFO L225 Difference]: With dead ends: 42102 [2020-11-11 15:04:01,782 INFO L226 Difference]: Without dead ends: 42102 [2020-11-11 15:04:01,782 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11 15:04:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42102 states. [2020-11-11 15:04:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42102 to 39639. [2020-11-11 15:04:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39639 states, 39637 states have (on average 4.346948558165351) internal successors, (172300), 39638 states have internal predecessors, (172300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39639 states to 39639 states and 172300 transitions. [2020-11-11 15:04:03,696 INFO L78 Accepts]: Start accepts. Automaton has 39639 states and 172300 transitions. Word has length 48 [2020-11-11 15:04:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:03,697 INFO L481 AbstractCegarLoop]: Abstraction has 39639 states and 172300 transitions. [2020-11-11 15:04:03,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 39639 states and 172300 transitions. [2020-11-11 15:04:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-11 15:04:03,715 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:03,715 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:03,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-11 15:04:03,716 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-11 15:04:03,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:03,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1121433066, now seen corresponding path program 2 times [2020-11-11 15:04:03,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:03,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659173783] [2020-11-11 15:04:03,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:03,835 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-11 15:04:03,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659173783] [2020-11-11 15:04:03,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:03,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 15:04:03,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83653601] [2020-11-11 15:04:03,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 15:04:03,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:03,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 15:04:03,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 15:04:03,840 INFO L87 Difference]: Start difference. First operand 39639 states and 172300 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:05,539 INFO L93 Difference]: Finished difference Result 81544 states and 346269 transitions. [2020-11-11 15:04:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 15:04:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2020-11-11 15:04:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:05,811 INFO L225 Difference]: With dead ends: 81544 [2020-11-11 15:04:05,811 INFO L226 Difference]: Without dead ends: 53357 [2020-11-11 15:04:05,812 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-11 15:04:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53357 states. [2020-11-11 15:04:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53357 to 39692. [2020-11-11 15:04:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39692 states, 39690 states have (on average 4.194154698916604) internal successors, (166466), 39691 states have internal predecessors, (166466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39692 states to 39692 states and 166466 transitions. [2020-11-11 15:04:08,086 INFO L78 Accepts]: Start accepts. Automaton has 39692 states and 166466 transitions. Word has length 48 [2020-11-11 15:04:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:08,087 INFO L481 AbstractCegarLoop]: Abstraction has 39692 states and 166466 transitions. [2020-11-11 15:04:08,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 39692 states and 166466 transitions. [2020-11-11 15:04:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-11 15:04:08,118 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:08,119 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:08,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-11 15:04:08,119 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-11 15:04:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:08,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1782603369, now seen corresponding path program 1 times [2020-11-11 15:04:08,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:08,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281343998] [2020-11-11 15:04:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:08,272 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-11 15:04:08,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281343998] [2020-11-11 15:04:08,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:08,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-11 15:04:08,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40404840] [2020-11-11 15:04:08,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-11 15:04:08,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:08,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-11 15:04:08,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-11 15:04:08,275 INFO L87 Difference]: Start difference. First operand 39692 states and 166466 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:09,862 INFO L93 Difference]: Finished difference Result 46510 states and 195244 transitions. [2020-11-11 15:04:09,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-11 15:04:09,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2020-11-11 15:04:09,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:10,048 INFO L225 Difference]: With dead ends: 46510 [2020-11-11 15:04:10,049 INFO L226 Difference]: Without dead ends: 46438 [2020-11-11 15:04:10,049 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-11-11 15:04:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46438 states. [2020-11-11 15:04:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46438 to 39671. [2020-11-11 15:04:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39671 states, 39669 states have (on average 4.195568327913484) internal successors, (166434), 39670 states have internal predecessors, (166434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39671 states to 39671 states and 166434 transitions. [2020-11-11 15:04:11,978 INFO L78 Accepts]: Start accepts. Automaton has 39671 states and 166434 transitions. Word has length 50 [2020-11-11 15:04:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:11,978 INFO L481 AbstractCegarLoop]: Abstraction has 39671 states and 166434 transitions. [2020-11-11 15:04:11,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 39671 states and 166434 transitions. [2020-11-11 15:04:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-11 15:04:12,007 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:12,007 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:12,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-11 15:04:12,008 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-11 15:04:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:12,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1777774509, now seen corresponding path program 2 times [2020-11-11 15:04:12,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:12,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746921697] [2020-11-11 15:04:12,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:12,257 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-11 15:04:12,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746921697] [2020-11-11 15:04:12,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:12,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-11 15:04:12,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641941930] [2020-11-11 15:04:12,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-11 15:04:12,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:12,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-11 15:04:12,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-11 15:04:12,261 INFO L87 Difference]: Start difference. First operand 39671 states and 166434 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:14,219 INFO L93 Difference]: Finished difference Result 57257 states and 234266 transitions. [2020-11-11 15:04:14,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-11 15:04:14,219 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2020-11-11 15:04:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:14,513 INFO L225 Difference]: With dead ends: 57257 [2020-11-11 15:04:14,513 INFO L226 Difference]: Without dead ends: 52441 [2020-11-11 15:04:14,514 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2020-11-11 15:04:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52441 states. [2020-11-11 15:04:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52441 to 39576. [2020-11-11 15:04:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39576 states, 39574 states have (on average 4.1984130995097795) internal successors, (166148), 39575 states have internal predecessors, (166148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39576 states to 39576 states and 166148 transitions. [2020-11-11 15:04:16,614 INFO L78 Accepts]: Start accepts. Automaton has 39576 states and 166148 transitions. Word has length 50 [2020-11-11 15:04:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:16,615 INFO L481 AbstractCegarLoop]: Abstraction has 39576 states and 166148 transitions. [2020-11-11 15:04:16,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 39576 states and 166148 transitions. [2020-11-11 15:04:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-11 15:04:16,638 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:16,638 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:16,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-11 15:04:16,638 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-11 15:04:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:16,639 INFO L82 PathProgramCache]: Analyzing trace with hash -408039356, now seen corresponding path program 1 times [2020-11-11 15:04:16,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:16,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145468450] [2020-11-11 15:04:16,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:16,748 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-11 15:04:16,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145468450] [2020-11-11 15:04:16,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:16,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 15:04:16,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523304777] [2020-11-11 15:04:16,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 15:04:16,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:16,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 15:04:16,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-11 15:04:16,751 INFO L87 Difference]: Start difference. First operand 39576 states and 166148 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:17,380 INFO L93 Difference]: Finished difference Result 45587 states and 190358 transitions. [2020-11-11 15:04:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 15:04:17,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2020-11-11 15:04:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:17,645 INFO L225 Difference]: With dead ends: 45587 [2020-11-11 15:04:17,645 INFO L226 Difference]: Without dead ends: 45107 [2020-11-11 15:04:17,646 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11 15:04:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45107 states. [2020-11-11 15:04:19,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45107 to 43159. [2020-11-11 15:04:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43159 states, 43157 states have (on average 4.206455499687189) internal successors, (181538), 43158 states have internal predecessors, (181538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43159 states to 43159 states and 181538 transitions. [2020-11-11 15:04:19,677 INFO L78 Accepts]: Start accepts. Automaton has 43159 states and 181538 transitions. Word has length 51 [2020-11-11 15:04:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:19,677 INFO L481 AbstractCegarLoop]: Abstraction has 43159 states and 181538 transitions. [2020-11-11 15:04:19,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 43159 states and 181538 transitions. [2020-11-11 15:04:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-11 15:04:19,707 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:19,707 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:19,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-11 15:04:19,707 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-11 15:04:19,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:19,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1640650238, now seen corresponding path program 2 times [2020-11-11 15:04:19,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:19,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476932346] [2020-11-11 15:04:19,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 15:04:19,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476932346] [2020-11-11 15:04:19,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:19,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-11 15:04:19,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502195316] [2020-11-11 15:04:19,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-11 15:04:19,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:19,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-11 15:04:19,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-11 15:04:19,866 INFO L87 Difference]: Start difference. First operand 43159 states and 181538 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:21,543 INFO L93 Difference]: Finished difference Result 46046 states and 191408 transitions. [2020-11-11 15:04:21,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-11 15:04:21,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2020-11-11 15:04:21,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:21,869 INFO L225 Difference]: With dead ends: 46046 [2020-11-11 15:04:21,869 INFO L226 Difference]: Without dead ends: 45566 [2020-11-11 15:04:21,870 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-11-11 15:04:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45566 states. [2020-11-11 15:04:23,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45566 to 40287. [2020-11-11 15:04:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40287 states, 40285 states have (on average 4.173364775971205) internal successors, (168124), 40286 states have internal predecessors, (168124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40287 states to 40287 states and 168124 transitions. [2020-11-11 15:04:24,134 INFO L78 Accepts]: Start accepts. Automaton has 40287 states and 168124 transitions. Word has length 51 [2020-11-11 15:04:24,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:24,134 INFO L481 AbstractCegarLoop]: Abstraction has 40287 states and 168124 transitions. [2020-11-11 15:04:24,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 40287 states and 168124 transitions. [2020-11-11 15:04:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-11 15:04:24,160 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:24,161 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:24,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-11 15:04:24,161 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-11 15:04:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:24,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1064741974, now seen corresponding path program 3 times [2020-11-11 15:04:24,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:24,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107447480] [2020-11-11 15:04:24,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:24,366 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-11 15:04:24,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107447480] [2020-11-11 15:04:24,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:24,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-11 15:04:24,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531594281] [2020-11-11 15:04:24,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-11 15:04:24,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:24,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-11 15:04:24,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-11 15:04:24,371 INFO L87 Difference]: Start difference. First operand 40287 states and 168124 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:25,453 INFO L93 Difference]: Finished difference Result 47156 states and 197478 transitions. [2020-11-11 15:04:25,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 15:04:25,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2020-11-11 15:04:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:25,637 INFO L225 Difference]: With dead ends: 47156 [2020-11-11 15:04:25,637 INFO L226 Difference]: Without dead ends: 46910 [2020-11-11 15:04:25,638 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2020-11-11 15:04:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46910 states. [2020-11-11 15:04:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46910 to 43283. [2020-11-11 15:04:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43283 states, 43281 states have (on average 4.220073473348583) internal successors, (182649), 43282 states have internal predecessors, (182649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43283 states to 43283 states and 182649 transitions. [2020-11-11 15:04:27,805 INFO L78 Accepts]: Start accepts. Automaton has 43283 states and 182649 transitions. Word has length 51 [2020-11-11 15:04:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:27,805 INFO L481 AbstractCegarLoop]: Abstraction has 43283 states and 182649 transitions. [2020-11-11 15:04:27,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:27,806 INFO L276 IsEmpty]: Start isEmpty. Operand 43283 states and 182649 transitions. [2020-11-11 15:04:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-11 15:04:27,842 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:27,842 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:27,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-11 15:04:27,843 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-11 15:04:27,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:27,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1584793724, now seen corresponding path program 4 times [2020-11-11 15:04:27,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:27,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280113079] [2020-11-11 15:04:27,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:28,145 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-11 15:04:28,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280113079] [2020-11-11 15:04:28,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:28,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-11 15:04:28,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490145656] [2020-11-11 15:04:28,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-11 15:04:28,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:28,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-11 15:04:28,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-11 15:04:28,157 INFO L87 Difference]: Start difference. First operand 43283 states and 182649 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:29,673 INFO L93 Difference]: Finished difference Result 50138 states and 211972 transitions. [2020-11-11 15:04:29,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-11 15:04:29,674 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2020-11-11 15:04:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:29,878 INFO L225 Difference]: With dead ends: 50138 [2020-11-11 15:04:29,879 INFO L226 Difference]: Without dead ends: 49892 [2020-11-11 15:04:29,880 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-11-11 15:04:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49892 states. [2020-11-11 15:04:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49892 to 43283. [2020-11-11 15:04:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43283 states, 43281 states have (on average 4.220073473348583) internal successors, (182649), 43282 states have internal predecessors, (182649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43283 states to 43283 states and 182649 transitions. [2020-11-11 15:04:32,042 INFO L78 Accepts]: Start accepts. Automaton has 43283 states and 182649 transitions. Word has length 51 [2020-11-11 15:04:32,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:32,043 INFO L481 AbstractCegarLoop]: Abstraction has 43283 states and 182649 transitions. [2020-11-11 15:04:32,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:32,043 INFO L276 IsEmpty]: Start isEmpty. Operand 43283 states and 182649 transitions. [2020-11-11 15:04:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-11 15:04:32,085 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:32,085 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:32,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-11 15:04:32,086 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-11 15:04:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash 469402808, now seen corresponding path program 5 times [2020-11-11 15:04:32,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:32,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170443014] [2020-11-11 15:04:32,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:32,521 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-11 15:04:32,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170443014] [2020-11-11 15:04:32,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:32,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-11 15:04:32,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152043407] [2020-11-11 15:04:32,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-11 15:04:32,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:32,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-11 15:04:32,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-11-11 15:04:32,524 INFO L87 Difference]: Start difference. First operand 43283 states and 182649 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:35,352 INFO L93 Difference]: Finished difference Result 84146 states and 356783 transitions. [2020-11-11 15:04:35,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-11 15:04:35,353 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2020-11-11 15:04:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:35,781 INFO L225 Difference]: With dead ends: 84146 [2020-11-11 15:04:35,781 INFO L226 Difference]: Without dead ends: 83408 [2020-11-11 15:04:35,782 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2020-11-11 15:04:36,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83408 states. [2020-11-11 15:04:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83408 to 48155. [2020-11-11 15:04:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48155 states, 48153 states have (on average 4.258862376175939) internal successors, (205077), 48154 states have internal predecessors, (205077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48155 states to 48155 states and 205077 transitions. [2020-11-11 15:04:38,271 INFO L78 Accepts]: Start accepts. Automaton has 48155 states and 205077 transitions. Word has length 51 [2020-11-11 15:04:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:38,271 INFO L481 AbstractCegarLoop]: Abstraction has 48155 states and 205077 transitions. [2020-11-11 15:04:38,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 48155 states and 205077 transitions. [2020-11-11 15:04:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-11 15:04:38,305 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:38,305 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:38,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-11 15:04:38,306 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-11 15:04:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1527341706, now seen corresponding path program 6 times [2020-11-11 15:04:38,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:38,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523925935] [2020-11-11 15:04:38,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:38,502 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-11 15:04:38,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523925935] [2020-11-11 15:04:38,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:38,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-11 15:04:38,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092379374] [2020-11-11 15:04:38,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-11 15:04:38,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:38,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-11 15:04:38,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-11 15:04:38,506 INFO L87 Difference]: Start difference. First operand 48155 states and 205077 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:40,552 INFO L93 Difference]: Finished difference Result 62127 states and 266332 transitions. [2020-11-11 15:04:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-11 15:04:40,552 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2020-11-11 15:04:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:40,974 INFO L225 Difference]: With dead ends: 62127 [2020-11-11 15:04:40,974 INFO L226 Difference]: Without dead ends: 61881 [2020-11-11 15:04:40,975 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2020-11-11 15:04:41,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61881 states. [2020-11-11 15:04:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61881 to 44670. [2020-11-11 15:04:43,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44670 states, 44668 states have (on average 4.254007343064386) internal successors, (190018), 44669 states have internal predecessors, (190018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44670 states to 44670 states and 190018 transitions. [2020-11-11 15:04:43,382 INFO L78 Accepts]: Start accepts. Automaton has 44670 states and 190018 transitions. Word has length 51 [2020-11-11 15:04:43,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:43,382 INFO L481 AbstractCegarLoop]: Abstraction has 44670 states and 190018 transitions. [2020-11-11 15:04:43,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:43,383 INFO L276 IsEmpty]: Start isEmpty. Operand 44670 states and 190018 transitions. [2020-11-11 15:04:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-11 15:04:43,434 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:43,434 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:43,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-11 15:04:43,434 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-11 15:04:43,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:43,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1988407870, now seen corresponding path program 1 times [2020-11-11 15:04:43,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:43,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321918651] [2020-11-11 15:04:43,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:43,673 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-11 15:04:43,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321918651] [2020-11-11 15:04:43,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:43,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-11 15:04:43,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019597132] [2020-11-11 15:04:43,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-11 15:04:43,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:43,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-11 15:04:43,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-11-11 15:04:43,677 INFO L87 Difference]: Start difference. First operand 44670 states and 190018 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:44,792 INFO L93 Difference]: Finished difference Result 60426 states and 250156 transitions. [2020-11-11 15:04:44,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-11 15:04:44,800 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2020-11-11 15:04:44,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:45,014 INFO L225 Difference]: With dead ends: 60426 [2020-11-11 15:04:45,014 INFO L226 Difference]: Without dead ends: 55594 [2020-11-11 15:04:45,015 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2020-11-11 15:04:45,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55594 states. [2020-11-11 15:04:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55594 to 44384. [2020-11-11 15:04:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44384 states, 44382 states have (on average 4.256590509666081) internal successors, (188916), 44383 states have internal predecessors, (188916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44384 states to 44384 states and 188916 transitions. [2020-11-11 15:04:47,393 INFO L78 Accepts]: Start accepts. Automaton has 44384 states and 188916 transitions. Word has length 53 [2020-11-11 15:04:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:47,393 INFO L481 AbstractCegarLoop]: Abstraction has 44384 states and 188916 transitions. [2020-11-11 15:04:47,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 44384 states and 188916 transitions. [2020-11-11 15:04:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-11 15:04:47,440 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:47,440 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:47,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-11 15:04:47,441 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-11 15:04:47,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:47,442 INFO L82 PathProgramCache]: Analyzing trace with hash 605377474, now seen corresponding path program 1 times [2020-11-11 15:04:47,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:47,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840926712] [2020-11-11 15:04:47,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:47,743 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-11 15:04:47,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840926712] [2020-11-11 15:04:47,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:47,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-11 15:04:47,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353110491] [2020-11-11 15:04:47,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-11 15:04:47,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:47,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-11 15:04:47,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-11-11 15:04:47,747 INFO L87 Difference]: Start difference. First operand 44384 states and 188916 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:49,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:49,668 INFO L93 Difference]: Finished difference Result 53376 states and 226653 transitions. [2020-11-11 15:04:49,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-11 15:04:49,669 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2020-11-11 15:04:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:49,898 INFO L225 Difference]: With dead ends: 53376 [2020-11-11 15:04:49,898 INFO L226 Difference]: Without dead ends: 53070 [2020-11-11 15:04:49,899 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2020-11-11 15:04:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53070 states. [2020-11-11 15:04:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53070 to 46457. [2020-11-11 15:04:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46457 states, 46455 states have (on average 4.2776450328274676) internal successors, (198718), 46456 states have internal predecessors, (198718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46457 states to 46457 states and 198718 transitions. [2020-11-11 15:04:52,076 INFO L78 Accepts]: Start accepts. Automaton has 46457 states and 198718 transitions. Word has length 53 [2020-11-11 15:04:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:52,077 INFO L481 AbstractCegarLoop]: Abstraction has 46457 states and 198718 transitions. [2020-11-11 15:04:52,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 46457 states and 198718 transitions. [2020-11-11 15:04:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-11 15:04:52,133 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:52,134 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:52,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-11 15:04:52,134 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-11 15:04:52,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:52,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1245035696, now seen corresponding path program 2 times [2020-11-11 15:04:52,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:52,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832216126] [2020-11-11 15:04:52,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 15:04:52,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832216126] [2020-11-11 15:04:52,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:52,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-11 15:04:52,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297367447] [2020-11-11 15:04:52,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-11 15:04:52,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:52,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-11 15:04:52,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-11-11 15:04:52,628 INFO L87 Difference]: Start difference. First operand 46457 states and 198718 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:55,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:55,108 INFO L93 Difference]: Finished difference Result 55262 states and 233886 transitions. [2020-11-11 15:04:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-11 15:04:55,109 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2020-11-11 15:04:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:55,406 INFO L225 Difference]: With dead ends: 55262 [2020-11-11 15:04:55,406 INFO L226 Difference]: Without dead ends: 54344 [2020-11-11 15:04:55,407 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2020-11-11 15:04:55,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54344 states. [2020-11-11 15:04:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54344 to 43298. [2020-11-11 15:04:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43298 states, 43296 states have (on average 4.214985218033998) internal successors, (182492), 43297 states have internal predecessors, (182492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43298 states to 43298 states and 182492 transitions. [2020-11-11 15:04:57,704 INFO L78 Accepts]: Start accepts. Automaton has 43298 states and 182492 transitions. Word has length 53 [2020-11-11 15:04:57,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:04:57,705 INFO L481 AbstractCegarLoop]: Abstraction has 43298 states and 182492 transitions. [2020-11-11 15:04:57,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 43298 states and 182492 transitions. [2020-11-11 15:04:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-11 15:04:57,749 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:04:57,749 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:04:57,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-11 15:04:57,750 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-11 15:04:57,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:04:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1667791797, now seen corresponding path program 1 times [2020-11-11 15:04:57,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:04:57,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454908004] [2020-11-11 15:04:57,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:04:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:04:58,014 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-11 15:04:58,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454908004] [2020-11-11 15:04:58,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:04:58,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-11 15:04:58,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597050189] [2020-11-11 15:04:58,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-11 15:04:58,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:04:58,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-11 15:04:58,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-11 15:04:58,018 INFO L87 Difference]: Start difference. First operand 43298 states and 182492 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:04:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:04:59,222 INFO L93 Difference]: Finished difference Result 51458 states and 216171 transitions. [2020-11-11 15:04:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-11 15:04:59,223 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2020-11-11 15:04:59,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:04:59,444 INFO L225 Difference]: With dead ends: 51458 [2020-11-11 15:04:59,445 INFO L226 Difference]: Without dead ends: 51152 [2020-11-11 15:04:59,446 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2020-11-11 15:04:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51152 states. [2020-11-11 15:05:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51152 to 43292. [2020-11-11 15:05:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43292 states, 43290 states have (on average 4.215338415338415) internal successors, (182482), 43291 states have internal predecessors, (182482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43292 states to 43292 states and 182482 transitions. [2020-11-11 15:05:01,615 INFO L78 Accepts]: Start accepts. Automaton has 43292 states and 182482 transitions. Word has length 53 [2020-11-11 15:05:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:01,615 INFO L481 AbstractCegarLoop]: Abstraction has 43292 states and 182482 transitions. [2020-11-11 15:05:01,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 43292 states and 182482 transitions. [2020-11-11 15:05:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-11 15:05:01,654 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:01,654 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:01,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-11 15:05:01,654 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-11 15:05:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:01,654 INFO L82 PathProgramCache]: Analyzing trace with hash 981743901, now seen corresponding path program 2 times [2020-11-11 15:05:01,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:01,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940536114] [2020-11-11 15:05:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:02,112 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-11 15:05:02,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940536114] [2020-11-11 15:05:02,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:02,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-11 15:05:02,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894356739] [2020-11-11 15:05:02,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-11 15:05:02,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:02,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-11 15:05:02,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-11-11 15:05:02,115 INFO L87 Difference]: Start difference. First operand 43292 states and 182482 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:03,962 INFO L93 Difference]: Finished difference Result 51369 states and 215912 transitions. [2020-11-11 15:05:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-11 15:05:03,963 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2020-11-11 15:05:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:04,190 INFO L225 Difference]: With dead ends: 51369 [2020-11-11 15:05:04,190 INFO L226 Difference]: Without dead ends: 51063 [2020-11-11 15:05:04,191 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2020-11-11 15:05:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51063 states. [2020-11-11 15:05:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51063 to 43292. [2020-11-11 15:05:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43292 states, 43290 states have (on average 4.215338415338415) internal successors, (182482), 43291 states have internal predecessors, (182482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43292 states to 43292 states and 182482 transitions. [2020-11-11 15:05:06,485 INFO L78 Accepts]: Start accepts. Automaton has 43292 states and 182482 transitions. Word has length 53 [2020-11-11 15:05:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:06,486 INFO L481 AbstractCegarLoop]: Abstraction has 43292 states and 182482 transitions. [2020-11-11 15:05:06,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 43292 states and 182482 transitions. [2020-11-11 15:05:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-11 15:05:06,529 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:06,529 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:06,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-11 15:05:06,529 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-11 15:05:06,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:06,530 INFO L82 PathProgramCache]: Analyzing trace with hash 924291883, now seen corresponding path program 3 times [2020-11-11 15:05:06,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:06,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263788448] [2020-11-11 15:05:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:06,974 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-11 15:05:06,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263788448] [2020-11-11 15:05:06,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:06,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-11 15:05:06,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759922576] [2020-11-11 15:05:06,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-11 15:05:06,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:06,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-11 15:05:06,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-11-11 15:05:06,980 INFO L87 Difference]: Start difference. First operand 43292 states and 182482 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:08,492 INFO L93 Difference]: Finished difference Result 56735 states and 238106 transitions. [2020-11-11 15:05:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-11 15:05:08,493 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2020-11-11 15:05:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:08,815 INFO L225 Difference]: With dead ends: 56735 [2020-11-11 15:05:08,815 INFO L226 Difference]: Without dead ends: 56429 [2020-11-11 15:05:08,816 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=587, Unknown=0, NotChecked=0, Total=812 [2020-11-11 15:05:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56429 states. [2020-11-11 15:05:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56429 to 43199. [2020-11-11 15:05:11,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43199 states, 43197 states have (on average 4.218742042271454) internal successors, (182237), 43198 states have internal predecessors, (182237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43199 states to 43199 states and 182237 transitions. [2020-11-11 15:05:11,206 INFO L78 Accepts]: Start accepts. Automaton has 43199 states and 182237 transitions. Word has length 53 [2020-11-11 15:05:11,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:11,206 INFO L481 AbstractCegarLoop]: Abstraction has 43199 states and 182237 transitions. [2020-11-11 15:05:11,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 43199 states and 182237 transitions. [2020-11-11 15:05:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-11 15:05:11,250 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:11,250 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:11,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-11 15:05:11,250 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-11 15:05:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:11,251 INFO L82 PathProgramCache]: Analyzing trace with hash -397382220, now seen corresponding path program 3 times [2020-11-11 15:05:11,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:11,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734090375] [2020-11-11 15:05:11,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:11,392 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-11 15:05:11,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734090375] [2020-11-11 15:05:11,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:11,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-11 15:05:11,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221731065] [2020-11-11 15:05:11,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-11 15:05:11,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:11,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-11 15:05:11,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-11 15:05:11,395 INFO L87 Difference]: Start difference. First operand 43199 states and 182237 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:12,406 WARN L193 SmtUtils]: Spent 741.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-11-11 15:05:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:13,120 INFO L93 Difference]: Finished difference Result 49181 states and 205222 transitions. [2020-11-11 15:05:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 15:05:13,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2020-11-11 15:05:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:13,414 INFO L225 Difference]: With dead ends: 49181 [2020-11-11 15:05:13,414 INFO L226 Difference]: Without dead ends: 48875 [2020-11-11 15:05:13,416 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2020-11-11 15:05:13,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48875 states. [2020-11-11 15:05:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48875 to 34998. [2020-11-11 15:05:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34998 states, 34996 states have (on average 4.18664990284604) internal successors, (146516), 34997 states have internal predecessors, (146516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34998 states to 34998 states and 146516 transitions. [2020-11-11 15:05:15,536 INFO L78 Accepts]: Start accepts. Automaton has 34998 states and 146516 transitions. Word has length 53 [2020-11-11 15:05:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:15,537 INFO L481 AbstractCegarLoop]: Abstraction has 34998 states and 146516 transitions. [2020-11-11 15:05:15,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 34998 states and 146516 transitions. [2020-11-11 15:05:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-11 15:05:15,594 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:15,594 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:15,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-11 15:05:15,594 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-11 15:05:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash 40295708, now seen corresponding path program 1 times [2020-11-11 15:05:15,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:15,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640482748] [2020-11-11 15:05:15,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:16,108 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-11 15:05:16,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640482748] [2020-11-11 15:05:16,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:16,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-11 15:05:16,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766842164] [2020-11-11 15:05:16,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-11 15:05:16,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:16,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-11 15:05:16,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2020-11-11 15:05:16,115 INFO L87 Difference]: Start difference. First operand 34998 states and 146516 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:17,711 INFO L93 Difference]: Finished difference Result 36913 states and 154101 transitions. [2020-11-11 15:05:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-11 15:05:17,712 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2020-11-11 15:05:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:17,863 INFO L225 Difference]: With dead ends: 36913 [2020-11-11 15:05:17,863 INFO L226 Difference]: Without dead ends: 35995 [2020-11-11 15:05:17,864 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2020-11-11 15:05:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35995 states. [2020-11-11 15:05:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35995 to 23574. [2020-11-11 15:05:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23574 states, 23572 states have (on average 4.098040047514) internal successors, (96599), 23573 states have internal predecessors, (96599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23574 states to 23574 states and 96599 transitions. [2020-11-11 15:05:19,477 INFO L78 Accepts]: Start accepts. Automaton has 23574 states and 96599 transitions. Word has length 55 [2020-11-11 15:05:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:19,477 INFO L481 AbstractCegarLoop]: Abstraction has 23574 states and 96599 transitions. [2020-11-11 15:05:19,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 23574 states and 96599 transitions. [2020-11-11 15:05:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-11 15:05:19,510 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:19,511 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:19,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-11 15:05:19,511 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-11 15:05:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1392989191, now seen corresponding path program 1 times [2020-11-11 15:05:19,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:19,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328298552] [2020-11-11 15:05:19,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:19,571 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-11 15:05:19,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328298552] [2020-11-11 15:05:19,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:19,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 15:05:19,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589983033] [2020-11-11 15:05:19,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 15:05:19,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:19,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 15:05:19,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-11 15:05:19,574 INFO L87 Difference]: Start difference. First operand 23574 states and 96599 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:20,094 INFO L93 Difference]: Finished difference Result 28315 states and 114477 transitions. [2020-11-11 15:05:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 15:05:20,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2020-11-11 15:05:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:20,285 INFO L225 Difference]: With dead ends: 28315 [2020-11-11 15:05:20,285 INFO L226 Difference]: Without dead ends: 27481 [2020-11-11 15:05:20,286 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11 15:05:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27481 states. [2020-11-11 15:05:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27481 to 25663. [2020-11-11 15:05:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25663 states, 25661 states have (on average 4.092552901289896) internal successors, (105019), 25662 states have internal predecessors, (105019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25663 states to 25663 states and 105019 transitions. [2020-11-11 15:05:22,250 INFO L78 Accepts]: Start accepts. Automaton has 25663 states and 105019 transitions. Word has length 56 [2020-11-11 15:05:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:22,251 INFO L481 AbstractCegarLoop]: Abstraction has 25663 states and 105019 transitions. [2020-11-11 15:05:22,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 25663 states and 105019 transitions. [2020-11-11 15:05:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-11 15:05:22,304 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:22,304 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:22,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-11 15:05:22,304 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-11 15:05:22,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:22,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2102839045, now seen corresponding path program 2 times [2020-11-11 15:05:22,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:22,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313134572] [2020-11-11 15:05:22,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:22,430 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-11 15:05:22,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313134572] [2020-11-11 15:05:22,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:22,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-11 15:05:22,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249731980] [2020-11-11 15:05:22,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-11 15:05:22,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:22,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-11 15:05:22,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-11 15:05:22,439 INFO L87 Difference]: Start difference. First operand 25663 states and 105019 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:23,039 INFO L93 Difference]: Finished difference Result 30383 states and 122865 transitions. [2020-11-11 15:05:23,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-11 15:05:23,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2020-11-11 15:05:23,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:23,155 INFO L225 Difference]: With dead ends: 30383 [2020-11-11 15:05:23,156 INFO L226 Difference]: Without dead ends: 29549 [2020-11-11 15:05:23,156 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-11-11 15:05:23,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29549 states. [2020-11-11 15:05:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29549 to 25642. [2020-11-11 15:05:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25642 states, 25640 states have (on average 4.094656786271451) internal successors, (104987), 25641 states have internal predecessors, (104987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25642 states to 25642 states and 104987 transitions. [2020-11-11 15:05:23,988 INFO L78 Accepts]: Start accepts. Automaton has 25642 states and 104987 transitions. Word has length 56 [2020-11-11 15:05:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:23,989 INFO L481 AbstractCegarLoop]: Abstraction has 25642 states and 104987 transitions. [2020-11-11 15:05:23,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 25642 states and 104987 transitions. [2020-11-11 15:05:24,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-11 15:05:24,024 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:24,024 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:24,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-11 15:05:24,024 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-11 15:05:24,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1575311443, now seen corresponding path program 3 times [2020-11-11 15:05:24,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:24,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902021451] [2020-11-11 15:05:24,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:24,832 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-11 15:05:24,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902021451] [2020-11-11 15:05:24,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:24,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-11 15:05:24,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922406117] [2020-11-11 15:05:24,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-11 15:05:24,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:24,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-11 15:05:24,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-11 15:05:24,835 INFO L87 Difference]: Start difference. First operand 25642 states and 104987 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:25,577 INFO L93 Difference]: Finished difference Result 36648 states and 145790 transitions. [2020-11-11 15:05:25,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-11 15:05:25,578 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2020-11-11 15:05:25,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:25,686 INFO L225 Difference]: With dead ends: 36648 [2020-11-11 15:05:25,686 INFO L226 Difference]: Without dead ends: 29585 [2020-11-11 15:05:25,687 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2020-11-11 15:05:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29585 states. [2020-11-11 15:05:26,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29585 to 22287. [2020-11-11 15:05:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22287 states, 22285 states have (on average 4.065918779448059) internal successors, (90609), 22286 states have internal predecessors, (90609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22287 states to 22287 states and 90609 transitions. [2020-11-11 15:05:26,435 INFO L78 Accepts]: Start accepts. Automaton has 22287 states and 90609 transitions. Word has length 56 [2020-11-11 15:05:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:26,435 INFO L481 AbstractCegarLoop]: Abstraction has 22287 states and 90609 transitions. [2020-11-11 15:05:26,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 22287 states and 90609 transitions. [2020-11-11 15:05:26,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-11 15:05:26,466 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:26,466 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:26,466 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-11 15:05:26,466 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-11 15:05:26,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:26,467 INFO L82 PathProgramCache]: Analyzing trace with hash -184689643, now seen corresponding path program 1 times [2020-11-11 15:05:26,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:26,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827143690] [2020-11-11 15:05:26,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:26,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-11 15:05:26,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827143690] [2020-11-11 15:05:26,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:26,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-11 15:05:26,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886152143] [2020-11-11 15:05:26,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-11 15:05:26,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:26,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-11 15:05:26,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-11 15:05:26,638 INFO L87 Difference]: Start difference. First operand 22287 states and 90609 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:27,829 INFO L93 Difference]: Finished difference Result 26561 states and 106782 transitions. [2020-11-11 15:05:27,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 15:05:27,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2020-11-11 15:05:27,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:27,935 INFO L225 Difference]: With dead ends: 26561 [2020-11-11 15:05:27,936 INFO L226 Difference]: Without dead ends: 25922 [2020-11-11 15:05:27,936 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2020-11-11 15:05:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25922 states. [2020-11-11 15:05:28,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25922 to 22282. [2020-11-11 15:05:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22282 states, 22280 states have (on average 4.066427289048474) internal successors, (90600), 22281 states have internal predecessors, (90600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22282 states to 22282 states and 90600 transitions. [2020-11-11 15:05:28,697 INFO L78 Accepts]: Start accepts. Automaton has 22282 states and 90600 transitions. Word has length 56 [2020-11-11 15:05:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:28,697 INFO L481 AbstractCegarLoop]: Abstraction has 22282 states and 90600 transitions. [2020-11-11 15:05:28,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 22282 states and 90600 transitions. [2020-11-11 15:05:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-11 15:05:28,729 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:28,730 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:28,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-11 15:05:28,730 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-11 15:05:28,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:28,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1187292541, now seen corresponding path program 2 times [2020-11-11 15:05:28,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:28,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968886308] [2020-11-11 15:05:28,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:28,969 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-11 15:05:28,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968886308] [2020-11-11 15:05:28,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:28,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-11 15:05:28,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37740680] [2020-11-11 15:05:28,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-11 15:05:28,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:28,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-11 15:05:28,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-11 15:05:28,972 INFO L87 Difference]: Start difference. First operand 22282 states and 90600 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:29,939 INFO L93 Difference]: Finished difference Result 26540 states and 106739 transitions. [2020-11-11 15:05:29,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-11 15:05:29,940 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2020-11-11 15:05:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:30,035 INFO L225 Difference]: With dead ends: 26540 [2020-11-11 15:05:30,035 INFO L226 Difference]: Without dead ends: 25901 [2020-11-11 15:05:30,036 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2020-11-11 15:05:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25901 states. [2020-11-11 15:05:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25901 to 22272. [2020-11-11 15:05:31,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22272 states, 22270 states have (on average 4.067175572519084) internal successors, (90576), 22271 states have internal predecessors, (90576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22272 states to 22272 states and 90576 transitions. [2020-11-11 15:05:31,106 INFO L78 Accepts]: Start accepts. Automaton has 22272 states and 90576 transitions. Word has length 56 [2020-11-11 15:05:31,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:31,106 INFO L481 AbstractCegarLoop]: Abstraction has 22272 states and 90576 transitions. [2020-11-11 15:05:31,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:31,106 INFO L276 IsEmpty]: Start isEmpty. Operand 22272 states and 90576 transitions. [2020-11-11 15:05:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-11 15:05:31,137 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:31,137 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:31,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-11 15:05:31,138 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-11 15:05:31,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:31,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2134456719, now seen corresponding path program 3 times [2020-11-11 15:05:31,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:31,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163368556] [2020-11-11 15:05:31,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:31,774 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-11 15:05:31,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163368556] [2020-11-11 15:05:31,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:31,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-11 15:05:31,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077326160] [2020-11-11 15:05:31,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-11 15:05:31,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:31,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-11 15:05:31,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-11-11 15:05:31,776 INFO L87 Difference]: Start difference. First operand 22272 states and 90576 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:33,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:33,129 INFO L93 Difference]: Finished difference Result 26505 states and 106661 transitions. [2020-11-11 15:05:33,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 15:05:33,130 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2020-11-11 15:05:33,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:33,232 INFO L225 Difference]: With dead ends: 26505 [2020-11-11 15:05:33,232 INFO L226 Difference]: Without dead ends: 25866 [2020-11-11 15:05:33,233 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2020-11-11 15:05:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25866 states. [2020-11-11 15:05:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25866 to 22272. [2020-11-11 15:05:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22272 states, 22270 states have (on average 4.063134261338123) internal successors, (90486), 22271 states have internal predecessors, (90486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:34,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22272 states to 22272 states and 90486 transitions. [2020-11-11 15:05:34,355 INFO L78 Accepts]: Start accepts. Automaton has 22272 states and 90486 transitions. Word has length 56 [2020-11-11 15:05:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:34,356 INFO L481 AbstractCegarLoop]: Abstraction has 22272 states and 90486 transitions. [2020-11-11 15:05:34,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 22272 states and 90486 transitions. [2020-11-11 15:05:34,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-11 15:05:34,387 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:34,387 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:34,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-11 15:05:34,387 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-11 15:05:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:34,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1601085093, now seen corresponding path program 4 times [2020-11-11 15:05:34,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:34,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047306924] [2020-11-11 15:05:34,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:34,647 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-11 15:05:34,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047306924] [2020-11-11 15:05:34,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:34,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-11 15:05:34,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063109945] [2020-11-11 15:05:34,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-11 15:05:34,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:34,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-11 15:05:34,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-11-11 15:05:34,650 INFO L87 Difference]: Start difference. First operand 22272 states and 90486 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:35,761 INFO L93 Difference]: Finished difference Result 31747 states and 127327 transitions. [2020-11-11 15:05:35,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-11 15:05:35,762 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2020-11-11 15:05:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:35,883 INFO L225 Difference]: With dead ends: 31747 [2020-11-11 15:05:35,883 INFO L226 Difference]: Without dead ends: 31108 [2020-11-11 15:05:35,884 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2020-11-11 15:05:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31108 states. [2020-11-11 15:05:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31108 to 22056. [2020-11-11 15:05:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22056 states, 22054 states have (on average 4.068105559082253) internal successors, (89718), 22055 states have internal predecessors, (89718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:37,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22056 states to 22056 states and 89718 transitions. [2020-11-11 15:05:37,132 INFO L78 Accepts]: Start accepts. Automaton has 22056 states and 89718 transitions. Word has length 56 [2020-11-11 15:05:37,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:37,132 INFO L481 AbstractCegarLoop]: Abstraction has 22056 states and 89718 transitions. [2020-11-11 15:05:37,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 22056 states and 89718 transitions. [2020-11-11 15:05:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-11 15:05:37,170 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:37,170 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:37,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-11 15:05:37,170 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-11 15:05:37,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:37,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1829365780, now seen corresponding path program 1 times [2020-11-11 15:05:37,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:37,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114012804] [2020-11-11 15:05:37,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:37,429 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-11 15:05:37,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114012804] [2020-11-11 15:05:37,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:37,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-11 15:05:37,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118730885] [2020-11-11 15:05:37,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-11 15:05:37,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:37,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-11 15:05:37,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-11 15:05:37,432 INFO L87 Difference]: Start difference. First operand 22056 states and 89718 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:38,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:38,310 INFO L93 Difference]: Finished difference Result 27461 states and 110651 transitions. [2020-11-11 15:05:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-11 15:05:38,311 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2020-11-11 15:05:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:38,423 INFO L225 Difference]: With dead ends: 27461 [2020-11-11 15:05:38,424 INFO L226 Difference]: Without dead ends: 27092 [2020-11-11 15:05:38,424 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2020-11-11 15:05:38,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27092 states. [2020-11-11 15:05:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27092 to 22050. [2020-11-11 15:05:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22050 states, 22048 states have (on average 4.068759071117562) internal successors, (89708), 22049 states have internal predecessors, (89708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22050 states to 22050 states and 89708 transitions. [2020-11-11 15:05:39,811 INFO L78 Accepts]: Start accepts. Automaton has 22050 states and 89708 transitions. Word has length 58 [2020-11-11 15:05:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:39,824 INFO L481 AbstractCegarLoop]: Abstraction has 22050 states and 89708 transitions. [2020-11-11 15:05:39,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 22050 states and 89708 transitions. [2020-11-11 15:05:39,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-11 15:05:39,877 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:39,877 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:39,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-11 15:05:39,878 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-11 15:05:39,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:39,879 INFO L82 PathProgramCache]: Analyzing trace with hash 826762882, now seen corresponding path program 2 times [2020-11-11 15:05:39,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:39,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055798906] [2020-11-11 15:05:39,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:40,530 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-11 15:05:40,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055798906] [2020-11-11 15:05:40,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:40,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-11 15:05:40,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088135981] [2020-11-11 15:05:40,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-11 15:05:40,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:40,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-11 15:05:40,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-11-11 15:05:40,533 INFO L87 Difference]: Start difference. First operand 22050 states and 89708 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:41,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:41,826 INFO L93 Difference]: Finished difference Result 27475 states and 110709 transitions. [2020-11-11 15:05:41,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-11 15:05:41,827 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2020-11-11 15:05:41,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:41,927 INFO L225 Difference]: With dead ends: 27475 [2020-11-11 15:05:41,927 INFO L226 Difference]: Without dead ends: 27106 [2020-11-11 15:05:41,928 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2020-11-11 15:05:42,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27106 states. [2020-11-11 15:05:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27106 to 22080. [2020-11-11 15:05:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22080 states, 22078 states have (on average 4.067397409185615) internal successors, (89800), 22079 states have internal predecessors, (89800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22080 states to 22080 states and 89800 transitions. [2020-11-11 15:05:43,366 INFO L78 Accepts]: Start accepts. Automaton has 22080 states and 89800 transitions. Word has length 58 [2020-11-11 15:05:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:43,367 INFO L481 AbstractCegarLoop]: Abstraction has 22080 states and 89800 transitions. [2020-11-11 15:05:43,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 22080 states and 89800 transitions. [2020-11-11 15:05:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-11 15:05:43,402 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:43,402 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:43,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-11 15:05:43,402 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-11 15:05:43,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:43,403 INFO L82 PathProgramCache]: Analyzing trace with hash -679826780, now seen corresponding path program 3 times [2020-11-11 15:05:43,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:43,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864179710] [2020-11-11 15:05:43,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:43,830 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-11 15:05:43,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864179710] [2020-11-11 15:05:43,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:43,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-11 15:05:43,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848174287] [2020-11-11 15:05:43,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-11 15:05:43,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:43,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-11 15:05:43,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-11-11 15:05:43,832 INFO L87 Difference]: Start difference. First operand 22080 states and 89800 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:45,530 INFO L93 Difference]: Finished difference Result 28683 states and 115190 transitions. [2020-11-11 15:05:45,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-11 15:05:45,531 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2020-11-11 15:05:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:45,639 INFO L225 Difference]: With dead ends: 28683 [2020-11-11 15:05:45,640 INFO L226 Difference]: Without dead ends: 28314 [2020-11-11 15:05:45,640 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2020-11-11 15:05:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28314 states. [2020-11-11 15:05:46,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28314 to 21711. [2020-11-11 15:05:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21711 states, 21709 states have (on average 4.080703855543784) internal successors, (88588), 21710 states have internal predecessors, (88588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21711 states to 21711 states and 88588 transitions. [2020-11-11 15:05:46,945 INFO L78 Accepts]: Start accepts. Automaton has 21711 states and 88588 transitions. Word has length 58 [2020-11-11 15:05:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:46,945 INFO L481 AbstractCegarLoop]: Abstraction has 21711 states and 88588 transitions. [2020-11-11 15:05:46,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 21711 states and 88588 transitions. [2020-11-11 15:05:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-11 15:05:46,983 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:46,983 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:46,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-11 15:05:46,984 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-11 15:05:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:46,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1736723054, now seen corresponding path program 1 times [2020-11-11 15:05:46,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:46,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610224773] [2020-11-11 15:05:46,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:47,546 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-11 15:05:47,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610224773] [2020-11-11 15:05:47,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:47,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-11 15:05:47,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340857852] [2020-11-11 15:05:47,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-11 15:05:47,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:47,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-11 15:05:47,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-11-11 15:05:47,550 INFO L87 Difference]: Start difference. First operand 21711 states and 88588 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:49,646 INFO L93 Difference]: Finished difference Result 35537 states and 143499 transitions. [2020-11-11 15:05:49,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-11 15:05:49,647 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2020-11-11 15:05:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:49,788 INFO L225 Difference]: With dead ends: 35537 [2020-11-11 15:05:49,788 INFO L226 Difference]: Without dead ends: 33710 [2020-11-11 15:05:49,789 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2020-11-11 15:05:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33710 states. [2020-11-11 15:05:50,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33710 to 21725. [2020-11-11 15:05:50,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21725 states, 21723 states have (on average 4.139437462597247) internal successors, (89921), 21724 states have internal predecessors, (89921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21725 states to 21725 states and 89921 transitions. [2020-11-11 15:05:51,028 INFO L78 Accepts]: Start accepts. Automaton has 21725 states and 89921 transitions. Word has length 58 [2020-11-11 15:05:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:51,028 INFO L481 AbstractCegarLoop]: Abstraction has 21725 states and 89921 transitions. [2020-11-11 15:05:51,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 21725 states and 89921 transitions. [2020-11-11 15:05:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-11 15:05:51,084 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:51,084 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:51,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-11 15:05:51,085 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-11 15:05:51,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:51,085 INFO L82 PathProgramCache]: Analyzing trace with hash 771446734, now seen corresponding path program 1 times [2020-11-11 15:05:51,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:51,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040007639] [2020-11-11 15:05:51,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:51,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-11 15:05:51,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040007639] [2020-11-11 15:05:51,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:51,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-11 15:05:51,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100425074] [2020-11-11 15:05:51,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-11 15:05:51,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:51,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-11 15:05:51,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-11 15:05:51,145 INFO L87 Difference]: Start difference. First operand 21725 states and 89921 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:51,459 INFO L93 Difference]: Finished difference Result 24738 states and 100252 transitions. [2020-11-11 15:05:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-11 15:05:51,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2020-11-11 15:05:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:51,544 INFO L225 Difference]: With dead ends: 24738 [2020-11-11 15:05:51,544 INFO L226 Difference]: Without dead ends: 24018 [2020-11-11 15:05:51,544 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11 15:05:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24018 states. [2020-11-11 15:05:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24018 to 23598. [2020-11-11 15:05:52,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23598 states, 23596 states have (on average 4.096245126292592) internal successors, (96655), 23597 states have internal predecessors, (96655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23598 states to 23598 states and 96655 transitions. [2020-11-11 15:05:52,253 INFO L78 Accepts]: Start accepts. Automaton has 23598 states and 96655 transitions. Word has length 59 [2020-11-11 15:05:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:52,254 INFO L481 AbstractCegarLoop]: Abstraction has 23598 states and 96655 transitions. [2020-11-11 15:05:52,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 23598 states and 96655 transitions. [2020-11-11 15:05:52,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-11 15:05:52,303 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:52,303 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:52,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-11 15:05:52,303 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-11 15:05:52,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:52,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2053411724, now seen corresponding path program 2 times [2020-11-11 15:05:52,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:52,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126995868] [2020-11-11 15:05:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:52,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-11 15:05:52,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126995868] [2020-11-11 15:05:52,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:52,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-11 15:05:52,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138759216] [2020-11-11 15:05:52,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-11 15:05:52,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:52,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-11 15:05:52,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-11 15:05:52,834 INFO L87 Difference]: Start difference. First operand 23598 states and 96655 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:53,456 INFO L93 Difference]: Finished difference Result 26590 states and 106954 transitions. [2020-11-11 15:05:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-11 15:05:53,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2020-11-11 15:05:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:53,559 INFO L225 Difference]: With dead ends: 26590 [2020-11-11 15:05:53,559 INFO L226 Difference]: Without dead ends: 25870 [2020-11-11 15:05:53,560 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-11-11 15:05:53,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25870 states. [2020-11-11 15:05:54,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25870 to 23577. [2020-11-11 15:05:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23577 states, 23575 states have (on average 4.098536585365854) internal successors, (96623), 23576 states have internal predecessors, (96623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:54,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23577 states to 23577 states and 96623 transitions. [2020-11-11 15:05:54,293 INFO L78 Accepts]: Start accepts. Automaton has 23577 states and 96623 transitions. Word has length 59 [2020-11-11 15:05:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:54,294 INFO L481 AbstractCegarLoop]: Abstraction has 23577 states and 96623 transitions. [2020-11-11 15:05:54,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 23577 states and 96623 transitions. [2020-11-11 15:05:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-11 15:05:54,339 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:54,339 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:54,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-11 15:05:54,340 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-11 15:05:54,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:54,340 INFO L82 PathProgramCache]: Analyzing trace with hash 333976884, now seen corresponding path program 3 times [2020-11-11 15:05:54,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:54,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677164889] [2020-11-11 15:05:54,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:54,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-11 15:05:54,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677164889] [2020-11-11 15:05:54,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:54,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-11 15:05:54,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512809898] [2020-11-11 15:05:54,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-11 15:05:54,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:54,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-11 15:05:54,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-11 15:05:54,508 INFO L87 Difference]: Start difference. First operand 23577 states and 96623 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:55,216 INFO L93 Difference]: Finished difference Result 26564 states and 106913 transitions. [2020-11-11 15:05:55,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 15:05:55,217 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2020-11-11 15:05:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:55,846 INFO L225 Difference]: With dead ends: 26564 [2020-11-11 15:05:55,846 INFO L226 Difference]: Without dead ends: 25844 [2020-11-11 15:05:55,847 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2020-11-11 15:05:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25844 states. [2020-11-11 15:05:56,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25844 to 23572. [2020-11-11 15:05:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23572 states, 23570 states have (on average 4.099024183283835) internal successors, (96614), 23571 states have internal predecessors, (96614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23572 states to 23572 states and 96614 transitions. [2020-11-11 15:05:56,571 INFO L78 Accepts]: Start accepts. Automaton has 23572 states and 96614 transitions. Word has length 59 [2020-11-11 15:05:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:56,571 INFO L481 AbstractCegarLoop]: Abstraction has 23572 states and 96614 transitions. [2020-11-11 15:05:56,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 23572 states and 96614 transitions. [2020-11-11 15:05:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-11 15:05:56,612 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:56,612 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:56,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-11 15:05:56,613 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-11 15:05:56,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:56,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1006381050, now seen corresponding path program 4 times [2020-11-11 15:05:56,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:56,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101075400] [2020-11-11 15:05:56,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:56,813 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-11 15:05:56,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101075400] [2020-11-11 15:05:56,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:56,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-11 15:05:56,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194601970] [2020-11-11 15:05:56,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-11 15:05:56,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:56,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-11 15:05:56,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-11 15:05:56,814 INFO L87 Difference]: Start difference. First operand 23572 states and 96614 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:05:57,740 INFO L93 Difference]: Finished difference Result 26543 states and 106870 transitions. [2020-11-11 15:05:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-11 15:05:57,741 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2020-11-11 15:05:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:05:57,840 INFO L225 Difference]: With dead ends: 26543 [2020-11-11 15:05:57,841 INFO L226 Difference]: Without dead ends: 25823 [2020-11-11 15:05:57,841 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2020-11-11 15:05:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25823 states. [2020-11-11 15:05:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25823 to 23562. [2020-11-11 15:05:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23562 states, 23560 states have (on average 4.0997453310696095) internal successors, (96590), 23561 states have internal predecessors, (96590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23562 states to 23562 states and 96590 transitions. [2020-11-11 15:05:58,961 INFO L78 Accepts]: Start accepts. Automaton has 23562 states and 96590 transitions. Word has length 59 [2020-11-11 15:05:58,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:05:58,962 INFO L481 AbstractCegarLoop]: Abstraction has 23562 states and 96590 transitions. [2020-11-11 15:05:58,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:05:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 23562 states and 96590 transitions. [2020-11-11 15:05:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-11 15:05:59,018 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:05:59,018 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:05:59,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-11 15:05:59,018 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-11 15:05:59,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:05:59,019 INFO L82 PathProgramCache]: Analyzing trace with hash -253661634, now seen corresponding path program 5 times [2020-11-11 15:05:59,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:05:59,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554229416] [2020-11-11 15:05:59,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:05:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:05:59,599 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-11 15:05:59,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554229416] [2020-11-11 15:05:59,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:05:59,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-11 15:05:59,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262399974] [2020-11-11 15:05:59,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-11 15:05:59,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:05:59,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-11 15:05:59,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2020-11-11 15:05:59,602 INFO L87 Difference]: Start difference. First operand 23562 states and 96590 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:06:01,465 INFO L93 Difference]: Finished difference Result 39649 states and 159800 transitions. [2020-11-11 15:06:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-11 15:06:01,466 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2020-11-11 15:06:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:06:01,600 INFO L225 Difference]: With dead ends: 39649 [2020-11-11 15:06:01,600 INFO L226 Difference]: Without dead ends: 37489 [2020-11-11 15:06:01,601 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2020-11-11 15:06:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37489 states. [2020-11-11 15:06:02,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37489 to 26346. [2020-11-11 15:06:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26346 states, 26344 states have (on average 4.165426662617674) internal successors, (109734), 26345 states have internal predecessors, (109734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26346 states to 26346 states and 109734 transitions. [2020-11-11 15:06:02,982 INFO L78 Accepts]: Start accepts. Automaton has 26346 states and 109734 transitions. Word has length 59 [2020-11-11 15:06:02,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:06:02,983 INFO L481 AbstractCegarLoop]: Abstraction has 26346 states and 109734 transitions. [2020-11-11 15:06:02,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 26346 states and 109734 transitions. [2020-11-11 15:06:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-11 15:06:03,029 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:06:03,029 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:06:03,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-11 15:06:03,029 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-11 15:06:03,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:06:03,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1910647064, now seen corresponding path program 6 times [2020-11-11 15:06:03,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:06:03,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688790190] [2020-11-11 15:06:03,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:06:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:06:03,357 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-11 15:06:03,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688790190] [2020-11-11 15:06:03,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:06:03,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-11 15:06:03,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067333710] [2020-11-11 15:06:03,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-11 15:06:03,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:06:03,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-11 15:06:03,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-11-11 15:06:03,359 INFO L87 Difference]: Start difference. First operand 26346 states and 109734 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:06:05,287 INFO L93 Difference]: Finished difference Result 32166 states and 129866 transitions. [2020-11-11 15:06:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-11 15:06:05,288 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2020-11-11 15:06:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:06:05,437 INFO L225 Difference]: With dead ends: 32166 [2020-11-11 15:06:05,437 INFO L226 Difference]: Without dead ends: 31446 [2020-11-11 15:06:05,438 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2020-11-11 15:06:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31446 states. [2020-11-11 15:06:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31446 to 25526. [2020-11-11 15:06:06,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25526 states, 25524 states have (on average 4.168625607271587) internal successors, (106400), 25525 states have internal predecessors, (106400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25526 states to 25526 states and 106400 transitions. [2020-11-11 15:06:06,293 INFO L78 Accepts]: Start accepts. Automaton has 25526 states and 106400 transitions. Word has length 59 [2020-11-11 15:06:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:06:06,294 INFO L481 AbstractCegarLoop]: Abstraction has 25526 states and 106400 transitions. [2020-11-11 15:06:06,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 25526 states and 106400 transitions. [2020-11-11 15:06:06,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-11 15:06:06,351 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:06:06,351 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:06:06,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-11 15:06:06,351 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-11 15:06:06,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:06:06,352 INFO L82 PathProgramCache]: Analyzing trace with hash 213734061, now seen corresponding path program 1 times [2020-11-11 15:06:06,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:06:06,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443343851] [2020-11-11 15:06:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:06:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:06:06,929 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-11 15:06:06,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443343851] [2020-11-11 15:06:06,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:06:06,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-11 15:06:06,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635760665] [2020-11-11 15:06:06,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-11 15:06:06,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:06:06,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-11 15:06:06,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-11-11 15:06:06,932 INFO L87 Difference]: Start difference. First operand 25526 states and 106400 transitions. Second operand has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:06:09,358 INFO L93 Difference]: Finished difference Result 27116 states and 111426 transitions. [2020-11-11 15:06:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-11 15:06:09,359 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2020-11-11 15:06:09,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:06:09,461 INFO L225 Difference]: With dead ends: 27116 [2020-11-11 15:06:09,462 INFO L226 Difference]: Without dead ends: 26063 [2020-11-11 15:06:09,462 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2020-11-11 15:06:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26063 states. [2020-11-11 15:06:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26063 to 17633. [2020-11-11 15:06:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17633 states, 17631 states have (on average 4.113890306845897) internal successors, (72532), 17632 states have internal predecessors, (72532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17633 states to 17633 states and 72532 transitions. [2020-11-11 15:06:10,090 INFO L78 Accepts]: Start accepts. Automaton has 17633 states and 72532 transitions. Word has length 60 [2020-11-11 15:06:10,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:06:10,090 INFO L481 AbstractCegarLoop]: Abstraction has 17633 states and 72532 transitions. [2020-11-11 15:06:10,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 19 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 17633 states and 72532 transitions. [2020-11-11 15:06:10,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-11 15:06:10,131 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:06:10,131 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:06:10,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-11 15:06:10,132 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-11 15:06:10,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:06:10,132 INFO L82 PathProgramCache]: Analyzing trace with hash 365958357, now seen corresponding path program 1 times [2020-11-11 15:06:10,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:06:10,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304720341] [2020-11-11 15:06:10,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:06:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:06:10,444 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-11 15:06:10,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304720341] [2020-11-11 15:06:10,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:06:10,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-11 15:06:10,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421785014] [2020-11-11 15:06:10,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-11 15:06:10,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:06:10,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-11 15:06:10,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-11 15:06:10,446 INFO L87 Difference]: Start difference. First operand 17633 states and 72532 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:06:11,435 INFO L93 Difference]: Finished difference Result 21589 states and 86415 transitions. [2020-11-11 15:06:11,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-11 15:06:11,436 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2020-11-11 15:06:11,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:06:11,513 INFO L225 Difference]: With dead ends: 21589 [2020-11-11 15:06:11,513 INFO L226 Difference]: Without dead ends: 21301 [2020-11-11 15:06:11,514 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2020-11-11 15:06:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21301 states. [2020-11-11 15:06:12,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21301 to 17627. [2020-11-11 15:06:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17627 states, 17625 states have (on average 4.11472340425532) internal successors, (72522), 17626 states have internal predecessors, (72522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 72522 transitions. [2020-11-11 15:06:12,494 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 72522 transitions. Word has length 61 [2020-11-11 15:06:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:06:12,494 INFO L481 AbstractCegarLoop]: Abstraction has 17627 states and 72522 transitions. [2020-11-11 15:06:12,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 72522 transitions. [2020-11-11 15:06:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-11 15:06:12,532 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:06:12,532 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:06:12,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-11 15:06:12,532 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-11 15:06:12,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:06:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash -974399577, now seen corresponding path program 2 times [2020-11-11 15:06:12,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:06:12,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126853924] [2020-11-11 15:06:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:06:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:06:12,901 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-11 15:06:12,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126853924] [2020-11-11 15:06:12,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:06:12,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-11 15:06:12,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861743909] [2020-11-11 15:06:12,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-11 15:06:12,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:06:12,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-11 15:06:12,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-11-11 15:06:12,903 INFO L87 Difference]: Start difference. First operand 17627 states and 72522 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:06:14,360 INFO L93 Difference]: Finished difference Result 21603 states and 86473 transitions. [2020-11-11 15:06:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-11 15:06:14,361 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2020-11-11 15:06:14,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:06:14,447 INFO L225 Difference]: With dead ends: 21603 [2020-11-11 15:06:14,447 INFO L226 Difference]: Without dead ends: 21315 [2020-11-11 15:06:14,447 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2020-11-11 15:06:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21315 states. [2020-11-11 15:06:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21315 to 17657. [2020-11-11 15:06:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17657 states, 17655 states have (on average 4.112942509204191) internal successors, (72614), 17656 states have internal predecessors, (72614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17657 states to 17657 states and 72614 transitions. [2020-11-11 15:06:15,390 INFO L78 Accepts]: Start accepts. Automaton has 17657 states and 72614 transitions. Word has length 61 [2020-11-11 15:06:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:06:15,390 INFO L481 AbstractCegarLoop]: Abstraction has 17657 states and 72614 transitions. [2020-11-11 15:06:15,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 17657 states and 72614 transitions. [2020-11-11 15:06:15,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-11 15:06:15,431 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:06:15,431 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:06:15,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-11 15:06:15,431 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-11 15:06:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:06:15,431 INFO L82 PathProgramCache]: Analyzing trace with hash -221680161, now seen corresponding path program 3 times [2020-11-11 15:06:15,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:06:15,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127909903] [2020-11-11 15:06:15,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:06:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:06:15,999 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-11 15:06:16,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127909903] [2020-11-11 15:06:16,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:06:16,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-11 15:06:16,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201587947] [2020-11-11 15:06:16,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-11 15:06:16,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:06:16,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-11 15:06:16,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2020-11-11 15:06:16,003 INFO L87 Difference]: Start difference. First operand 17657 states and 72614 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:06:17,815 INFO L93 Difference]: Finished difference Result 21845 states and 87531 transitions. [2020-11-11 15:06:17,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-11 15:06:17,815 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2020-11-11 15:06:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:06:17,887 INFO L225 Difference]: With dead ends: 21845 [2020-11-11 15:06:17,887 INFO L226 Difference]: Without dead ends: 20117 [2020-11-11 15:06:17,888 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=325, Invalid=1007, Unknown=0, NotChecked=0, Total=1332 [2020-11-11 15:06:17,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20117 states. [2020-11-11 15:06:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20117 to 13433. [2020-11-11 15:06:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13433 states, 13431 states have (on average 3.9578586851314124) internal successors, (53158), 13432 states have internal predecessors, (53158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13433 states to 13433 states and 53158 transitions. [2020-11-11 15:06:18,356 INFO L78 Accepts]: Start accepts. Automaton has 13433 states and 53158 transitions. Word has length 61 [2020-11-11 15:06:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:06:18,356 INFO L481 AbstractCegarLoop]: Abstraction has 13433 states and 53158 transitions. [2020-11-11 15:06:18,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 13433 states and 53158 transitions. [2020-11-11 15:06:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-11 15:06:18,387 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:06:18,387 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-11 15:06:18,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-11 15:06:18,387 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-11 15:06:18,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:06:18,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1942628537, now seen corresponding path program 4 times [2020-11-11 15:06:18,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:06:18,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084064403] [2020-11-11 15:06:18,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:06:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:06:19,325 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-11 15:06:19,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084064403] [2020-11-11 15:06:19,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:06:19,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-11 15:06:19,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156995625] [2020-11-11 15:06:19,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-11 15:06:19,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:06:19,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-11 15:06:19,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-11-11 15:06:19,328 INFO L87 Difference]: Start difference. First operand 13433 states and 53158 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:06:21,637 INFO L93 Difference]: Finished difference Result 11285 states and 43755 transitions. [2020-11-11 15:06:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-11-11 15:06:21,638 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2020-11-11 15:06:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:06:21,672 INFO L225 Difference]: With dead ends: 11285 [2020-11-11 15:06:21,672 INFO L226 Difference]: Without dead ends: 10709 [2020-11-11 15:06:21,673 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=549, Invalid=1613, Unknown=0, NotChecked=0, Total=2162 [2020-11-11 15:06:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10709 states. [2020-11-11 15:06:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10709 to 6920. [2020-11-11 15:06:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6920 states, 6919 states have (on average 4.0932215638097995) internal successors, (28321), 6919 states have internal predecessors, (28321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6920 states to 6920 states and 28321 transitions. [2020-11-11 15:06:21,923 INFO L78 Accepts]: Start accepts. Automaton has 6920 states and 28321 transitions. Word has length 61 [2020-11-11 15:06:21,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:06:21,923 INFO L481 AbstractCegarLoop]: Abstraction has 6920 states and 28321 transitions. [2020-11-11 15:06:21,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 6920 states and 28321 transitions. [2020-11-11 15:06:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-11 15:06:21,943 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:06:21,943 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 15:06:21,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-11 15:06:21,943 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-11 15:06:21,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:06:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1934926665, now seen corresponding path program 1 times [2020-11-11 15:06:21,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:06:21,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184416408] [2020-11-11 15:06:21,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:06:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:06:22,087 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-11 15:06:22,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184416408] [2020-11-11 15:06:22,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:06:22,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-11 15:06:22,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903789243] [2020-11-11 15:06:22,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-11 15:06:22,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:06:22,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-11 15:06:22,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-11 15:06:22,090 INFO L87 Difference]: Start difference. First operand 6920 states and 28321 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:06:22,432 INFO L93 Difference]: Finished difference Result 6920 states and 28315 transitions. [2020-11-11 15:06:22,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 15:06:22,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2020-11-11 15:06:22,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:06:22,457 INFO L225 Difference]: With dead ends: 6920 [2020-11-11 15:06:22,457 INFO L226 Difference]: Without dead ends: 6875 [2020-11-11 15:06:22,457 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-11-11 15:06:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6875 states. [2020-11-11 15:06:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6875 to 6875. [2020-11-11 15:06:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6875 states, 6874 states have (on average 4.09208612161769) internal successors, (28129), 6874 states have internal predecessors, (28129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 28129 transitions. [2020-11-11 15:06:22,648 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 28129 transitions. Word has length 94 [2020-11-11 15:06:22,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:06:22,648 INFO L481 AbstractCegarLoop]: Abstraction has 6875 states and 28129 transitions. [2020-11-11 15:06:22,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 28129 transitions. [2020-11-11 15:06:22,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-11 15:06:22,666 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:06:22,667 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 15:06:22,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-11 15:06:22,667 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-11 15:06:22,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:06:22,667 INFO L82 PathProgramCache]: Analyzing trace with hash 996663287, now seen corresponding path program 1 times [2020-11-11 15:06:22,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:06:22,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316450019] [2020-11-11 15:06:22,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:06:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:06:22,831 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-11 15:06:22,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316450019] [2020-11-11 15:06:22,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:06:22,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-11 15:06:22,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006156890] [2020-11-11 15:06:22,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-11 15:06:22,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:06:22,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-11 15:06:22,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-11 15:06:22,834 INFO L87 Difference]: Start difference. First operand 6875 states and 28129 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:06:23,390 INFO L93 Difference]: Finished difference Result 6875 states and 28123 transitions. [2020-11-11 15:06:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 15:06:23,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2020-11-11 15:06:23,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:06:23,422 INFO L225 Difference]: With dead ends: 6875 [2020-11-11 15:06:23,423 INFO L226 Difference]: Without dead ends: 6677 [2020-11-11 15:06:23,423 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-11-11 15:06:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6677 states. [2020-11-11 15:06:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6677 to 6677. [2020-11-11 15:06:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6677 states, 6676 states have (on average 4.090323547034152) internal successors, (27307), 6676 states have internal predecessors, (27307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6677 states to 6677 states and 27307 transitions. [2020-11-11 15:06:23,704 INFO L78 Accepts]: Start accepts. Automaton has 6677 states and 27307 transitions. Word has length 94 [2020-11-11 15:06:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:06:23,705 INFO L481 AbstractCegarLoop]: Abstraction has 6677 states and 27307 transitions. [2020-11-11 15:06:23,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6677 states and 27307 transitions. [2020-11-11 15:06:23,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-11 15:06:23,722 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:06:23,723 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 15:06:23,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-11 15:06:23,723 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-11 15:06:23,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:06:23,723 INFO L82 PathProgramCache]: Analyzing trace with hash 722347041, now seen corresponding path program 1 times [2020-11-11 15:06:23,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:06:23,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842087743] [2020-11-11 15:06:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:06:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:06:23,892 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-11 15:06:23,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842087743] [2020-11-11 15:06:23,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:06:23,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-11 15:06:23,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673369839] [2020-11-11 15:06:23,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-11 15:06:23,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:06:23,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-11 15:06:23,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-11 15:06:23,896 INFO L87 Difference]: Start difference. First operand 6677 states and 27307 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:06:24,276 INFO L93 Difference]: Finished difference Result 6677 states and 27301 transitions. [2020-11-11 15:06:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 15:06:24,277 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2020-11-11 15:06:24,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:06:24,304 INFO L225 Difference]: With dead ends: 6677 [2020-11-11 15:06:24,304 INFO L226 Difference]: Without dead ends: 5705 [2020-11-11 15:06:24,304 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-11-11 15:06:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2020-11-11 15:06:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 5705. [2020-11-11 15:06:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 5704 states have (on average 4.078366058906031) internal successors, (23263), 5704 states have internal predecessors, (23263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 23263 transitions. [2020-11-11 15:06:24,515 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 23263 transitions. Word has length 94 [2020-11-11 15:06:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:06:24,515 INFO L481 AbstractCegarLoop]: Abstraction has 5705 states and 23263 transitions. [2020-11-11 15:06:24,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 23263 transitions. [2020-11-11 15:06:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-11 15:06:24,528 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:06:24,528 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 15:06:24,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-11 15:06:24,528 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-11 15:06:24,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:06:24,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1585114011, now seen corresponding path program 1 times [2020-11-11 15:06:24,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:06:24,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803374446] [2020-11-11 15:06:24,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:06:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:06:24,819 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-11 15:06:24,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803374446] [2020-11-11 15:06:24,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:06:24,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-11 15:06:24,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822160273] [2020-11-11 15:06:24,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-11 15:06:24,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:06:24,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-11 15:06:24,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-11 15:06:24,823 INFO L87 Difference]: Start difference. First operand 5705 states and 23263 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:25,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:06:25,295 INFO L93 Difference]: Finished difference Result 5705 states and 23245 transitions. [2020-11-11 15:06:25,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-11 15:06:25,296 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2020-11-11 15:06:25,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:06:25,317 INFO L225 Difference]: With dead ends: 5705 [2020-11-11 15:06:25,317 INFO L226 Difference]: Without dead ends: 5534 [2020-11-11 15:06:25,318 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2020-11-11 15:06:25,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5534 states. [2020-11-11 15:06:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5534 to 5534. [2020-11-11 15:06:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5534 states, 5533 states have (on average 4.073197180553046) internal successors, (22537), 5533 states have internal predecessors, (22537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5534 states to 5534 states and 22537 transitions. [2020-11-11 15:06:25,473 INFO L78 Accepts]: Start accepts. Automaton has 5534 states and 22537 transitions. Word has length 94 [2020-11-11 15:06:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:06:25,473 INFO L481 AbstractCegarLoop]: Abstraction has 5534 states and 22537 transitions. [2020-11-11 15:06:25,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 5534 states and 22537 transitions. [2020-11-11 15:06:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-11 15:06:25,486 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:06:25,487 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 15:06:25,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-11 15:06:25,487 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-11 15:06:25,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:06:25,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1568032715, now seen corresponding path program 1 times [2020-11-11 15:06:25,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:06:25,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205213860] [2020-11-11 15:06:25,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:06:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 15:06:25,785 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-11 15:06:25,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205213860] [2020-11-11 15:06:25,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 15:06:25,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-11 15:06:25,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003675035] [2020-11-11 15:06:25,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-11 15:06:25,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 15:06:25,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-11 15:06:25,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-11 15:06:25,789 INFO L87 Difference]: Start difference. First operand 5534 states and 22537 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 15:06:26,245 INFO L93 Difference]: Finished difference Result 5534 states and 22519 transitions. [2020-11-11 15:06:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-11 15:06:26,246 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2020-11-11 15:06:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 15:06:26,263 INFO L225 Difference]: With dead ends: 5534 [2020-11-11 15:06:26,263 INFO L226 Difference]: Without dead ends: 4760 [2020-11-11 15:06:26,264 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2020-11-11 15:06:26,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2020-11-11 15:06:26,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 4760. [2020-11-11 15:06:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4760 states, 4759 states have (on average 4.05484345450725) internal successors, (19297), 4759 states have internal predecessors, (19297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 19297 transitions. [2020-11-11 15:06:26,410 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 19297 transitions. Word has length 94 [2020-11-11 15:06:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 15:06:26,410 INFO L481 AbstractCegarLoop]: Abstraction has 4760 states and 19297 transitions. [2020-11-11 15:06:26,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 15:06:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 19297 transitions. [2020-11-11 15:06:26,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-11 15:06:26,423 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 15:06:26,423 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 15:06:26,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-11-11 15:06:26,424 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-11 15:06:26,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 15:06:26,424 INFO L82 PathProgramCache]: Analyzing trace with hash 199541557, now seen corresponding path program 1 times [2020-11-11 15:06:26,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 15:06:26,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533193499] [2020-11-11 15:06:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 15:06:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 15:06:26,450 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 15:06:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 15:06:26,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 15:06:26,543 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-11 15:06:26,543 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-11 15:06:26,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-11-11 15:06:26,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 03:06:26 BasicIcfg [2020-11-11 15:06:26,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-11 15:06:26,885 INFO L168 Benchmark]: Toolchain (without parser) took 174622.66 ms. Allocated memory was 302.0 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 270.4 MB in the beginning and 13.7 GB in the end (delta: -13.5 GB). Peak memory consumption was 2.8 GB. Max. memory is 16.0 GB. [2020-11-11 15:06:26,885 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 302.0 MB. Free memory was 272.5 MB in the beginning and 272.4 MB in the end (delta: 139.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2020-11-11 15:06:26,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1284.01 ms. Allocated memory is still 302.0 MB. Free memory was 269.9 MB in the beginning and 224.1 MB in the end (delta: 45.8 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.0 GB. [2020-11-11 15:06:26,887 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.14 ms. Allocated memory is still 302.0 MB. Free memory was 223.1 MB in the beginning and 221.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-11 15:06:26,889 INFO L168 Benchmark]: Boogie Preprocessor took 39.84 ms. Allocated memory is still 302.0 MB. Free memory was 221.0 MB in the beginning and 219.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2020-11-11 15:06:26,890 INFO L168 Benchmark]: RCFGBuilder took 731.38 ms. Allocated memory is still 302.0 MB. Free memory was 219.9 MB in the beginning and 190.5 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. [2020-11-11 15:06:26,890 INFO L168 Benchmark]: TraceAbstraction took 172439.58 ms. Allocated memory was 302.0 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 190.5 MB in the beginning and 13.7 GB in the end (delta: -13.5 GB). Peak memory consumption was 2.8 GB. Max. memory is 16.0 GB. [2020-11-11 15:06:26,893 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.29 ms. Allocated memory is still 302.0 MB. Free memory was 272.5 MB in the beginning and 272.4 MB in the end (delta: 139.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1284.01 ms. Allocated memory is still 302.0 MB. Free memory was 269.9 MB in the beginning and 224.1 MB in the end (delta: 45.8 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 111.14 ms. Allocated memory is still 302.0 MB. Free memory was 223.1 MB in the beginning and 221.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 39.84 ms. Allocated memory is still 302.0 MB. Free memory was 221.0 MB in the beginning and 219.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 731.38 ms. Allocated memory is still 302.0 MB. Free memory was 219.9 MB in the beginning and 190.5 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 172439.58 ms. Allocated memory was 302.0 MB in the beginning and 15.9 GB in the end (delta: 15.6 GB). Free memory was 190.5 MB in the beginning and 13.7 GB in the end (delta: -13.5 GB). Peak memory consumption was 2.8 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [v={0:0}] [L1153] 0 pthread_t t; VAL [v={0:0}] [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}, arg={0:0}, v={0:0}] [L1138] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={0:0}] [L1139] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={0:0}] [L1140] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={0:0}] [L1119] 2 v = malloc(sizeof(char)) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1120] 2 return 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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1: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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6: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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1125] 3 v[0] = 'X' 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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1127] 3 return 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}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1142] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1: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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6: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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1125] 6 v[0] = 'X' 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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1127] 6 return 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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6: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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1125] 5 v[0] = 'X' 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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1127] 5 return 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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6: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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6: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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1132] 4 v[0] = 'Y' VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1134] 4 return 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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1: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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6: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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6: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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6: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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6: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={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1149] 1 return 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}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1149] 1 return 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}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1149] 1 return 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}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1149] 1 return 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}, t4={14:0}, t5={6:0}, v={-1:0}] [L1149] 1 return 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}, t5={6:0}, v={-1:0}] [L1149] 1 return 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}] [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] 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}] [L1115] COND TRUE 0 !expression 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}] [L12] COND FALSE 0 !(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}] [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: 171.5s, OverallIterations: 49, TraceHistogramMax: 1, AutomataDifference: 74.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 9531 SDtfs, 20410 SDslu, 38266 SDs, 0 SdLazy, 16928 SolverSat, 2351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1058 GetRequests, 146 SyntacticMatches, 6 SemanticMatches, 906 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3100 ImplicationChecksByTransitivity, 25.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56417occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 69.9s AutomataMinimizationTime, 48 MinimizatonAttempts, 328462 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 2888 NumberOfCodeBlocks, 2888 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2746 ConstructedInterpolants, 0 QuantifiedInterpolants, 1268468 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...