/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-New_States.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-12 09:35:13,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-12 09:35:13,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-12 09:35:13,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-12 09:35:13,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-12 09:35:13,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-12 09:35:13,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-12 09:35:13,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-12 09:35:13,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-12 09:35:13,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-12 09:35:13,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-12 09:35:13,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-12 09:35:13,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-12 09:35:13,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-12 09:35:13,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-12 09:35:13,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-12 09:35:13,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-12 09:35:13,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-12 09:35:13,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-12 09:35:13,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-12 09:35:13,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-12 09:35:13,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-12 09:35:13,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-12 09:35:13,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-12 09:35:13,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-12 09:35:13,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-12 09:35:13,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-12 09:35:13,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-12 09:35:13,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-12 09:35:13,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-12 09:35:13,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-12 09:35:13,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-12 09:35:13,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-12 09:35:13,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-12 09:35:13,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-12 09:35:13,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-12 09:35:13,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-12 09:35:13,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-12 09:35:13,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-12 09:35:13,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-12 09:35:13,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-12 09:35:13,694 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-New_States.epf [2020-11-12 09:35:13,748 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-12 09:35:13,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-12 09:35:13,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-12 09:35:13,754 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-12 09:35:13,754 INFO L138 SettingsManager]: * Use SBE=true [2020-11-12 09:35:13,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-12 09:35:13,754 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-12 09:35:13,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-12 09:35:13,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-12 09:35:13,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-12 09:35:13,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-12 09:35:13,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-12 09:35:13,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-12 09:35:13,757 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-12 09:35:13,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-12 09:35:13,758 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-12 09:35:13,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-12 09:35:13,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-12 09:35:13,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-12 09:35:13,758 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-12 09:35:13,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-12 09:35:13,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-12 09:35:13,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-12 09:35:13,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-12 09:35:13,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-12 09:35:13,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-12 09:35:13,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-12 09:35:13,760 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-11-12 09:35:13,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-12 09:35:13,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-12 09:35:13,761 INFO L138 SettingsManager]: * Sleep set reduction in concurrent analysis=NEW_STATES 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-12 09:35:14,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-12 09:35:14,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-12 09:35:14,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-12 09:35:14,225 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-12 09:35:14,226 INFO L275 PluginConnector]: CDTParser initialized [2020-11-12 09:35:14,227 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-11-12 09:35:14,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec48b1951/fdae6b3f37b84d0ab2f6ff18010c28c8/FLAGb0f49a989 [2020-11-12 09:35:15,087 INFO L306 CDTParser]: Found 1 translation units. [2020-11-12 09:35:15,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2020-11-12 09:35:15,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec48b1951/fdae6b3f37b84d0ab2f6ff18010c28c8/FLAGb0f49a989 [2020-11-12 09:35:15,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec48b1951/fdae6b3f37b84d0ab2f6ff18010c28c8 [2020-11-12 09:35:15,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-12 09:35:15,381 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-12 09:35:15,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-12 09:35:15,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-12 09:35:15,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-12 09:35:15,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:35:15" (1/1) ... [2020-11-12 09:35:15,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bbd1d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:35:15, skipping insertion in model container [2020-11-12 09:35:15,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 09:35:15" (1/1) ... [2020-11-12 09:35:15,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-12 09:35:15,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-12 09:35:15,819 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-12 09:35:16,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 09:35:16,197 INFO L203 MainTranslator]: Completed pre-run [2020-11-12 09:35:16,215 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-12 09:35:16,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 09:35:16,491 INFO L208 MainTranslator]: Completed translation [2020-11-12 09:35:16,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:35:16 WrapperNode [2020-11-12 09:35:16,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-12 09:35:16,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-12 09:35:16,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-12 09:35:16,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-12 09:35:16,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:35:16" (1/1) ... [2020-11-12 09:35:16,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:35:16" (1/1) ... [2020-11-12 09:35:16,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-12 09:35:16,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-12 09:35:16,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-12 09:35:16,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-12 09:35:16,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:35:16" (1/1) ... [2020-11-12 09:35:16,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:35:16" (1/1) ... [2020-11-12 09:35:16,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:35:16" (1/1) ... [2020-11-12 09:35:16,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:35:16" (1/1) ... [2020-11-12 09:35:16,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:35:16" (1/1) ... [2020-11-12 09:35:16,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:35:16" (1/1) ... [2020-11-12 09:35:16,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:35:16" (1/1) ... [2020-11-12 09:35:16,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-12 09:35:16,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-12 09:35:16,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-12 09:35:16,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-12 09:35:16,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:35:16" (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-12 09:35:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-12 09:35:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-12 09:35:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-12 09:35:16,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-12 09:35:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-12 09:35:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-11-12 09:35:16,694 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-11-12 09:35:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-11-12 09:35:16,694 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-11-12 09:35:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-11-12 09:35:16,694 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-11-12 09:35:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-11-12 09:35:16,695 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-11-12 09:35:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-12 09:35:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-12 09:35:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-12 09:35:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-12 09:35:16,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-12 09:35:16,697 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-12 09:35:17,140 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-12 09:35:17,141 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-11-12 09:35:17,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:35:17 BoogieIcfgContainer [2020-11-12 09:35:17,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-12 09:35:17,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-12 09:35:17,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-12 09:35:17,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-12 09:35:17,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 09:35:15" (1/3) ... [2020-11-12 09:35:17,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d28047f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 09:35:17, skipping insertion in model container [2020-11-12 09:35:17,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 09:35:16" (2/3) ... [2020-11-12 09:35:17,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d28047f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 09:35:17, skipping insertion in model container [2020-11-12 09:35:17,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 09:35:17" (3/3) ... [2020-11-12 09:35:17,152 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-11-12 09:35:17,168 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-12 09:35:17,168 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-12 09:35:17,172 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-12 09:35:17,174 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-12 09:35:17,215 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,216 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,216 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,216 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,217 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,217 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,217 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,217 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,218 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,218 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,218 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,218 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,219 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,219 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,219 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,219 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,220 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,220 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,220 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,221 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,221 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,221 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,221 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,222 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,222 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,222 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,222 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,223 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,223 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,223 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,223 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,224 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,224 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,224 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,225 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,225 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,225 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,225 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,225 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,226 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,226 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,226 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,227 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,227 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,227 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,227 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,228 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,228 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,228 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,228 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,229 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,229 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,229 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,229 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,230 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,231 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,232 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,233 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,234 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,235 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,237 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,238 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,239 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,240 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,242 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,243 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,244 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,249 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,249 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,251 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,252 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,252 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,252 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,252 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,252 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,253 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,253 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,253 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,253 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,254 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,254 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,258 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,259 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,259 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,259 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,260 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,260 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,260 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,260 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,260 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,260 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,261 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,261 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,261 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,262 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,262 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,262 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,262 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,263 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,263 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,263 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,263 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,264 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,264 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,264 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,264 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,264 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,265 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,265 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,265 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,265 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,266 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,266 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,266 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,266 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,267 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,267 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,267 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,267 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,267 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,268 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,268 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,268 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,269 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,269 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,269 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,269 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,269 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,270 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,270 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,270 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,270 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,270 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,271 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,271 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,271 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,271 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,272 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,272 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,272 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,273 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,273 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,273 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,273 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,273 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,274 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,274 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,274 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,274 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,277 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,277 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,278 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,278 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,283 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,283 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,283 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,283 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,286 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,286 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,286 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,287 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,289 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,289 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,289 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,289 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,290 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,290 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,292 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,293 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,294 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,294 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,294 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,294 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,295 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,295 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,295 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,295 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,295 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,296 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,296 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,296 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,296 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,296 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,297 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,297 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,300 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,301 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,301 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,301 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,303 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,304 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,304 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,304 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,305 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,305 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,307 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,308 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,308 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,308 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,310 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,311 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,311 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,311 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,313 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,313 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,314 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,314 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,316 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,316 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,316 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,317 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 09:35:17,448 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2020-11-12 09:35:17,461 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-11-12 09:35:17,481 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 09:35:17,482 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 09:35:17,482 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 09:35:17,482 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 09:35:17,482 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 09:35:17,482 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 09:35:17,483 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 09:35:17,483 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 09:35:17,502 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 180 places, 252 transitions, 884 flow [2020-11-12 09:35:25,509 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-12 09:35:31,034 WARN L455 BasicCegarLoop]: Sleep Set Reduction Time: 5516ms [2020-11-12 09:35:31,117 WARN L456 BasicCegarLoop]: Sleep set: input automaton 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-12 09:35:31,726 WARN L457 BasicCegarLoop]: Sleep set: output automaton has 281751 states, 259368 states have (on average 1.8140287159557078) internal successors, (470501), 281750 states have internal predecessors, (470501), 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-12 09:35:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 281751 states, 259368 states have (on average 1.8140287159557078) internal successors, (470501), 281750 states have internal predecessors, (470501), 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-12 09:35:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-12 09:35:31,903 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:31,904 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-12 09:35:31,905 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-12 09:35:31,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:31,910 INFO L82 PathProgramCache]: Analyzing trace with hash 504508744, now seen corresponding path program 1 times [2020-11-12 09:35:31,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:31,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39878300] [2020-11-12 09:35:31,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 09:35:32,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39878300] [2020-11-12 09:35:32,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:32,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 09:35:32,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202118833] [2020-11-12 09:35:32,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 09:35:32,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:32,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 09:35:32,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-12 09:35:32,493 INFO L87 Difference]: Start difference. First operand has 281751 states, 259368 states have (on average 1.8140287159557078) internal successors, (470501), 281750 states have internal predecessors, (470501), 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-12 09:35:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:34,958 INFO L93 Difference]: Finished difference Result 183842 states and 317939 transitions. [2020-11-12 09:35:34,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 09:35:34,960 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-12 09:35:34,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:35,437 INFO L225 Difference]: With dead ends: 183842 [2020-11-12 09:35:35,438 INFO L226 Difference]: Without dead ends: 66520 [2020-11-12 09:35:35,439 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-12 09:35:36,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66520 states. [2020-11-12 09:35:37,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66520 to 36610. [2020-11-12 09:35:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36610 states, 35647 states have (on average 1.637052206356776) internal successors, (58356), 36609 states have internal predecessors, (58356), 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-12 09:35:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36610 states to 36610 states and 58356 transitions. [2020-11-12 09:35:37,698 INFO L78 Accepts]: Start accepts. Automaton has 36610 states and 58356 transitions. Word has length 38 [2020-11-12 09:35:37,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:37,698 INFO L481 AbstractCegarLoop]: Abstraction has 36610 states and 58356 transitions. [2020-11-12 09:35:37,699 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-12 09:35:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand 36610 states and 58356 transitions. [2020-11-12 09:35:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-11-12 09:35:37,981 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:37,982 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-12 09:35:37,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-12 09:35:37,982 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-12 09:35:37,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:37,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2105500928, now seen corresponding path program 2 times [2020-11-12 09:35:37,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:37,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745158909] [2020-11-12 09:35:37,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:38,294 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-12 09:35:38,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745158909] [2020-11-12 09:35:38,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:38,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 09:35:38,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692931245] [2020-11-12 09:35:38,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 09:35:38,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:38,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 09:35:38,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-12 09:35:38,299 INFO L87 Difference]: Start difference. First operand 36610 states and 58356 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-12 09:35:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:38,854 INFO L93 Difference]: Finished difference Result 45191 states and 78375 transitions. [2020-11-12 09:35:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-12 09:35:38,855 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-12 09:35:38,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:39,025 INFO L225 Difference]: With dead ends: 45191 [2020-11-12 09:35:39,026 INFO L226 Difference]: Without dead ends: 45181 [2020-11-12 09:35:39,028 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-11-12 09:35:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45181 states. [2020-11-12 09:35:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45181 to 36561. [2020-11-12 09:35:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36561 states, 35601 states have (on average 1.637678716889975) internal successors, (58303), 36560 states have internal predecessors, (58303), 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-12 09:35:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36561 states to 36561 states and 58303 transitions. [2020-11-12 09:35:40,391 INFO L78 Accepts]: Start accepts. Automaton has 36561 states and 58303 transitions. Word has length 38 [2020-11-12 09:35:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:40,392 INFO L481 AbstractCegarLoop]: Abstraction has 36561 states and 58303 transitions. [2020-11-12 09:35:40,393 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-12 09:35:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 36561 states and 58303 transitions. [2020-11-12 09:35:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-12 09:35:40,401 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:40,401 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-12 09:35:40,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-12 09:35:40,401 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-12 09:35:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1930468056, now seen corresponding path program 1 times [2020-11-12 09:35:40,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:40,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938395671] [2020-11-12 09:35:40,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:40,491 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-12 09:35:40,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938395671] [2020-11-12 09:35:40,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:40,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 09:35:40,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880620123] [2020-11-12 09:35:40,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 09:35:40,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:40,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 09:35:40,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-12 09:35:40,494 INFO L87 Difference]: Start difference. First operand 36561 states and 58303 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-12 09:35:40,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:40,791 INFO L93 Difference]: Finished difference Result 44715 states and 75851 transitions. [2020-11-12 09:35:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 09:35:40,792 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-12 09:35:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:40,895 INFO L225 Difference]: With dead ends: 44715 [2020-11-12 09:35:40,895 INFO L226 Difference]: Without dead ends: 44304 [2020-11-12 09:35:40,896 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-12 09:35:41,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44304 states. [2020-11-12 09:35:42,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44304 to 38756. [2020-11-12 09:35:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38756 states, 37796 states have (on average 1.7073499841253044) internal successors, (64531), 38755 states have internal predecessors, (64531), 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-12 09:35:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38756 states to 38756 states and 64531 transitions. [2020-11-12 09:35:42,257 INFO L78 Accepts]: Start accepts. Automaton has 38756 states and 64531 transitions. Word has length 48 [2020-11-12 09:35:42,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:42,257 INFO L481 AbstractCegarLoop]: Abstraction has 38756 states and 64531 transitions. [2020-11-12 09:35:42,257 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-12 09:35:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand 38756 states and 64531 transitions. [2020-11-12 09:35:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-12 09:35:42,263 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:42,263 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-12 09:35:42,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-12 09:35:42,263 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-12 09:35:42,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:42,265 INFO L82 PathProgramCache]: Analyzing trace with hash -567344656, now seen corresponding path program 2 times [2020-11-12 09:35:42,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:42,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391403904] [2020-11-12 09:35:42,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:42,411 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-12 09:35:42,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391403904] [2020-11-12 09:35:42,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:42,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 09:35:42,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964500969] [2020-11-12 09:35:42,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 09:35:42,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:42,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 09:35:42,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 09:35:42,414 INFO L87 Difference]: Start difference. First operand 38756 states and 64531 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-12 09:35:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:42,697 INFO L93 Difference]: Finished difference Result 51819 states and 82223 transitions. [2020-11-12 09:35:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 09:35:42,698 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-12 09:35:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:42,756 INFO L225 Difference]: With dead ends: 51819 [2020-11-12 09:35:42,756 INFO L226 Difference]: Without dead ends: 26790 [2020-11-12 09:35:42,757 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-12 09:35:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26790 states. [2020-11-12 09:35:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26790 to 24502. [2020-11-12 09:35:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24502 states, 23652 states have (on average 1.4442330458312194) internal successors, (34159), 24501 states have internal predecessors, (34159), 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-12 09:35:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24502 states to 24502 states and 34159 transitions. [2020-11-12 09:35:43,288 INFO L78 Accepts]: Start accepts. Automaton has 24502 states and 34159 transitions. Word has length 48 [2020-11-12 09:35:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:43,291 INFO L481 AbstractCegarLoop]: Abstraction has 24502 states and 34159 transitions. [2020-11-12 09:35:43,291 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-12 09:35:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 24502 states and 34159 transitions. [2020-11-12 09:35:43,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-12 09:35:43,298 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:43,298 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-12 09:35:43,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-12 09:35:43,298 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-12 09:35:43,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:43,299 INFO L82 PathProgramCache]: Analyzing trace with hash -140597935, now seen corresponding path program 1 times [2020-11-12 09:35:43,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:43,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012266547] [2020-11-12 09:35:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:43,476 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-12 09:35:43,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012266547] [2020-11-12 09:35:43,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:43,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 09:35:43,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596472127] [2020-11-12 09:35:43,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 09:35:43,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:43,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 09:35:43,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-12 09:35:43,479 INFO L87 Difference]: Start difference. First operand 24502 states and 34159 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-12 09:35:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:44,164 INFO L93 Difference]: Finished difference Result 26413 states and 36744 transitions. [2020-11-12 09:35:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 09:35:44,165 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-12 09:35:44,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:44,203 INFO L225 Difference]: With dead ends: 26413 [2020-11-12 09:35:44,203 INFO L226 Difference]: Without dead ends: 26383 [2020-11-12 09:35:44,204 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-11-12 09:35:44,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26383 states. [2020-11-12 09:35:44,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26383 to 24426. [2020-11-12 09:35:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24426 states, 23579 states have (on average 1.4444208829891005) internal successors, (34058), 24425 states have internal predecessors, (34058), 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-12 09:35:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24426 states to 24426 states and 34058 transitions. [2020-11-12 09:35:44,775 INFO L78 Accepts]: Start accepts. Automaton has 24426 states and 34058 transitions. Word has length 50 [2020-11-12 09:35:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:44,775 INFO L481 AbstractCegarLoop]: Abstraction has 24426 states and 34058 transitions. [2020-11-12 09:35:44,775 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-12 09:35:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 24426 states and 34058 transitions. [2020-11-12 09:35:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-12 09:35:44,784 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:44,784 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-12 09:35:44,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-12 09:35:44,784 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-12 09:35:44,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:44,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1677953536, now seen corresponding path program 1 times [2020-11-12 09:35:44,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:44,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598034649] [2020-11-12 09:35:44,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:44,849 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-12 09:35:44,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598034649] [2020-11-12 09:35:44,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:44,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 09:35:44,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878628196] [2020-11-12 09:35:44,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 09:35:44,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:44,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 09:35:44,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-12 09:35:44,852 INFO L87 Difference]: Start difference. First operand 24426 states and 34058 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-12 09:35:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:45,128 INFO L93 Difference]: Finished difference Result 27276 states and 38282 transitions. [2020-11-12 09:35:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 09:35:45,129 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-12 09:35:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:45,181 INFO L225 Difference]: With dead ends: 27276 [2020-11-12 09:35:45,182 INFO L226 Difference]: Without dead ends: 26059 [2020-11-12 09:35:45,182 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-12 09:35:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26059 states. [2020-11-12 09:35:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26059 to 25187. [2020-11-12 09:35:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25187 states, 24340 states have (on average 1.4542728019720625) internal successors, (35397), 25186 states have internal predecessors, (35397), 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-12 09:35:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25187 states to 25187 states and 35397 transitions. [2020-11-12 09:35:45,976 INFO L78 Accepts]: Start accepts. Automaton has 25187 states and 35397 transitions. Word has length 51 [2020-11-12 09:35:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:45,976 INFO L481 AbstractCegarLoop]: Abstraction has 25187 states and 35397 transitions. [2020-11-12 09:35:45,976 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-12 09:35:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 25187 states and 35397 transitions. [2020-11-12 09:35:45,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-12 09:35:45,985 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:45,985 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-12 09:35:45,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-12 09:35:45,985 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-12 09:35:45,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:45,986 INFO L82 PathProgramCache]: Analyzing trace with hash 582511800, now seen corresponding path program 2 times [2020-11-12 09:35:45,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:45,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191814517] [2020-11-12 09:35:45,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:46,337 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-12 09:35:46,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191814517] [2020-11-12 09:35:46,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:46,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-12 09:35:46,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431748319] [2020-11-12 09:35:46,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-12 09:35:46,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:46,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-12 09:35:46,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-11-12 09:35:46,350 INFO L87 Difference]: Start difference. First operand 25187 states and 35397 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-12 09:35:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:47,271 INFO L93 Difference]: Finished difference Result 45560 states and 65189 transitions. [2020-11-12 09:35:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-12 09:35:47,272 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-12 09:35:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:47,341 INFO L225 Difference]: With dead ends: 45560 [2020-11-12 09:35:47,341 INFO L226 Difference]: Without dead ends: 44236 [2020-11-12 09:35:47,342 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2020-11-12 09:35:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44236 states. [2020-11-12 09:35:47,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44236 to 26486. [2020-11-12 09:35:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26486 states, 25639 states have (on average 1.4880455555988923) internal successors, (38152), 26485 states have internal predecessors, (38152), 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-12 09:35:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26486 states to 26486 states and 38152 transitions. [2020-11-12 09:35:47,959 INFO L78 Accepts]: Start accepts. Automaton has 26486 states and 38152 transitions. Word has length 51 [2020-11-12 09:35:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:47,959 INFO L481 AbstractCegarLoop]: Abstraction has 26486 states and 38152 transitions. [2020-11-12 09:35:47,960 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-12 09:35:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 26486 states and 38152 transitions. [2020-11-12 09:35:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-12 09:35:47,969 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:47,969 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-12 09:35:47,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-12 09:35:47,969 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-12 09:35:47,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:47,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1040311336, now seen corresponding path program 3 times [2020-11-12 09:35:47,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:47,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657432938] [2020-11-12 09:35:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:48,469 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-12 09:35:48,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657432938] [2020-11-12 09:35:48,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:48,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-12 09:35:48,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965710286] [2020-11-12 09:35:48,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 09:35:48,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:48,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 09:35:48,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-12 09:35:48,472 INFO L87 Difference]: Start difference. First operand 26486 states and 38152 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-12 09:35:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:49,076 INFO L93 Difference]: Finished difference Result 27882 states and 42413 transitions. [2020-11-12 09:35:49,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-12 09:35:49,077 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-12 09:35:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:49,109 INFO L225 Difference]: With dead ends: 27882 [2020-11-12 09:35:49,110 INFO L226 Difference]: Without dead ends: 26878 [2020-11-12 09:35:49,110 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-12 09:35:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26878 states. [2020-11-12 09:35:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26878 to 22888. [2020-11-12 09:35:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22888 states, 22130 states have (on average 1.4821509263443289) internal successors, (32800), 22887 states have internal predecessors, (32800), 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-12 09:35:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22888 states to 22888 states and 32800 transitions. [2020-11-12 09:35:49,431 INFO L78 Accepts]: Start accepts. Automaton has 22888 states and 32800 transitions. Word has length 51 [2020-11-12 09:35:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:49,432 INFO L481 AbstractCegarLoop]: Abstraction has 22888 states and 32800 transitions. [2020-11-12 09:35:49,432 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-12 09:35:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 22888 states and 32800 transitions. [2020-11-12 09:35:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-12 09:35:49,444 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:49,444 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-12 09:35:49,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-12 09:35:49,445 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-12 09:35:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash 711966471, now seen corresponding path program 1 times [2020-11-12 09:35:49,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:49,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070403090] [2020-11-12 09:35:49,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:49,677 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-12 09:35:49,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070403090] [2020-11-12 09:35:49,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:49,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-12 09:35:49,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564066952] [2020-11-12 09:35:49,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 09:35:49,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:49,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 09:35:49,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-12 09:35:49,680 INFO L87 Difference]: Start difference. First operand 22888 states and 32800 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-12 09:35:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:50,356 INFO L93 Difference]: Finished difference Result 27536 states and 42381 transitions. [2020-11-12 09:35:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-12 09:35:50,357 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-12 09:35:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:50,395 INFO L225 Difference]: With dead ends: 27536 [2020-11-12 09:35:50,395 INFO L226 Difference]: Without dead ends: 26919 [2020-11-12 09:35:50,396 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-12 09:35:50,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26919 states. [2020-11-12 09:35:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26919 to 22887. [2020-11-12 09:35:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22887 states, 22129 states have (on average 1.4821727145374848) internal successors, (32799), 22886 states have internal predecessors, (32799), 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-12 09:35:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22887 states to 22887 states and 32799 transitions. [2020-11-12 09:35:50,851 INFO L78 Accepts]: Start accepts. Automaton has 22887 states and 32799 transitions. Word has length 53 [2020-11-12 09:35:50,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:50,851 INFO L481 AbstractCegarLoop]: Abstraction has 22887 states and 32799 transitions. [2020-11-12 09:35:50,851 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-12 09:35:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 22887 states and 32799 transitions. [2020-11-12 09:35:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-12 09:35:50,862 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:50,863 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-12 09:35:50,863 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-12 09:35:50,863 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-12 09:35:50,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:50,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2102099914, now seen corresponding path program 1 times [2020-11-12 09:35:50,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:50,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473726228] [2020-11-12 09:35:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:51,043 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-12 09:35:51,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473726228] [2020-11-12 09:35:51,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:51,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-12 09:35:51,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215728450] [2020-11-12 09:35:51,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 09:35:51,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:51,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 09:35:51,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-11-12 09:35:51,047 INFO L87 Difference]: Start difference. First operand 22887 states and 32799 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-12 09:35:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:51,429 INFO L93 Difference]: Finished difference Result 24571 states and 34971 transitions. [2020-11-12 09:35:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-12 09:35:51,430 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-12 09:35:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:51,464 INFO L225 Difference]: With dead ends: 24571 [2020-11-12 09:35:51,464 INFO L226 Difference]: Without dead ends: 24417 [2020-11-12 09:35:51,465 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2020-11-12 09:35:51,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24417 states. [2020-11-12 09:35:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24417 to 22653. [2020-11-12 09:35:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22653 states, 21906 states have (on average 1.4811467177942117) internal successors, (32446), 22652 states have internal predecessors, (32446), 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-12 09:35:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22653 states to 22653 states and 32446 transitions. [2020-11-12 09:35:51,810 INFO L78 Accepts]: Start accepts. Automaton has 22653 states and 32446 transitions. Word has length 53 [2020-11-12 09:35:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:51,810 INFO L481 AbstractCegarLoop]: Abstraction has 22653 states and 32446 transitions. [2020-11-12 09:35:51,811 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-12 09:35:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 22653 states and 32446 transitions. [2020-11-12 09:35:51,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-12 09:35:51,820 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:51,821 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-12 09:35:51,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-12 09:35:51,821 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-12 09:35:51,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:51,821 INFO L82 PathProgramCache]: Analyzing trace with hash -646183478, now seen corresponding path program 1 times [2020-11-12 09:35:51,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:51,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692991312] [2020-11-12 09:35:51,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:52,176 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-12 09:35:52,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692991312] [2020-11-12 09:35:52,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:52,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-12 09:35:52,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785183697] [2020-11-12 09:35:52,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 09:35:52,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:52,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 09:35:52,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-11-12 09:35:52,179 INFO L87 Difference]: Start difference. First operand 22653 states and 32446 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-12 09:35:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:52,817 INFO L93 Difference]: Finished difference Result 24302 states and 35318 transitions. [2020-11-12 09:35:52,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 09:35:52,818 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-12 09:35:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:52,845 INFO L225 Difference]: With dead ends: 24302 [2020-11-12 09:35:52,845 INFO L226 Difference]: Without dead ends: 24074 [2020-11-12 09:35:52,846 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-12 09:35:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24074 states. [2020-11-12 09:35:53,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24074 to 22653. [2020-11-12 09:35:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22653 states, 21906 states have (on average 1.4811467177942117) internal successors, (32446), 22652 states have internal predecessors, (32446), 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-12 09:35:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22653 states to 22653 states and 32446 transitions. [2020-11-12 09:35:53,139 INFO L78 Accepts]: Start accepts. Automaton has 22653 states and 32446 transitions. Word has length 53 [2020-11-12 09:35:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:53,140 INFO L481 AbstractCegarLoop]: Abstraction has 22653 states and 32446 transitions. [2020-11-12 09:35:53,140 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-12 09:35:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 22653 states and 32446 transitions. [2020-11-12 09:35:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-12 09:35:53,149 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:53,149 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-12 09:35:53,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-12 09:35:53,149 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-12 09:35:53,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:53,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1448716681, now seen corresponding path program 2 times [2020-11-12 09:35:53,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:53,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190976551] [2020-11-12 09:35:53,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:53,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-12 09:35:53,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190976551] [2020-11-12 09:35:53,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:53,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-12 09:35:53,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579260165] [2020-11-12 09:35:53,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-12 09:35:53,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:53,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-12 09:35:53,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-11-12 09:35:53,573 INFO L87 Difference]: Start difference. First operand 22653 states and 32446 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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-12 09:35:54,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:54,817 INFO L93 Difference]: Finished difference Result 23330 states and 33698 transitions. [2020-11-12 09:35:54,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-12 09:35:54,817 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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-12 09:35:54,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:54,838 INFO L225 Difference]: With dead ends: 23330 [2020-11-12 09:35:54,839 INFO L226 Difference]: Without dead ends: 23262 [2020-11-12 09:35:54,839 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2020-11-12 09:35:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23262 states. [2020-11-12 09:35:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23262 to 22649. [2020-11-12 09:35:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22649 states, 21902 states have (on average 1.4811432745867956) internal successors, (32440), 22648 states have internal predecessors, (32440), 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-12 09:35:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22649 states to 22649 states and 32440 transitions. [2020-11-12 09:35:55,114 INFO L78 Accepts]: Start accepts. Automaton has 22649 states and 32440 transitions. Word has length 53 [2020-11-12 09:35:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:55,114 INFO L481 AbstractCegarLoop]: Abstraction has 22649 states and 32440 transitions. [2020-11-12 09:35:55,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 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-12 09:35:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 22649 states and 32440 transitions. [2020-11-12 09:35:55,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-12 09:35:55,121 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:55,121 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-12 09:35:55,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-12 09:35:55,121 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-12 09:35:55,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:55,122 INFO L82 PathProgramCache]: Analyzing trace with hash -990917145, now seen corresponding path program 3 times [2020-11-12 09:35:55,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:55,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916917971] [2020-11-12 09:35:55,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:55,511 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-12 09:35:55,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916917971] [2020-11-12 09:35:55,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:55,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-12 09:35:55,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715020585] [2020-11-12 09:35:55,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-12 09:35:55,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:55,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-12 09:35:55,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-11-12 09:35:55,517 INFO L87 Difference]: Start difference. First operand 22649 states and 32440 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-12 09:35:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:56,482 INFO L93 Difference]: Finished difference Result 27674 states and 42765 transitions. [2020-11-12 09:35:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-12 09:35:56,482 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-12 09:35:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:56,513 INFO L225 Difference]: With dead ends: 27674 [2020-11-12 09:35:56,514 INFO L226 Difference]: Without dead ends: 27057 [2020-11-12 09:35:56,514 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=587, Unknown=0, NotChecked=0, Total=812 [2020-11-12 09:35:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27057 states. [2020-11-12 09:35:56,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27057 to 22541. [2020-11-12 09:35:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22541 states, 21797 states have (on average 1.4817176675689314) internal successors, (32297), 22540 states have internal predecessors, (32297), 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-12 09:35:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22541 states to 22541 states and 32297 transitions. [2020-11-12 09:35:56,930 INFO L78 Accepts]: Start accepts. Automaton has 22541 states and 32297 transitions. Word has length 53 [2020-11-12 09:35:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:56,930 INFO L481 AbstractCegarLoop]: Abstraction has 22541 states and 32297 transitions. [2020-11-12 09:35:56,930 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-12 09:35:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 22541 states and 32297 transitions. [2020-11-12 09:35:56,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-12 09:35:56,937 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:56,937 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-12 09:35:56,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-12 09:35:56,938 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-12 09:35:56,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:56,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1945900202, now seen corresponding path program 2 times [2020-11-12 09:35:56,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:56,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812870932] [2020-11-12 09:35:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 09:35:57,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812870932] [2020-11-12 09:35:57,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:57,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-12 09:35:57,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225329205] [2020-11-12 09:35:57,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-12 09:35:57,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:57,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-12 09:35:57,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-11-12 09:35:57,361 INFO L87 Difference]: Start difference. First operand 22541 states and 32297 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-12 09:35:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:58,421 INFO L93 Difference]: Finished difference Result 25443 states and 36977 transitions. [2020-11-12 09:35:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-12 09:35:58,421 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-12 09:35:58,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:58,454 INFO L225 Difference]: With dead ends: 25443 [2020-11-12 09:35:58,454 INFO L226 Difference]: Without dead ends: 24899 [2020-11-12 09:35:58,455 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2020-11-12 09:35:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24899 states. [2020-11-12 09:35:58,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24899 to 22259. [2020-11-12 09:35:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22259 states, 21515 states have (on average 1.44173832210086) internal successors, (31019), 22258 states have internal predecessors, (31019), 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-12 09:35:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22259 states to 22259 states and 31019 transitions. [2020-11-12 09:35:58,748 INFO L78 Accepts]: Start accepts. Automaton has 22259 states and 31019 transitions. Word has length 53 [2020-11-12 09:35:58,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:58,748 INFO L481 AbstractCegarLoop]: Abstraction has 22259 states and 31019 transitions. [2020-11-12 09:35:58,749 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-12 09:35:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 22259 states and 31019 transitions. [2020-11-12 09:35:58,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-12 09:35:58,756 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:58,756 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-12 09:35:58,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-12 09:35:58,756 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-12 09:35:58,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:58,757 INFO L82 PathProgramCache]: Analyzing trace with hash -633463392, now seen corresponding path program 3 times [2020-11-12 09:35:58,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:58,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480910914] [2020-11-12 09:35:58,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:35:58,991 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-12 09:35:58,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480910914] [2020-11-12 09:35:58,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:35:58,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 09:35:58,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356900416] [2020-11-12 09:35:58,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 09:35:58,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:35:58,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 09:35:58,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-12 09:35:58,994 INFO L87 Difference]: Start difference. First operand 22259 states and 31019 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-12 09:35:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:35:59,451 INFO L93 Difference]: Finished difference Result 20226 states and 29498 transitions. [2020-11-12 09:35:59,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 09:35:59,451 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-12 09:35:59,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:35:59,471 INFO L225 Difference]: With dead ends: 20226 [2020-11-12 09:35:59,471 INFO L226 Difference]: Without dead ends: 19903 [2020-11-12 09:35:59,472 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-12 09:35:59,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19903 states. [2020-11-12 09:35:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19903 to 17121. [2020-11-12 09:35:59,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17121 states, 16583 states have (on average 1.4322498944702406) internal successors, (23751), 17120 states have internal predecessors, (23751), 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-12 09:35:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17121 states to 17121 states and 23751 transitions. [2020-11-12 09:35:59,700 INFO L78 Accepts]: Start accepts. Automaton has 17121 states and 23751 transitions. Word has length 53 [2020-11-12 09:35:59,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:35:59,700 INFO L481 AbstractCegarLoop]: Abstraction has 17121 states and 23751 transitions. [2020-11-12 09:35:59,700 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-12 09:35:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 17121 states and 23751 transitions. [2020-11-12 09:35:59,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-12 09:35:59,708 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:35:59,708 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-12 09:35:59,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-12 09:35:59,708 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-12 09:35:59,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:35:59,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2065389784, now seen corresponding path program 1 times [2020-11-12 09:35:59,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:35:59,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95007064] [2020-11-12 09:35:59,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:35:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:00,130 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-12 09:36:00,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95007064] [2020-11-12 09:36:00,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:00,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-12 09:36:00,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253166173] [2020-11-12 09:36:00,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-12 09:36:00,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:00,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-12 09:36:00,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2020-11-12 09:36:00,132 INFO L87 Difference]: Start difference. First operand 17121 states and 23751 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-12 09:36:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:01,382 INFO L93 Difference]: Finished difference Result 15612 states and 23213 transitions. [2020-11-12 09:36:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-12 09:36:01,382 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-12 09:36:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:01,404 INFO L225 Difference]: With dead ends: 15612 [2020-11-12 09:36:01,405 INFO L226 Difference]: Without dead ends: 14587 [2020-11-12 09:36:01,405 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2020-11-12 09:36:01,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14587 states. [2020-11-12 09:36:01,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14587 to 10839. [2020-11-12 09:36:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10839 states, 10466 states have (on average 1.3755016243072806) internal successors, (14396), 10838 states have internal predecessors, (14396), 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-12 09:36:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 14396 transitions. [2020-11-12 09:36:01,760 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 14396 transitions. Word has length 55 [2020-11-12 09:36:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:01,760 INFO L481 AbstractCegarLoop]: Abstraction has 10839 states and 14396 transitions. [2020-11-12 09:36:01,760 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-12 09:36:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 14396 transitions. [2020-11-12 09:36:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-12 09:36:01,769 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:01,769 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-12 09:36:01,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-12 09:36:01,769 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-12 09:36:01,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:01,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1893881923, now seen corresponding path program 1 times [2020-11-12 09:36:01,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:01,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444326451] [2020-11-12 09:36:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 09:36:01,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444326451] [2020-11-12 09:36:01,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:01,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 09:36:01,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703479825] [2020-11-12 09:36:01,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 09:36:01,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:01,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 09:36:01,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-12 09:36:01,860 INFO L87 Difference]: Start difference. First operand 10839 states and 14396 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-12 09:36:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:02,017 INFO L93 Difference]: Finished difference Result 12759 states and 17356 transitions. [2020-11-12 09:36:02,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 09:36:02,018 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-12 09:36:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:02,031 INFO L225 Difference]: With dead ends: 12759 [2020-11-12 09:36:02,032 INFO L226 Difference]: Without dead ends: 12163 [2020-11-12 09:36:02,032 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-12 09:36:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12163 states. [2020-11-12 09:36:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12163 to 11166. [2020-11-12 09:36:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11166 states, 10793 states have (on average 1.389974983785787) internal successors, (15002), 11165 states have internal predecessors, (15002), 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-12 09:36:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11166 states to 11166 states and 15002 transitions. [2020-11-12 09:36:02,184 INFO L78 Accepts]: Start accepts. Automaton has 11166 states and 15002 transitions. Word has length 56 [2020-11-12 09:36:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:02,184 INFO L481 AbstractCegarLoop]: Abstraction has 11166 states and 15002 transitions. [2020-11-12 09:36:02,185 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-12 09:36:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 11166 states and 15002 transitions. [2020-11-12 09:36:02,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-12 09:36:02,191 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:02,191 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-12 09:36:02,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-12 09:36:02,191 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-12 09:36:02,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:02,192 INFO L82 PathProgramCache]: Analyzing trace with hash 770618419, now seen corresponding path program 2 times [2020-11-12 09:36:02,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:02,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194258655] [2020-11-12 09:36:02,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:02,297 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-12 09:36:02,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194258655] [2020-11-12 09:36:02,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:02,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 09:36:02,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350994821] [2020-11-12 09:36:02,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 09:36:02,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:02,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 09:36:02,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-12 09:36:02,299 INFO L87 Difference]: Start difference. First operand 11166 states and 15002 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-12 09:36:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:02,594 INFO L93 Difference]: Finished difference Result 11934 states and 15648 transitions. [2020-11-12 09:36:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-12 09:36:02,595 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-12 09:36:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:02,606 INFO L225 Difference]: With dead ends: 11934 [2020-11-12 09:36:02,607 INFO L226 Difference]: Without dead ends: 10342 [2020-11-12 09:36:02,607 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2020-11-12 09:36:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10342 states. [2020-11-12 09:36:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10342 to 9552. [2020-11-12 09:36:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9552 states, 9230 states have (on average 1.3731310942578547) internal successors, (12674), 9551 states have internal predecessors, (12674), 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-12 09:36:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9552 states to 9552 states and 12674 transitions. [2020-11-12 09:36:02,740 INFO L78 Accepts]: Start accepts. Automaton has 9552 states and 12674 transitions. Word has length 56 [2020-11-12 09:36:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:02,741 INFO L481 AbstractCegarLoop]: Abstraction has 9552 states and 12674 transitions. [2020-11-12 09:36:02,741 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-12 09:36:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 9552 states and 12674 transitions. [2020-11-12 09:36:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-12 09:36:02,747 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:02,747 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-12 09:36:02,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-12 09:36:02,747 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-12 09:36:02,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:02,748 INFO L82 PathProgramCache]: Analyzing trace with hash -954157515, now seen corresponding path program 1 times [2020-11-12 09:36:02,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:02,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293964010] [2020-11-12 09:36:02,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 09:36:02,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293964010] [2020-11-12 09:36:02,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:02,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-12 09:36:02,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761020052] [2020-11-12 09:36:02,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-12 09:36:02,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:02,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-12 09:36:02,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-11-12 09:36:02,974 INFO L87 Difference]: Start difference. First operand 9552 states and 12674 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-12 09:36:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:03,805 INFO L93 Difference]: Finished difference Result 11192 states and 15259 transitions. [2020-11-12 09:36:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-12 09:36:03,806 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-12 09:36:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:03,815 INFO L225 Difference]: With dead ends: 11192 [2020-11-12 09:36:03,815 INFO L226 Difference]: Without dead ends: 10792 [2020-11-12 09:36:03,816 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2020-11-12 09:36:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10792 states. [2020-11-12 09:36:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10792 to 9513. [2020-11-12 09:36:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9513 states, 9191 states have (on average 1.3736263736263736) internal successors, (12625), 9512 states have internal predecessors, (12625), 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-12 09:36:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9513 states to 9513 states and 12625 transitions. [2020-11-12 09:36:03,934 INFO L78 Accepts]: Start accepts. Automaton has 9513 states and 12625 transitions. Word has length 56 [2020-11-12 09:36:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:03,934 INFO L481 AbstractCegarLoop]: Abstraction has 9513 states and 12625 transitions. [2020-11-12 09:36:03,934 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-12 09:36:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 9513 states and 12625 transitions. [2020-11-12 09:36:03,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-11-12 09:36:03,939 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:03,939 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-12 09:36:03,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-12 09:36:03,940 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-12 09:36:03,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:03,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1529664607, now seen corresponding path program 2 times [2020-11-12 09:36:03,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:03,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812032227] [2020-11-12 09:36:03,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 09:36:04,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812032227] [2020-11-12 09:36:04,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:04,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-12 09:36:04,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741448223] [2020-11-12 09:36:04,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-12 09:36:04,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:04,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-12 09:36:04,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-11-12 09:36:04,485 INFO L87 Difference]: Start difference. First operand 9513 states and 12625 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-12 09:36:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:05,403 INFO L93 Difference]: Finished difference Result 10351 states and 13970 transitions. [2020-11-12 09:36:05,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-12 09:36:05,403 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-12 09:36:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:05,414 INFO L225 Difference]: With dead ends: 10351 [2020-11-12 09:36:05,414 INFO L226 Difference]: Without dead ends: 10041 [2020-11-12 09:36:05,415 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2020-11-12 09:36:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10041 states. [2020-11-12 09:36:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10041 to 9275. [2020-11-12 09:36:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9275 states, 8965 states have (on average 1.373898494143893) internal successors, (12317), 9274 states have internal predecessors, (12317), 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-12 09:36:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9275 states to 9275 states and 12317 transitions. [2020-11-12 09:36:05,539 INFO L78 Accepts]: Start accepts. Automaton has 9275 states and 12317 transitions. Word has length 56 [2020-11-12 09:36:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:05,539 INFO L481 AbstractCegarLoop]: Abstraction has 9275 states and 12317 transitions. [2020-11-12 09:36:05,539 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-12 09:36:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 9275 states and 12317 transitions. [2020-11-12 09:36:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-12 09:36:05,544 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:05,545 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-12 09:36:05,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-12 09:36:05,545 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-12 09:36:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:05,545 INFO L82 PathProgramCache]: Analyzing trace with hash 16337222, now seen corresponding path program 1 times [2020-11-12 09:36:05,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:05,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36789630] [2020-11-12 09:36:05,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:05,801 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-12 09:36:05,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36789630] [2020-11-12 09:36:05,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:05,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-12 09:36:05,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845564283] [2020-11-12 09:36:05,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 09:36:05,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:05,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 09:36:05,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-12 09:36:05,805 INFO L87 Difference]: Start difference. First operand 9275 states and 12317 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-12 09:36:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:06,409 INFO L93 Difference]: Finished difference Result 10960 states and 15063 transitions. [2020-11-12 09:36:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-12 09:36:06,409 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-12 09:36:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:06,421 INFO L225 Difference]: With dead ends: 10960 [2020-11-12 09:36:06,421 INFO L226 Difference]: Without dead ends: 10717 [2020-11-12 09:36:06,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-12 09:36:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10717 states. [2020-11-12 09:36:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10717 to 9274. [2020-11-12 09:36:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9274 states, 8964 states have (on average 1.3739402052655065) internal successors, (12316), 9273 states have internal predecessors, (12316), 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-12 09:36:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9274 states to 9274 states and 12316 transitions. [2020-11-12 09:36:06,562 INFO L78 Accepts]: Start accepts. Automaton has 9274 states and 12316 transitions. Word has length 58 [2020-11-12 09:36:06,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:06,562 INFO L481 AbstractCegarLoop]: Abstraction has 9274 states and 12316 transitions. [2020-11-12 09:36:06,562 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-12 09:36:06,563 INFO L276 IsEmpty]: Start isEmpty. Operand 9274 states and 12316 transitions. [2020-11-12 09:36:06,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-12 09:36:06,567 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:06,567 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-12 09:36:06,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-12 09:36:06,568 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-12 09:36:06,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:06,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1802111958, now seen corresponding path program 2 times [2020-11-12 09:36:06,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:06,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282921365] [2020-11-12 09:36:06,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:06,944 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-12 09:36:06,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282921365] [2020-11-12 09:36:06,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:06,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-12 09:36:06,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694611125] [2020-11-12 09:36:06,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-12 09:36:06,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:06,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-12 09:36:06,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-11-12 09:36:06,947 INFO L87 Difference]: Start difference. First operand 9274 states and 12316 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-12 09:36:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:08,168 INFO L93 Difference]: Finished difference Result 11135 states and 15423 transitions. [2020-11-12 09:36:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-12 09:36:08,169 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-12 09:36:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:08,180 INFO L225 Difference]: With dead ends: 11135 [2020-11-12 09:36:08,181 INFO L226 Difference]: Without dead ends: 10892 [2020-11-12 09:36:08,181 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2020-11-12 09:36:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10892 states. [2020-11-12 09:36:08,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10892 to 8993. [2020-11-12 09:36:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8993 states, 8692 states have (on average 1.3768982972848596) internal successors, (11968), 8992 states have internal predecessors, (11968), 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-12 09:36:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8993 states to 8993 states and 11968 transitions. [2020-11-12 09:36:08,327 INFO L78 Accepts]: Start accepts. Automaton has 8993 states and 11968 transitions. Word has length 58 [2020-11-12 09:36:08,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:08,328 INFO L481 AbstractCegarLoop]: Abstraction has 8993 states and 11968 transitions. [2020-11-12 09:36:08,328 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-12 09:36:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8993 states and 11968 transitions. [2020-11-12 09:36:08,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-12 09:36:08,333 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:08,333 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-12 09:36:08,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-12 09:36:08,333 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-12 09:36:08,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:08,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1430616798, now seen corresponding path program 1 times [2020-11-12 09:36:08,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:08,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601705219] [2020-11-12 09:36:08,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:08,894 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-12 09:36:08,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601705219] [2020-11-12 09:36:08,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:08,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-12 09:36:08,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553481013] [2020-11-12 09:36:08,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-12 09:36:08,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:08,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-12 09:36:08,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2020-11-12 09:36:08,903 INFO L87 Difference]: Start difference. First operand 8993 states and 11968 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 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-12 09:36:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:10,455 INFO L93 Difference]: Finished difference Result 12391 states and 16856 transitions. [2020-11-12 09:36:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-12 09:36:10,455 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 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-12 09:36:10,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:10,468 INFO L225 Difference]: With dead ends: 12391 [2020-11-12 09:36:10,468 INFO L226 Difference]: Without dead ends: 11805 [2020-11-12 09:36:10,469 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2020-11-12 09:36:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11805 states. [2020-11-12 09:36:10,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11805 to 7670. [2020-11-12 09:36:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7670 states, 7411 states have (on average 1.3706652273647282) internal successors, (10158), 7669 states have internal predecessors, (10158), 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-12 09:36:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7670 states to 7670 states and 10158 transitions. [2020-11-12 09:36:10,605 INFO L78 Accepts]: Start accepts. Automaton has 7670 states and 10158 transitions. Word has length 58 [2020-11-12 09:36:10,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:10,605 INFO L481 AbstractCegarLoop]: Abstraction has 7670 states and 10158 transitions. [2020-11-12 09:36:10,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 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-12 09:36:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 7670 states and 10158 transitions. [2020-11-12 09:36:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-12 09:36:10,610 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:10,610 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-12 09:36:10,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-12 09:36:10,611 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-12 09:36:10,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:10,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1864499108, now seen corresponding path program 1 times [2020-11-12 09:36:10,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:10,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174815928] [2020-11-12 09:36:10,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:10,699 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-12 09:36:10,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174815928] [2020-11-12 09:36:10,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:10,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 09:36:10,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399427503] [2020-11-12 09:36:10,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 09:36:10,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:10,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 09:36:10,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-12 09:36:10,701 INFO L87 Difference]: Start difference. First operand 7670 states and 10158 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-12 09:36:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:10,866 INFO L93 Difference]: Finished difference Result 8661 states and 11438 transitions. [2020-11-12 09:36:10,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 09:36:10,867 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-12 09:36:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:10,877 INFO L225 Difference]: With dead ends: 8661 [2020-11-12 09:36:10,877 INFO L226 Difference]: Without dead ends: 7965 [2020-11-12 09:36:10,877 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-12 09:36:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7965 states. [2020-11-12 09:36:11,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7965 to 7817. [2020-11-12 09:36:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7817 states, 7558 states have (on average 1.3724530299020905) internal successors, (10373), 7816 states have internal predecessors, (10373), 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-12 09:36:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7817 states to 7817 states and 10373 transitions. [2020-11-12 09:36:11,047 INFO L78 Accepts]: Start accepts. Automaton has 7817 states and 10373 transitions. Word has length 59 [2020-11-12 09:36:11,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:11,047 INFO L481 AbstractCegarLoop]: Abstraction has 7817 states and 10373 transitions. [2020-11-12 09:36:11,047 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-12 09:36:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 7817 states and 10373 transitions. [2020-11-12 09:36:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-12 09:36:11,057 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:11,057 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-12 09:36:11,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-12 09:36:11,057 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-12 09:36:11,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:11,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1469712804, now seen corresponding path program 2 times [2020-11-12 09:36:11,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:11,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16496066] [2020-11-12 09:36:11,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 09:36:11,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16496066] [2020-11-12 09:36:11,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:11,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-12 09:36:11,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130736457] [2020-11-12 09:36:11,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-12 09:36:11,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:11,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-12 09:36:11,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-11-12 09:36:11,376 INFO L87 Difference]: Start difference. First operand 7817 states and 10373 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 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-12 09:36:12,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:12,001 INFO L93 Difference]: Finished difference Result 8776 states and 11614 transitions. [2020-11-12 09:36:12,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-12 09:36:12,002 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 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-12 09:36:12,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:12,011 INFO L225 Difference]: With dead ends: 8776 [2020-11-12 09:36:12,012 INFO L226 Difference]: Without dead ends: 8080 [2020-11-12 09:36:12,012 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2020-11-12 09:36:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8080 states. [2020-11-12 09:36:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8080 to 7785. [2020-11-12 09:36:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7785 states, 7526 states have (on average 1.3729736912038268) internal successors, (10333), 7784 states have internal predecessors, (10333), 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-12 09:36:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7785 states to 7785 states and 10333 transitions. [2020-11-12 09:36:12,132 INFO L78 Accepts]: Start accepts. Automaton has 7785 states and 10333 transitions. Word has length 59 [2020-11-12 09:36:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:12,132 INFO L481 AbstractCegarLoop]: Abstraction has 7785 states and 10333 transitions. [2020-11-12 09:36:12,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 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-12 09:36:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 7785 states and 10333 transitions. [2020-11-12 09:36:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-12 09:36:12,138 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:12,138 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-12 09:36:12,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-12 09:36:12,138 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-12 09:36:12,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:12,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1632510880, now seen corresponding path program 3 times [2020-11-12 09:36:12,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:12,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259150725] [2020-11-12 09:36:12,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:12,672 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-12 09:36:12,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259150725] [2020-11-12 09:36:12,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:12,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-12 09:36:12,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463960460] [2020-11-12 09:36:12,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-12 09:36:12,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:12,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-12 09:36:12,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2020-11-12 09:36:12,674 INFO L87 Difference]: Start difference. First operand 7785 states and 10333 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 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-12 09:36:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:14,100 INFO L93 Difference]: Finished difference Result 10331 states and 13619 transitions. [2020-11-12 09:36:14,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-12 09:36:14,101 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 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-12 09:36:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:14,111 INFO L225 Difference]: With dead ends: 10331 [2020-11-12 09:36:14,112 INFO L226 Difference]: Without dead ends: 9785 [2020-11-12 09:36:14,112 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2020-11-12 09:36:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9785 states. [2020-11-12 09:36:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9785 to 7748. [2020-11-12 09:36:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7748 states, 7489 states have (on average 1.3694752303378288) internal successors, (10256), 7747 states have internal predecessors, (10256), 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-12 09:36:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7748 states to 7748 states and 10256 transitions. [2020-11-12 09:36:14,224 INFO L78 Accepts]: Start accepts. Automaton has 7748 states and 10256 transitions. Word has length 59 [2020-11-12 09:36:14,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:14,224 INFO L481 AbstractCegarLoop]: Abstraction has 7748 states and 10256 transitions. [2020-11-12 09:36:14,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 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-12 09:36:14,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7748 states and 10256 transitions. [2020-11-12 09:36:14,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-12 09:36:14,228 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:14,228 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-12 09:36:14,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-12 09:36:14,228 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-12 09:36:14,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:14,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1707027180, now seen corresponding path program 4 times [2020-11-12 09:36:14,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:14,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12502228] [2020-11-12 09:36:14,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:14,531 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-12 09:36:14,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12502228] [2020-11-12 09:36:14,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:14,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-12 09:36:14,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841097175] [2020-11-12 09:36:14,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-12 09:36:14,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:14,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-12 09:36:14,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-11-12 09:36:14,533 INFO L87 Difference]: Start difference. First operand 7748 states and 10256 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-12 09:36:15,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:15,516 INFO L93 Difference]: Finished difference Result 8124 states and 10745 transitions. [2020-11-12 09:36:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-12 09:36:15,516 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-12 09:36:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:15,523 INFO L225 Difference]: With dead ends: 8124 [2020-11-12 09:36:15,524 INFO L226 Difference]: Without dead ends: 7462 [2020-11-12 09:36:15,524 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2020-11-12 09:36:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7462 states. [2020-11-12 09:36:15,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7462 to 7155. [2020-11-12 09:36:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7155 states, 6911 states have (on average 1.3710027492403414) internal successors, (9475), 7154 states have internal predecessors, (9475), 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-12 09:36:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7155 states to 7155 states and 9475 transitions. [2020-11-12 09:36:15,610 INFO L78 Accepts]: Start accepts. Automaton has 7155 states and 9475 transitions. Word has length 59 [2020-11-12 09:36:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:15,610 INFO L481 AbstractCegarLoop]: Abstraction has 7155 states and 9475 transitions. [2020-11-12 09:36:15,610 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-12 09:36:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 7155 states and 9475 transitions. [2020-11-12 09:36:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-12 09:36:15,614 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:15,614 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-12 09:36:15,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-12 09:36:15,614 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-12 09:36:15,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:15,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1644492419, now seen corresponding path program 1 times [2020-11-12 09:36:15,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:15,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690461718] [2020-11-12 09:36:15,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:16,103 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-12 09:36:16,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690461718] [2020-11-12 09:36:16,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:16,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-12 09:36:16,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451699079] [2020-11-12 09:36:16,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-12 09:36:16,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:16,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-12 09:36:16,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-11-12 09:36:16,105 INFO L87 Difference]: Start difference. First operand 7155 states and 9475 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-12 09:36:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:17,495 INFO L93 Difference]: Finished difference Result 6199 states and 8663 transitions. [2020-11-12 09:36:17,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-12 09:36:17,496 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-12 09:36:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:17,501 INFO L225 Difference]: With dead ends: 6199 [2020-11-12 09:36:17,501 INFO L226 Difference]: Without dead ends: 5847 [2020-11-12 09:36:17,502 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2020-11-12 09:36:17,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5847 states. [2020-11-12 09:36:17,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5847 to 4605. [2020-11-12 09:36:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 4469 states have (on average 1.3416871783396733) internal successors, (5996), 4604 states have internal predecessors, (5996), 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-12 09:36:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 5996 transitions. [2020-11-12 09:36:17,574 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 5996 transitions. Word has length 60 [2020-11-12 09:36:17,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:17,574 INFO L481 AbstractCegarLoop]: Abstraction has 4605 states and 5996 transitions. [2020-11-12 09:36:17,575 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-12 09:36:17,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 5996 transitions. [2020-11-12 09:36:17,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-12 09:36:17,578 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:17,578 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-12 09:36:17,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-12 09:36:17,578 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-12 09:36:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:17,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1114127787, now seen corresponding path program 1 times [2020-11-12 09:36:17,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:17,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104111766] [2020-11-12 09:36:17,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:17,874 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-12 09:36:17,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104111766] [2020-11-12 09:36:17,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:17,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-12 09:36:17,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341943993] [2020-11-12 09:36:17,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 09:36:17,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:17,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 09:36:17,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-12 09:36:17,876 INFO L87 Difference]: Start difference. First operand 4605 states and 5996 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-12 09:36:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:18,647 INFO L93 Difference]: Finished difference Result 5369 states and 7011 transitions. [2020-11-12 09:36:18,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-12 09:36:18,648 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-12 09:36:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:18,655 INFO L225 Difference]: With dead ends: 5369 [2020-11-12 09:36:18,655 INFO L226 Difference]: Without dead ends: 4949 [2020-11-12 09:36:18,658 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-12 09:36:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4949 states. [2020-11-12 09:36:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4949 to 4604. [2020-11-12 09:36:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4604 states, 4468 states have (on average 1.3417636526410026) internal successors, (5995), 4603 states have internal predecessors, (5995), 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-12 09:36:18,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4604 states to 4604 states and 5995 transitions. [2020-11-12 09:36:18,757 INFO L78 Accepts]: Start accepts. Automaton has 4604 states and 5995 transitions. Word has length 61 [2020-11-12 09:36:18,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:18,758 INFO L481 AbstractCegarLoop]: Abstraction has 4604 states and 5995 transitions. [2020-11-12 09:36:18,758 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-12 09:36:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4604 states and 5995 transitions. [2020-11-12 09:36:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-12 09:36:18,763 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:18,763 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-12 09:36:18,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-12 09:36:18,763 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-12 09:36:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:18,764 INFO L82 PathProgramCache]: Analyzing trace with hash -630607589, now seen corresponding path program 2 times [2020-11-12 09:36:18,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:18,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109073324] [2020-11-12 09:36:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:19,207 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-12 09:36:19,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109073324] [2020-11-12 09:36:19,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:19,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-12 09:36:19,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18273759] [2020-11-12 09:36:19,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-12 09:36:19,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:19,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-12 09:36:19,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2020-11-12 09:36:19,210 INFO L87 Difference]: Start difference. First operand 4604 states and 5995 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 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-12 09:36:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:20,425 INFO L93 Difference]: Finished difference Result 5347 states and 6986 transitions. [2020-11-12 09:36:20,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-12 09:36:20,426 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 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-12 09:36:20,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:20,432 INFO L225 Difference]: With dead ends: 5347 [2020-11-12 09:36:20,432 INFO L226 Difference]: Without dead ends: 4927 [2020-11-12 09:36:20,433 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2020-11-12 09:36:20,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4927 states. [2020-11-12 09:36:20,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4927 to 4593. [2020-11-12 09:36:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4593 states, 4457 states have (on average 1.3417096701817366) internal successors, (5980), 4592 states have internal predecessors, (5980), 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-12 09:36:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4593 states to 4593 states and 5980 transitions. [2020-11-12 09:36:20,505 INFO L78 Accepts]: Start accepts. Automaton has 4593 states and 5980 transitions. Word has length 61 [2020-11-12 09:36:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:20,505 INFO L481 AbstractCegarLoop]: Abstraction has 4593 states and 5980 transitions. [2020-11-12 09:36:20,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 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-12 09:36:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4593 states and 5980 transitions. [2020-11-12 09:36:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-12 09:36:20,508 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:20,509 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-12 09:36:20,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-12 09:36:20,509 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-12 09:36:20,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1823351201, now seen corresponding path program 3 times [2020-11-12 09:36:20,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:20,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100411481] [2020-11-12 09:36:20,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:21,042 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-12 09:36:21,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100411481] [2020-11-12 09:36:21,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:21,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-12 09:36:21,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724153979] [2020-11-12 09:36:21,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-12 09:36:21,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:21,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-12 09:36:21,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2020-11-12 09:36:21,044 INFO L87 Difference]: Start difference. First operand 4593 states and 5980 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-12 09:36:22,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:22,560 INFO L93 Difference]: Finished difference Result 5238 states and 6787 transitions. [2020-11-12 09:36:22,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-12 09:36:22,562 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-12 09:36:22,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:22,567 INFO L225 Difference]: With dead ends: 5238 [2020-11-12 09:36:22,567 INFO L226 Difference]: Without dead ends: 4327 [2020-11-12 09:36:22,568 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=325, Invalid=1007, Unknown=0, NotChecked=0, Total=1332 [2020-11-12 09:36:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4327 states. [2020-11-12 09:36:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4327 to 4005. [2020-11-12 09:36:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4005 states, 3869 states have (on average 1.3070560868441459) internal successors, (5057), 4004 states have internal predecessors, (5057), 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-12 09:36:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 5057 transitions. [2020-11-12 09:36:22,625 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 5057 transitions. Word has length 61 [2020-11-12 09:36:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:22,625 INFO L481 AbstractCegarLoop]: Abstraction has 4005 states and 5057 transitions. [2020-11-12 09:36:22,626 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-12 09:36:22,626 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 5057 transitions. [2020-11-12 09:36:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-12 09:36:22,629 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:22,629 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-12 09:36:22,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-12 09:36:22,629 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-12 09:36:22,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:22,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1748834901, now seen corresponding path program 4 times [2020-11-12 09:36:22,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:22,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022891800] [2020-11-12 09:36:22,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:23,122 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-12 09:36:23,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022891800] [2020-11-12 09:36:23,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:23,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-12 09:36:23,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974783397] [2020-11-12 09:36:23,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-12 09:36:23,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:23,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-12 09:36:23,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-11-12 09:36:23,124 INFO L87 Difference]: Start difference. First operand 4005 states and 5057 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-12 09:36:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:24,915 INFO L93 Difference]: Finished difference Result 1509 states and 2104 transitions. [2020-11-12 09:36:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-12 09:36:24,916 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-12 09:36:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:24,918 INFO L225 Difference]: With dead ends: 1509 [2020-11-12 09:36:24,919 INFO L226 Difference]: Without dead ends: 887 [2020-11-12 09:36:24,919 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=469, Invalid=1337, Unknown=0, NotChecked=0, Total=1806 [2020-11-12 09:36:24,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-11-12 09:36:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 579. [2020-11-12 09:36:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 1.5069204152249136) internal successors, (871), 578 states have internal predecessors, (871), 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-12 09:36:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 871 transitions. [2020-11-12 09:36:24,929 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 871 transitions. Word has length 61 [2020-11-12 09:36:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:24,930 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 871 transitions. [2020-11-12 09:36:24,930 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-12 09:36:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 871 transitions. [2020-11-12 09:36:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-12 09:36:24,931 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:24,931 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-12 09:36:24,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-12 09:36:24,931 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-12 09:36:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:24,932 INFO L82 PathProgramCache]: Analyzing trace with hash -46867508, now seen corresponding path program 1 times [2020-11-12 09:36:24,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:24,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520965989] [2020-11-12 09:36:24,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:25,489 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-12 09:36:25,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520965989] [2020-11-12 09:36:25,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:25,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-12 09:36:25,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283027573] [2020-11-12 09:36:25,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-12 09:36:25,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:25,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-12 09:36:25,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-11-12 09:36:25,491 INFO L87 Difference]: Start difference. First operand 579 states and 871 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 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-12 09:36:26,343 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2020-11-12 09:36:26,538 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2020-11-12 09:36:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:27,434 INFO L93 Difference]: Finished difference Result 967 states and 1507 transitions. [2020-11-12 09:36:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-12 09:36:27,435 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 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-12 09:36:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:27,437 INFO L225 Difference]: With dead ends: 967 [2020-11-12 09:36:27,437 INFO L226 Difference]: Without dead ends: 964 [2020-11-12 09:36:27,438 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=282, Invalid=774, Unknown=0, NotChecked=0, Total=1056 [2020-11-12 09:36:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2020-11-12 09:36:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 684. [2020-11-12 09:36:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.5417276720351392) internal successors, (1053), 683 states have internal predecessors, (1053), 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-12 09:36:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1053 transitions. [2020-11-12 09:36:27,450 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1053 transitions. Word has length 94 [2020-11-12 09:36:27,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:27,452 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 1053 transitions. [2020-11-12 09:36:27,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 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-12 09:36:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1053 transitions. [2020-11-12 09:36:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-12 09:36:27,453 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:27,453 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-12 09:36:27,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-12 09:36:27,454 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-12 09:36:27,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:27,454 INFO L82 PathProgramCache]: Analyzing trace with hash 780733003, now seen corresponding path program 1 times [2020-11-12 09:36:27,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:27,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858449877] [2020-11-12 09:36:27,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:27,624 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-12 09:36:27,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858449877] [2020-11-12 09:36:27,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:27,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 09:36:27,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283587203] [2020-11-12 09:36:27,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 09:36:27,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:27,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 09:36:27,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-12 09:36:27,627 INFO L87 Difference]: Start difference. First operand 684 states and 1053 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-12 09:36:27,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:27,868 INFO L93 Difference]: Finished difference Result 684 states and 1051 transitions. [2020-11-12 09:36:27,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 09:36:27,869 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-12 09:36:27,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:27,870 INFO L225 Difference]: With dead ends: 684 [2020-11-12 09:36:27,870 INFO L226 Difference]: Without dead ends: 678 [2020-11-12 09:36:27,871 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-11-12 09:36:27,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2020-11-12 09:36:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 678. [2020-11-12 09:36:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 1.5317577548005907) internal successors, (1037), 677 states have internal predecessors, (1037), 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-12 09:36:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1037 transitions. [2020-11-12 09:36:27,881 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1037 transitions. Word has length 94 [2020-11-12 09:36:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:27,881 INFO L481 AbstractCegarLoop]: Abstraction has 678 states and 1037 transitions. [2020-11-12 09:36:27,882 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-12 09:36:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1037 transitions. [2020-11-12 09:36:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-12 09:36:27,883 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:27,883 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-12 09:36:27,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-12 09:36:27,884 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-12 09:36:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:27,884 INFO L82 PathProgramCache]: Analyzing trace with hash 109778252, now seen corresponding path program 1 times [2020-11-12 09:36:27,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:27,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657457390] [2020-11-12 09:36:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:28,031 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-12 09:36:28,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657457390] [2020-11-12 09:36:28,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:28,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 09:36:28,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614361309] [2020-11-12 09:36:28,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 09:36:28,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:28,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 09:36:28,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-12 09:36:28,034 INFO L87 Difference]: Start difference. First operand 678 states and 1037 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-12 09:36:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:28,288 INFO L93 Difference]: Finished difference Result 678 states and 1035 transitions. [2020-11-12 09:36:28,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 09:36:28,289 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-12 09:36:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:28,291 INFO L225 Difference]: With dead ends: 678 [2020-11-12 09:36:28,291 INFO L226 Difference]: Without dead ends: 672 [2020-11-12 09:36:28,291 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-11-12 09:36:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-11-12 09:36:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2020-11-12 09:36:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 1.518628912071535) internal successors, (1019), 671 states have internal predecessors, (1019), 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-12 09:36:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1019 transitions. [2020-11-12 09:36:28,301 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1019 transitions. Word has length 94 [2020-11-12 09:36:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:28,301 INFO L481 AbstractCegarLoop]: Abstraction has 672 states and 1019 transitions. [2020-11-12 09:36:28,301 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-12 09:36:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1019 transitions. [2020-11-12 09:36:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-12 09:36:28,302 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 09:36:28,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-12 09:36:28,303 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-12 09:36:28,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:28,303 INFO L82 PathProgramCache]: Analyzing trace with hash 446908228, now seen corresponding path program 1 times [2020-11-12 09:36:28,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:28,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749772488] [2020-11-12 09:36:28,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:28,880 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-12 09:36:28,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749772488] [2020-11-12 09:36:28,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:28,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-12 09:36:28,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705561025] [2020-11-12 09:36:28,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-12 09:36:28,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:28,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-12 09:36:28,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-11-12 09:36:28,882 INFO L87 Difference]: Start difference. First operand 672 states and 1019 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 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-12 09:36:29,533 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2020-11-12 09:36:29,698 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2020-11-12 09:36:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:30,463 INFO L93 Difference]: Finished difference Result 766 states and 1176 transitions. [2020-11-12 09:36:30,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-12 09:36:30,464 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 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-12 09:36:30,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:30,465 INFO L225 Difference]: With dead ends: 766 [2020-11-12 09:36:30,465 INFO L226 Difference]: Without dead ends: 757 [2020-11-12 09:36:30,466 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=656, Unknown=0, NotChecked=0, Total=930 [2020-11-12 09:36:30,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2020-11-12 09:36:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 670. [2020-11-12 09:36:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 1.5201793721973094) internal successors, (1017), 669 states have internal predecessors, (1017), 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-12 09:36:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1017 transitions. [2020-11-12 09:36:30,475 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1017 transitions. Word has length 94 [2020-11-12 09:36:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:30,475 INFO L481 AbstractCegarLoop]: Abstraction has 670 states and 1017 transitions. [2020-11-12 09:36:30,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 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-12 09:36:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1017 transitions. [2020-11-12 09:36:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-12 09:36:30,477 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:30,477 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-12 09:36:30,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-12 09:36:30,477 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-12 09:36:30,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:30,478 INFO L82 PathProgramCache]: Analyzing trace with hash -131349735, now seen corresponding path program 1 times [2020-11-12 09:36:30,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:30,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201426169] [2020-11-12 09:36:30,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:30,622 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-12 09:36:30,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201426169] [2020-11-12 09:36:30,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:30,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 09:36:30,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204073249] [2020-11-12 09:36:30,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 09:36:30,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:30,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 09:36:30,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-12 09:36:30,624 INFO L87 Difference]: Start difference. First operand 670 states and 1017 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-12 09:36:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:30,891 INFO L93 Difference]: Finished difference Result 670 states and 1015 transitions. [2020-11-12 09:36:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 09:36:30,891 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-12 09:36:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:30,893 INFO L225 Difference]: With dead ends: 670 [2020-11-12 09:36:30,893 INFO L226 Difference]: Without dead ends: 560 [2020-11-12 09:36:30,893 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-11-12 09:36:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-11-12 09:36:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2020-11-12 09:36:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.4293381037567083) internal successors, (799), 559 states have internal predecessors, (799), 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-12 09:36:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 799 transitions. [2020-11-12 09:36:30,901 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 799 transitions. Word has length 94 [2020-11-12 09:36:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:30,902 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 799 transitions. [2020-11-12 09:36:30,902 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-12 09:36:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 799 transitions. [2020-11-12 09:36:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-12 09:36:30,903 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:30,904 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-12 09:36:30,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-12 09:36:30,904 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-12 09:36:30,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:30,904 INFO L82 PathProgramCache]: Analyzing trace with hash 416910425, now seen corresponding path program 1 times [2020-11-12 09:36:30,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:30,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420494599] [2020-11-12 09:36:30,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 09:36:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 09:36:31,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420494599] [2020-11-12 09:36:31,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 09:36:31,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-12 09:36:31,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159712482] [2020-11-12 09:36:31,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 09:36:31,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 09:36:31,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 09:36:31,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-12 09:36:31,172 INFO L87 Difference]: Start difference. First operand 560 states and 799 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-12 09:36:31,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 09:36:31,527 INFO L93 Difference]: Finished difference Result 560 states and 797 transitions. [2020-11-12 09:36:31,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-12 09:36:31,528 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-12 09:36:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 09:36:31,529 INFO L225 Difference]: With dead ends: 560 [2020-11-12 09:36:31,529 INFO L226 Difference]: Without dead ends: 551 [2020-11-12 09:36:31,530 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 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-12 09:36:31,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-11-12 09:36:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2020-11-12 09:36:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.4163636363636363) internal successors, (779), 550 states have internal predecessors, (779), 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-12 09:36:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 779 transitions. [2020-11-12 09:36:31,537 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 779 transitions. Word has length 94 [2020-11-12 09:36:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 09:36:31,538 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 779 transitions. [2020-11-12 09:36:31,538 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-12 09:36:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 779 transitions. [2020-11-12 09:36:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-12 09:36:31,539 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 09:36:31,539 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-12 09:36:31,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-12 09:36:31,539 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-12 09:36:31,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 09:36:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash 720648537, now seen corresponding path program 1 times [2020-11-12 09:36:31,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 09:36:31,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372004434] [2020-11-12 09:36:31,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 09:36:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 09:36:31,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 09:36:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 09:36:31,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 09:36:31,650 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-12 09:36:31,650 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-12 09:36:31,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-12 09:36:31,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 09:36:31 BasicIcfg [2020-11-12 09:36:31,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-12 09:36:31,835 INFO L168 Benchmark]: Toolchain (without parser) took 76459.84 ms. Allocated memory was 302.0 MB in the beginning and 11.6 GB in the end (delta: 11.3 GB). Free memory was 276.1 MB in the beginning and 5.9 GB in the end (delta: -5.6 GB). Peak memory consumption was 5.7 GB. Max. memory is 16.0 GB. [2020-11-12 09:36:31,835 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.0 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-12 09:36:31,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1110.20 ms. Allocated memory is still 302.0 MB. Free memory was 275.4 MB in the beginning and 239.5 MB in the end (delta: 35.9 MB). Peak memory consumption was 38.4 MB. Max. memory is 16.0 GB. [2020-11-12 09:36:31,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.55 ms. Allocated memory is still 302.0 MB. Free memory was 239.5 MB in the beginning and 237.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-12 09:36:31,837 INFO L168 Benchmark]: Boogie Preprocessor took 31.60 ms. Allocated memory is still 302.0 MB. Free memory was 237.4 MB in the beginning and 236.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2020-11-12 09:36:31,837 INFO L168 Benchmark]: RCFGBuilder took 525.92 ms. Allocated memory is still 302.0 MB. Free memory was 236.4 MB in the beginning and 209.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. [2020-11-12 09:36:31,837 INFO L168 Benchmark]: TraceAbstraction took 74688.11 ms. Allocated memory was 302.0 MB in the beginning and 11.6 GB in the end (delta: 11.3 GB). Free memory was 208.1 MB in the beginning and 5.9 GB in the end (delta: -5.7 GB). Peak memory consumption was 5.6 GB. Max. memory is 16.0 GB. [2020-11-12 09:36:31,839 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.20 ms. Allocated memory is still 302.0 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 1110.20 ms. Allocated memory is still 302.0 MB. Free memory was 275.4 MB in the beginning and 239.5 MB in the end (delta: 35.9 MB). Peak memory consumption was 38.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 87.55 ms. Allocated memory is still 302.0 MB. Free memory was 239.5 MB in the beginning and 237.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 31.60 ms. Allocated memory is still 302.0 MB. Free memory was 237.4 MB in the beginning and 236.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 525.92 ms. Allocated memory is still 302.0 MB. Free memory was 236.4 MB in the beginning and 209.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 74688.11 ms. Allocated memory was 302.0 MB in the beginning and 11.6 GB in the end (delta: 11.3 GB). Free memory was 208.1 MB in the beginning and 5.9 GB in the end (delta: -5.7 GB). Peak memory consumption was 5.6 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}, 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}, 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 [\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}] [L1127] 5 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}, 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}, 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}, 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}, 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 [\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}] [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}, 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(t2)=1, \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}] [L1145] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \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] 1 \read(t3) 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: 74.1s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 34.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.2s, HoareTripleCheckerStatistics: 5834 SDtfs, 16294 SDslu, 26282 SDs, 0 SdLazy, 13123 SolverSat, 2041 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 886 GetRequests, 107 SyntacticMatches, 12 SemanticMatches, 767 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2730 ImplicationChecksByTransitivity, 21.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281751occurred 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: 12.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 109465 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 2397 NumberOfCodeBlocks, 2397 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2265 ConstructedInterpolants, 0 QuantifiedInterpolants, 1243519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...