/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9b7772ad7705253c1305067fc38dc9bc7271fbe3-9b7772a [2021-04-14 23:52:54,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-14 23:52:54,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-14 23:52:54,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-14 23:52:54,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-14 23:52:54,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-14 23:52:54,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-14 23:52:54,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-14 23:52:54,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-14 23:52:54,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-14 23:52:54,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-14 23:52:54,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-14 23:52:54,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-14 23:52:54,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-14 23:52:54,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-14 23:52:54,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-14 23:52:54,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-14 23:52:54,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-14 23:52:54,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-14 23:52:54,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-14 23:52:54,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-14 23:52:54,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-14 23:52:54,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-14 23:52:54,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-14 23:52:54,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-14 23:52:54,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-14 23:52:54,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-14 23:52:54,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-14 23:52:54,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-14 23:52:54,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-14 23:52:54,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-14 23:52:54,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-14 23:52:54,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-14 23:52:54,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-14 23:52:54,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-14 23:52:54,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-14 23:52:54,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-14 23:52:54,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-14 23:52:54,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-14 23:52:54,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-14 23:52:54,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-14 23:52:54,583 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-04-14 23:52:54,619 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-14 23:52:54,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-14 23:52:54,620 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-04-14 23:52:54,620 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-04-14 23:52:54,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-14 23:52:54,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-14 23:52:54,623 INFO L138 SettingsManager]: * Use SBE=true [2021-04-14 23:52:54,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-14 23:52:54,624 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-14 23:52:54,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-14 23:52:54,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-14 23:52:54,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-14 23:52:54,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-14 23:52:54,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-14 23:52:54,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-14 23:52:54,625 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-14 23:52:54,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-14 23:52:54,625 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-14 23:52:54,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-14 23:52:54,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-14 23:52:54,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-14 23:52:54,626 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-14 23:52:54,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-14 23:52:54,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-14 23:52:54,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-14 23:52:54,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-14 23:52:54,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-14 23:52:54,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-14 23:52:54,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-14 23:52:54,627 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-04-14 23:52:54,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-04-14 23:52:54,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-04-14 23:52:54,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-14 23:52:54,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-14 23:52:54,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-14 23:52:54,973 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-14 23:52:54,974 INFO L275 PluginConnector]: CDTParser initialized [2021-04-14 23:52:54,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2021-04-14 23:52:55,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9812de82/929c0737d5a4461da842bbde8b9425da/FLAGfcfeb09ca [2021-04-14 23:52:55,558 INFO L306 CDTParser]: Found 1 translation units. [2021-04-14 23:52:55,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2021-04-14 23:52:55,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9812de82/929c0737d5a4461da842bbde8b9425da/FLAGfcfeb09ca [2021-04-14 23:52:56,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9812de82/929c0737d5a4461da842bbde8b9425da [2021-04-14 23:52:56,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-14 23:52:56,022 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-14 23:52:56,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-14 23:52:56,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-14 23:52:56,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-14 23:52:56,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:52:56" (1/1) ... [2021-04-14 23:52:56,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786c1448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:52:56, skipping insertion in model container [2021-04-14 23:52:56,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 11:52:56" (1/1) ... [2021-04-14 23:52:56,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-14 23:52:56,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-14 23:52:56,235 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-04-14 23:52:56,470 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2021-04-14 23:52:56,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-14 23:52:56,505 INFO L203 MainTranslator]: Completed pre-run [2021-04-14 23:52:56,533 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-04-14 23:52:56,545 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i[55547,55560] [2021-04-14 23:52:56,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-14 23:52:56,691 INFO L208 MainTranslator]: Completed translation [2021-04-14 23:52:56,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:52:56 WrapperNode [2021-04-14 23:52:56,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-14 23:52:56,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-14 23:52:56,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-14 23:52:56,694 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-14 23:52:56,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:52:56" (1/1) ... [2021-04-14 23:52:56,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:52:56" (1/1) ... [2021-04-14 23:52:56,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-14 23:52:56,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-14 23:52:56,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-14 23:52:56,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-14 23:52:56,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:52:56" (1/1) ... [2021-04-14 23:52:56,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:52:56" (1/1) ... [2021-04-14 23:52:56,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:52:56" (1/1) ... [2021-04-14 23:52:56,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:52:56" (1/1) ... [2021-04-14 23:52:56,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:52:56" (1/1) ... [2021-04-14 23:52:56,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:52:56" (1/1) ... [2021-04-14 23:52:56,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:52:56" (1/1) ... [2021-04-14 23:52:56,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-14 23:52:56,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-14 23:52:56,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-14 23:52:56,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-14 23:52:56,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:52:56" (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 [2021-04-14 23:52:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-14 23:52:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-14 23:52:56,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-14 23:52:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-14 23:52:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-04-14 23:52:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-04-14 23:52:56,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-04-14 23:52:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-04-14 23:52:56,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-04-14 23:52:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-04-14 23:52:56,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-04-14 23:52:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-04-14 23:52:56,859 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-04-14 23:52:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-14 23:52:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-04-14 23:52:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-14 23:52:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-14 23:52:56,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-14 23:52:56,861 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-14 23:52:57,240 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-14 23:52:57,241 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-04-14 23:52:57,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:52:57 BoogieIcfgContainer [2021-04-14 23:52:57,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-14 23:52:57,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-14 23:52:57,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-14 23:52:57,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-14 23:52:57,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 11:52:56" (1/3) ... [2021-04-14 23:52:57,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b68a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:52:57, skipping insertion in model container [2021-04-14 23:52:57,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 11:52:56" (2/3) ... [2021-04-14 23:52:57,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b68a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 11:52:57, skipping insertion in model container [2021-04-14 23:52:57,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 11:52:57" (3/3) ... [2021-04-14 23:52:57,248 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2021-04-14 23:52:57,253 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-04-14 23:52:57,253 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-14 23:52:57,256 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-04-14 23:52:57,257 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-14 23:52:57,301 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,301 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,301 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,302 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,305 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,306 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,306 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,306 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,306 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,307 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,307 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,308 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,308 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,308 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,308 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,308 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,308 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,309 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,309 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,309 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,309 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,309 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,310 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,310 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,310 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,311 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,311 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,312 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,312 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,312 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,313 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,313 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,313 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,313 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,314 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,314 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,314 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,315 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,315 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,315 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,316 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,317 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,317 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,317 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,317 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,317 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,317 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,317 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,318 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,318 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,318 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,318 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,318 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,319 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,319 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,319 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,319 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,320 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,320 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,320 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,320 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,320 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,320 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,320 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,321 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,322 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,323 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,324 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,325 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,325 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,327 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,328 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,328 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,329 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,334 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,334 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,334 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,334 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,334 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,335 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,336 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,336 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,336 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,336 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,336 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,336 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,336 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,336 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,336 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,336 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,337 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,337 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,337 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,337 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,337 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,337 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,337 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,337 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,338 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,338 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,339 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,339 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,339 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,339 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,340 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,340 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,340 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,340 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,340 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,340 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,340 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,340 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,341 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,341 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,341 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,341 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,341 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,341 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,342 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,342 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,342 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,342 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,343 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,343 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,343 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,343 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,343 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,344 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,344 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,344 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,344 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,344 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,344 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,344 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,344 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,344 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,345 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,345 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,345 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,345 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,345 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,345 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,345 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,345 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,345 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,345 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,346 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,346 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,346 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,346 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,346 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,346 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,346 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,346 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,347 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,347 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,347 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,347 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,348 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,348 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,348 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,348 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,348 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,348 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,348 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,348 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,349 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,349 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,349 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,349 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,353 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,353 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,353 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,353 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,358 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,358 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,358 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,358 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,360 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,360 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,360 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,361 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,362 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,362 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,362 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,362 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,363 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,363 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,370 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,376 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,376 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,376 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,376 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,377 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,378 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,378 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,378 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,378 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,378 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,378 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,378 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,378 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,378 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,382 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,382 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,382 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,382 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,386 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,386 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,386 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,386 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,386 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,387 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,388 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,388 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,388 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,389 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,390 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,390 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,391 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,391 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,393 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,393 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,393 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,393 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,394 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,394 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,394 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,394 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-14 23:52:57,513 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-04-14 23:52:57,527 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-04-14 23:52:57,545 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-14 23:52:57,546 INFO L377 AbstractCegarLoop]: Hoare is true [2021-04-14 23:52:57,546 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-14 23:52:57,546 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-14 23:52:57,546 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-14 23:52:57,546 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-14 23:52:57,546 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-14 23:52:57,546 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-14 23:52:57,557 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 167 places, 248 transitions, 876 flow [2021-04-14 23:53:01,188 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 49592 states, 49586 states have (on average 4.294074940507401) internal successors, (212926), 49591 states have internal predecessors, (212926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 49592 states, 49586 states have (on average 4.294074940507401) internal successors, (212926), 49591 states have internal predecessors, (212926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:01,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-04-14 23:53:01,489 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:01,490 INFO L551 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] [2021-04-14 23:53:01,490 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:01,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1059109486, now seen corresponding path program 1 times [2021-04-14 23:53:01,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:01,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630536913] [2021-04-14 23:53:01,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:01,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630536913] [2021-04-14 23:53:01,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:01,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-14 23:53:01,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662560965] [2021-04-14 23:53:01,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-14 23:53:01,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:01,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-14 23:53:01,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-14 23:53:01,954 INFO L87 Difference]: Start difference. First operand has 49592 states, 49586 states have (on average 4.294074940507401) internal successors, (212926), 49591 states have internal predecessors, (212926), 0 states have call successors, (0), 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 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:03,084 INFO L93 Difference]: Finished difference Result 53974 states and 232575 transitions. [2021-04-14 23:53:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-14 23:53:03,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-04-14 23:53:03,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:03,590 INFO L225 Difference]: With dead ends: 53974 [2021-04-14 23:53:03,590 INFO L226 Difference]: Without dead ends: 38049 [2021-04-14 23:53:03,591 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 108.1ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-04-14 23:53:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38049 states. [2021-04-14 23:53:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38049 to 31410. [2021-04-14 23:53:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31410 states, 31407 states have (on average 4.324641003597924) internal successors, (135824), 31409 states have internal predecessors, (135824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31410 states to 31410 states and 135824 transitions. [2021-04-14 23:53:05,384 INFO L78 Accepts]: Start accepts. Automaton has 31410 states and 135824 transitions. Word has length 36 [2021-04-14 23:53:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:05,385 INFO L480 AbstractCegarLoop]: Abstraction has 31410 states and 135824 transitions. [2021-04-14 23:53:05,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 31410 states and 135824 transitions. [2021-04-14 23:53:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-04-14 23:53:05,391 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:05,391 INFO L551 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] [2021-04-14 23:53:05,392 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-14 23:53:05,392 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:05,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:05,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2041563374, now seen corresponding path program 2 times [2021-04-14 23:53:05,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:05,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170811513] [2021-04-14 23:53:05,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:05,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170811513] [2021-04-14 23:53:05,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:05,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-14 23:53:05,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22196026] [2021-04-14 23:53:05,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-14 23:53:05,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:05,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-14 23:53:05,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-14 23:53:05,526 INFO L87 Difference]: Start difference. First operand 31410 states and 135824 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:06,494 INFO L93 Difference]: Finished difference Result 44662 states and 198283 transitions. [2021-04-14 23:53:06,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-14 23:53:06,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-04-14 23:53:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:06,978 INFO L225 Difference]: With dead ends: 44662 [2021-04-14 23:53:06,979 INFO L226 Difference]: Without dead ends: 44662 [2021-04-14 23:53:06,979 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 106.0ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-04-14 23:53:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44662 states. [2021-04-14 23:53:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44662 to 31368. [2021-04-14 23:53:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31368 states, 31366 states have (on average 4.327998469680546) internal successors, (135752), 31367 states have internal predecessors, (135752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31368 states to 31368 states and 135752 transitions. [2021-04-14 23:53:08,232 INFO L78 Accepts]: Start accepts. Automaton has 31368 states and 135752 transitions. Word has length 36 [2021-04-14 23:53:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:08,233 INFO L480 AbstractCegarLoop]: Abstraction has 31368 states and 135752 transitions. [2021-04-14 23:53:08,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 31368 states and 135752 transitions. [2021-04-14 23:53:08,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-04-14 23:53:08,238 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:08,238 INFO L551 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] [2021-04-14 23:53:08,238 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-14 23:53:08,239 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:08,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:08,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1496732557, now seen corresponding path program 1 times [2021-04-14 23:53:08,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:08,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570558637] [2021-04-14 23:53:08,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:08,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570558637] [2021-04-14 23:53:08,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:08,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-14 23:53:08,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090963002] [2021-04-14 23:53:08,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-14 23:53:08,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:08,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-14 23:53:08,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-14 23:53:08,308 INFO L87 Difference]: Start difference. First operand 31368 states and 135752 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:09,216 INFO L93 Difference]: Finished difference Result 67824 states and 285630 transitions. [2021-04-14 23:53:09,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-14 23:53:09,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2021-04-14 23:53:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:09,389 INFO L225 Difference]: With dead ends: 67824 [2021-04-14 23:53:09,389 INFO L226 Difference]: Without dead ends: 41890 [2021-04-14 23:53:09,389 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 47.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-14 23:53:09,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41890 states. [2021-04-14 23:53:10,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41890 to 32368. [2021-04-14 23:53:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32368 states, 32366 states have (on average 4.169251683865785) internal successors, (134942), 32367 states have internal predecessors, (134942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32368 states to 32368 states and 134942 transitions. [2021-04-14 23:53:10,922 INFO L78 Accepts]: Start accepts. Automaton has 32368 states and 134942 transitions. Word has length 46 [2021-04-14 23:53:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:10,922 INFO L480 AbstractCegarLoop]: Abstraction has 32368 states and 134942 transitions. [2021-04-14 23:53:10,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:10,923 INFO L276 IsEmpty]: Start isEmpty. Operand 32368 states and 134942 transitions. [2021-04-14 23:53:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-04-14 23:53:10,934 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:10,934 INFO L551 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] [2021-04-14 23:53:10,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-14 23:53:10,935 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:10,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:10,935 INFO L82 PathProgramCache]: Analyzing trace with hash 103767506, now seen corresponding path program 1 times [2021-04-14 23:53:10,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:10,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240620724] [2021-04-14 23:53:10,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:11,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240620724] [2021-04-14 23:53:11,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:11,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-14 23:53:11,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559167572] [2021-04-14 23:53:11,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-14 23:53:11,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:11,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-14 23:53:11,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-14 23:53:11,018 INFO L87 Difference]: Start difference. First operand 32368 states and 134942 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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) [2021-04-14 23:53:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:11,428 INFO L93 Difference]: Finished difference Result 39186 states and 163720 transitions. [2021-04-14 23:53:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-14 23:53:11,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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 [2021-04-14 23:53:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:11,590 INFO L225 Difference]: With dead ends: 39186 [2021-04-14 23:53:11,591 INFO L226 Difference]: Without dead ends: 39114 [2021-04-14 23:53:11,595 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 84.7ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-04-14 23:53:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39114 states. [2021-04-14 23:53:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39114 to 35471. [2021-04-14 23:53:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35471 states, 35469 states have (on average 4.207899856212467) internal successors, (149250), 35470 states have internal predecessors, (149250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35471 states to 35471 states and 149250 transitions. [2021-04-14 23:53:12,810 INFO L78 Accepts]: Start accepts. Automaton has 35471 states and 149250 transitions. Word has length 48 [2021-04-14 23:53:12,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:12,811 INFO L480 AbstractCegarLoop]: Abstraction has 35471 states and 149250 transitions. [2021-04-14 23:53:12,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 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) [2021-04-14 23:53:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 35471 states and 149250 transitions. [2021-04-14 23:53:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-04-14 23:53:12,824 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:12,824 INFO L551 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] [2021-04-14 23:53:12,825 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-14 23:53:12,825 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:12,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:12,825 INFO L82 PathProgramCache]: Analyzing trace with hash 483318952, now seen corresponding path program 2 times [2021-04-14 23:53:12,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:12,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636130667] [2021-04-14 23:53:12,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:12,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636130667] [2021-04-14 23:53:12,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:12,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-14 23:53:12,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803452234] [2021-04-14 23:53:12,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-14 23:53:12,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:12,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-14 23:53:12,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-04-14 23:53:12,922 INFO L87 Difference]: Start difference. First operand 35471 states and 149250 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 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) [2021-04-14 23:53:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:13,898 INFO L93 Difference]: Finished difference Result 49953 states and 204492 transitions. [2021-04-14 23:53:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-14 23:53:13,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 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 [2021-04-14 23:53:13,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:14,023 INFO L225 Difference]: With dead ends: 49953 [2021-04-14 23:53:14,024 INFO L226 Difference]: Without dead ends: 45137 [2021-04-14 23:53:14,024 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 194.0ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-04-14 23:53:14,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45137 states. [2021-04-14 23:53:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45137 to 35386. [2021-04-14 23:53:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35386 states, 35384 states have (on average 4.210716708116663) internal successors, (148992), 35385 states have internal predecessors, (148992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35386 states to 35386 states and 148992 transitions. [2021-04-14 23:53:15,118 INFO L78 Accepts]: Start accepts. Automaton has 35386 states and 148992 transitions. Word has length 48 [2021-04-14 23:53:15,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:15,118 INFO L480 AbstractCegarLoop]: Abstraction has 35386 states and 148992 transitions. [2021-04-14 23:53:15,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 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) [2021-04-14 23:53:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 35386 states and 148992 transitions. [2021-04-14 23:53:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-04-14 23:53:15,132 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:15,132 INFO L551 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] [2021-04-14 23:53:15,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-14 23:53:15,133 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:15,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1103313367, now seen corresponding path program 1 times [2021-04-14 23:53:15,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:15,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205211635] [2021-04-14 23:53:15,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:15,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:15,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205211635] [2021-04-14 23:53:15,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:15,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-14 23:53:15,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601486132] [2021-04-14 23:53:15,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-14 23:53:15,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:15,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-14 23:53:15,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-14 23:53:15,236 INFO L87 Difference]: Start difference. First operand 35386 states and 148992 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:16,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:16,016 INFO L93 Difference]: Finished difference Result 38273 states and 158862 transitions. [2021-04-14 23:53:16,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-14 23:53:16,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-04-14 23:53:16,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:16,143 INFO L225 Difference]: With dead ends: 38273 [2021-04-14 23:53:16,143 INFO L226 Difference]: Without dead ends: 37793 [2021-04-14 23:53:16,144 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 83.0ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-04-14 23:53:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37793 states. [2021-04-14 23:53:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37793 to 36097. [2021-04-14 23:53:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36097 states, 36095 states have (on average 4.182518354342707) internal successors, (150968), 36096 states have internal predecessors, (150968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36097 states to 36097 states and 150968 transitions. [2021-04-14 23:53:17,311 INFO L78 Accepts]: Start accepts. Automaton has 36097 states and 150968 transitions. Word has length 49 [2021-04-14 23:53:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:17,311 INFO L480 AbstractCegarLoop]: Abstraction has 36097 states and 150968 transitions. [2021-04-14 23:53:17,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 36097 states and 150968 transitions. [2021-04-14 23:53:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-04-14 23:53:17,324 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:17,324 INFO L551 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] [2021-04-14 23:53:17,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-14 23:53:17,324 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash 545647439, now seen corresponding path program 2 times [2021-04-14 23:53:17,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:17,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599925193] [2021-04-14 23:53:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:17,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599925193] [2021-04-14 23:53:17,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:17,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-04-14 23:53:17,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487527590] [2021-04-14 23:53:17,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-04-14 23:53:17,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:17,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-04-14 23:53:17,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-04-14 23:53:17,609 INFO L87 Difference]: Start difference. First operand 36097 states and 150968 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:18,905 INFO L93 Difference]: Finished difference Result 43008 states and 180471 transitions. [2021-04-14 23:53:18,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-04-14 23:53:18,906 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-04-14 23:53:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:19,130 INFO L225 Difference]: With dead ends: 43008 [2021-04-14 23:53:19,130 INFO L226 Difference]: Without dead ends: 42762 [2021-04-14 23:53:19,130 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 533.0ms TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2021-04-14 23:53:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42762 states. [2021-04-14 23:53:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42762 to 39106. [2021-04-14 23:53:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39106 states, 39104 states have (on average 4.233735679214402) internal successors, (165556), 39105 states have internal predecessors, (165556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39106 states to 39106 states and 165556 transitions. [2021-04-14 23:53:20,282 INFO L78 Accepts]: Start accepts. Automaton has 39106 states and 165556 transitions. Word has length 49 [2021-04-14 23:53:20,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:20,283 INFO L480 AbstractCegarLoop]: Abstraction has 39106 states and 165556 transitions. [2021-04-14 23:53:20,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:20,283 INFO L276 IsEmpty]: Start isEmpty. Operand 39106 states and 165556 transitions. [2021-04-14 23:53:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-04-14 23:53:20,298 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:20,298 INFO L551 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] [2021-04-14 23:53:20,298 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-14 23:53:20,298 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:20,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:20,298 INFO L82 PathProgramCache]: Analyzing trace with hash -567913207, now seen corresponding path program 3 times [2021-04-14 23:53:20,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:20,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71689169] [2021-04-14 23:53:20,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:20,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71689169] [2021-04-14 23:53:20,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:20,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-14 23:53:20,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769689489] [2021-04-14 23:53:20,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-14 23:53:20,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:20,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-14 23:53:20,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-04-14 23:53:20,428 INFO L87 Difference]: Start difference. First operand 39106 states and 165556 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:20,947 INFO L93 Difference]: Finished difference Result 52392 states and 222067 transitions. [2021-04-14 23:53:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-04-14 23:53:20,947 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-04-14 23:53:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:21,099 INFO L225 Difference]: With dead ends: 52392 [2021-04-14 23:53:21,099 INFO L226 Difference]: Without dead ends: 52146 [2021-04-14 23:53:21,100 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 171.4ms TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2021-04-14 23:53:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52146 states. [2021-04-14 23:53:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52146 to 39033. [2021-04-14 23:53:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39033 states, 39031 states have (on average 4.235838179908278) internal successors, (165329), 39032 states have internal predecessors, (165329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39033 states to 39033 states and 165329 transitions. [2021-04-14 23:53:22,470 INFO L78 Accepts]: Start accepts. Automaton has 39033 states and 165329 transitions. Word has length 49 [2021-04-14 23:53:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:22,470 INFO L480 AbstractCegarLoop]: Abstraction has 39033 states and 165329 transitions. [2021-04-14 23:53:22,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:22,470 INFO L276 IsEmpty]: Start isEmpty. Operand 39033 states and 165329 transitions. [2021-04-14 23:53:22,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-04-14 23:53:22,489 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:22,490 INFO L551 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] [2021-04-14 23:53:22,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-14 23:53:22,490 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:22,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:22,490 INFO L82 PathProgramCache]: Analyzing trace with hash -754092592, now seen corresponding path program 1 times [2021-04-14 23:53:22,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:22,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768729094] [2021-04-14 23:53:22,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:23,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768729094] [2021-04-14 23:53:23,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:23,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-04-14 23:53:23,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199339440] [2021-04-14 23:53:23,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-04-14 23:53:23,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:23,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-04-14 23:53:23,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-04-14 23:53:23,235 INFO L87 Difference]: Start difference. First operand 39033 states and 165329 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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) [2021-04-14 23:53:24,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:24,174 INFO L93 Difference]: Finished difference Result 49392 states and 211278 transitions. [2021-04-14 23:53:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-14 23:53:24,175 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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 [2021-04-14 23:53:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:24,301 INFO L225 Difference]: With dead ends: 49392 [2021-04-14 23:53:24,301 INFO L226 Difference]: Without dead ends: 49146 [2021-04-14 23:53:24,302 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 882.3ms TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2021-04-14 23:53:24,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49146 states. [2021-04-14 23:53:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49146 to 38558. [2021-04-14 23:53:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38558 states, 38556 states have (on average 4.239988588027804) internal successors, (163477), 38557 states have internal predecessors, (163477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38558 states to 38558 states and 163477 transitions. [2021-04-14 23:53:25,434 INFO L78 Accepts]: Start accepts. Automaton has 38558 states and 163477 transitions. Word has length 51 [2021-04-14 23:53:25,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:25,434 INFO L480 AbstractCegarLoop]: Abstraction has 38558 states and 163477 transitions. [2021-04-14 23:53:25,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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) [2021-04-14 23:53:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 38558 states and 163477 transitions. [2021-04-14 23:53:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-04-14 23:53:25,454 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:25,454 INFO L551 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] [2021-04-14 23:53:25,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-14 23:53:25,454 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:25,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2025602595, now seen corresponding path program 1 times [2021-04-14 23:53:25,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:25,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112298494] [2021-04-14 23:53:25,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:25,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112298494] [2021-04-14 23:53:25,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:25,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-14 23:53:25,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879260208] [2021-04-14 23:53:25,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-14 23:53:25,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:25,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-14 23:53:25,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-04-14 23:53:25,530 INFO L87 Difference]: Start difference. First operand 38558 states and 163477 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:26,386 INFO L93 Difference]: Finished difference Result 53401 states and 220011 transitions. [2021-04-14 23:53:26,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-14 23:53:26,386 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-04-14 23:53:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:26,519 INFO L225 Difference]: With dead ends: 53401 [2021-04-14 23:53:26,519 INFO L226 Difference]: Without dead ends: 48569 [2021-04-14 23:53:26,519 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 121.5ms TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2021-04-14 23:53:26,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48569 states. [2021-04-14 23:53:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48569 to 38658. [2021-04-14 23:53:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38658 states, 38656 states have (on average 4.2379449503311255) internal successors, (163822), 38657 states have internal predecessors, (163822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38658 states to 38658 states and 163822 transitions. [2021-04-14 23:53:27,722 INFO L78 Accepts]: Start accepts. Automaton has 38658 states and 163822 transitions. Word has length 51 [2021-04-14 23:53:27,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:27,722 INFO L480 AbstractCegarLoop]: Abstraction has 38658 states and 163822 transitions. [2021-04-14 23:53:27,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 38658 states and 163822 transitions. [2021-04-14 23:53:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-04-14 23:53:27,749 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:27,749 INFO L551 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] [2021-04-14 23:53:27,749 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-14 23:53:27,749 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:27,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:27,749 INFO L82 PathProgramCache]: Analyzing trace with hash 758939197, now seen corresponding path program 1 times [2021-04-14 23:53:27,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:27,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900100206] [2021-04-14 23:53:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:27,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900100206] [2021-04-14 23:53:27,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:27,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-14 23:53:27,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956974797] [2021-04-14 23:53:27,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-14 23:53:27,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:27,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-14 23:53:27,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-04-14 23:53:27,950 INFO L87 Difference]: Start difference. First operand 38658 states and 163822 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) [2021-04-14 23:53:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:28,658 INFO L93 Difference]: Finished difference Result 44638 states and 188037 transitions. [2021-04-14 23:53:28,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-14 23:53:28,658 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 [2021-04-14 23:53:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:28,780 INFO L225 Difference]: With dead ends: 44638 [2021-04-14 23:53:28,780 INFO L226 Difference]: Without dead ends: 44332 [2021-04-14 23:53:28,780 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 318.3ms TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2021-04-14 23:53:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44332 states. [2021-04-14 23:53:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44332 to 38658. [2021-04-14 23:53:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38658 states, 38656 states have (on average 4.2379449503311255) internal successors, (163822), 38657 states have internal predecessors, (163822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38658 states to 38658 states and 163822 transitions. [2021-04-14 23:53:29,958 INFO L78 Accepts]: Start accepts. Automaton has 38658 states and 163822 transitions. Word has length 51 [2021-04-14 23:53:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:29,958 INFO L480 AbstractCegarLoop]: Abstraction has 38658 states and 163822 transitions. [2021-04-14 23:53:29,958 INFO L481 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) [2021-04-14 23:53:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 38658 states and 163822 transitions. [2021-04-14 23:53:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-04-14 23:53:29,979 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:29,979 INFO L551 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] [2021-04-14 23:53:29,979 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-14 23:53:29,979 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:29,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:29,979 INFO L82 PathProgramCache]: Analyzing trace with hash -49790413, now seen corresponding path program 2 times [2021-04-14 23:53:29,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:29,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962259976] [2021-04-14 23:53:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:30,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962259976] [2021-04-14 23:53:30,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:30,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-04-14 23:53:30,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185499830] [2021-04-14 23:53:30,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-04-14 23:53:30,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:30,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-04-14 23:53:30,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-04-14 23:53:30,253 INFO L87 Difference]: Start difference. First operand 38658 states and 163822 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) [2021-04-14 23:53:30,752 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2021-04-14 23:53:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:31,445 INFO L93 Difference]: Finished difference Result 49465 states and 209301 transitions. [2021-04-14 23:53:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-14 23:53:31,445 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 [2021-04-14 23:53:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:31,582 INFO L225 Difference]: With dead ends: 49465 [2021-04-14 23:53:31,582 INFO L226 Difference]: Without dead ends: 49159 [2021-04-14 23:53:31,582 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 761.0ms TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2021-04-14 23:53:31,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49159 states. [2021-04-14 23:53:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49159 to 40434. [2021-04-14 23:53:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40434 states, 40432 states have (on average 4.261649188761377) internal successors, (172307), 40433 states have internal predecessors, (172307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40434 states to 40434 states and 172307 transitions. [2021-04-14 23:53:32,749 INFO L78 Accepts]: Start accepts. Automaton has 40434 states and 172307 transitions. Word has length 51 [2021-04-14 23:53:32,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:32,749 INFO L480 AbstractCegarLoop]: Abstraction has 40434 states and 172307 transitions. [2021-04-14 23:53:32,749 INFO L481 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) [2021-04-14 23:53:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 40434 states and 172307 transitions. [2021-04-14 23:53:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-04-14 23:53:32,768 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:32,768 INFO L551 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] [2021-04-14 23:53:32,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-14 23:53:32,768 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:32,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:32,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1505714710, now seen corresponding path program 1 times [2021-04-14 23:53:32,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:32,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282718783] [2021-04-14 23:53:32,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:32,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282718783] [2021-04-14 23:53:32,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:32,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-04-14 23:53:32,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015292898] [2021-04-14 23:53:32,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-04-14 23:53:32,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:32,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-04-14 23:53:32,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-04-14 23:53:32,993 INFO L87 Difference]: Start difference. First operand 40434 states and 172307 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) [2021-04-14 23:53:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:34,486 INFO L93 Difference]: Finished difference Result 57289 states and 243534 transitions. [2021-04-14 23:53:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-04-14 23:53:34,487 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 [2021-04-14 23:53:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:34,675 INFO L225 Difference]: With dead ends: 57289 [2021-04-14 23:53:34,675 INFO L226 Difference]: Without dead ends: 56983 [2021-04-14 23:53:34,675 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 607.3ms TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2021-04-14 23:53:34,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56983 states. [2021-04-14 23:53:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56983 to 40428. [2021-04-14 23:53:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40428 states, 40426 states have (on average 4.262034334339287) internal successors, (172297), 40427 states have internal predecessors, (172297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40428 states to 40428 states and 172297 transitions. [2021-04-14 23:53:36,006 INFO L78 Accepts]: Start accepts. Automaton has 40428 states and 172297 transitions. Word has length 51 [2021-04-14 23:53:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:36,006 INFO L480 AbstractCegarLoop]: Abstraction has 40428 states and 172297 transitions. [2021-04-14 23:53:36,006 INFO L481 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) [2021-04-14 23:53:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 40428 states and 172297 transitions. [2021-04-14 23:53:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-04-14 23:53:36,026 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:36,026 INFO L551 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] [2021-04-14 23:53:36,026 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-14 23:53:36,026 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:36,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:36,027 INFO L82 PathProgramCache]: Analyzing trace with hash -151253679, now seen corresponding path program 2 times [2021-04-14 23:53:36,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:36,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716962140] [2021-04-14 23:53:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:36,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716962140] [2021-04-14 23:53:36,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:36,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-14 23:53:36,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281846691] [2021-04-14 23:53:36,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-14 23:53:36,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:36,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-14 23:53:36,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-04-14 23:53:36,141 INFO L87 Difference]: Start difference. First operand 40428 states and 172297 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) [2021-04-14 23:53:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:36,648 INFO L93 Difference]: Finished difference Result 54695 states and 226695 transitions. [2021-04-14 23:53:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-14 23:53:36,648 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 [2021-04-14 23:53:36,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:36,783 INFO L225 Difference]: With dead ends: 54695 [2021-04-14 23:53:36,783 INFO L226 Difference]: Without dead ends: 49923 [2021-04-14 23:53:36,783 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 169.6ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-04-14 23:53:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49923 states. [2021-04-14 23:53:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49923 to 40137. [2021-04-14 23:53:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40137 states, 40135 states have (on average 4.265628503799676) internal successors, (171201), 40136 states have internal predecessors, (171201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40137 states to 40137 states and 171201 transitions. [2021-04-14 23:53:38,091 INFO L78 Accepts]: Start accepts. Automaton has 40137 states and 171201 transitions. Word has length 51 [2021-04-14 23:53:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:38,091 INFO L480 AbstractCegarLoop]: Abstraction has 40137 states and 171201 transitions. [2021-04-14 23:53:38,091 INFO L481 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) [2021-04-14 23:53:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 40137 states and 171201 transitions. [2021-04-14 23:53:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-04-14 23:53:38,110 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:38,110 INFO L551 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] [2021-04-14 23:53:38,110 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-14 23:53:38,110 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:38,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:38,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2029003256, now seen corresponding path program 2 times [2021-04-14 23:53:38,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:38,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551193091] [2021-04-14 23:53:38,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:38,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551193091] [2021-04-14 23:53:38,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:38,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-04-14 23:53:38,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114338760] [2021-04-14 23:53:38,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-04-14 23:53:38,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:38,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-04-14 23:53:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-04-14 23:53:38,766 INFO L87 Difference]: Start difference. First operand 40137 states and 171201 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 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) [2021-04-14 23:53:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:39,582 INFO L93 Difference]: Finished difference Result 52281 states and 221831 transitions. [2021-04-14 23:53:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-04-14 23:53:39,582 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 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 [2021-04-14 23:53:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:39,725 INFO L225 Difference]: With dead ends: 52281 [2021-04-14 23:53:39,725 INFO L226 Difference]: Without dead ends: 51975 [2021-04-14 23:53:39,726 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 857.0ms TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2021-04-14 23:53:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51975 states. [2021-04-14 23:53:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51975 to 37710. [2021-04-14 23:53:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37710 states, 37708 states have (on average 4.250875145857643) internal successors, (160292), 37709 states have internal predecessors, (160292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37710 states to 37710 states and 160292 transitions. [2021-04-14 23:53:40,968 INFO L78 Accepts]: Start accepts. Automaton has 37710 states and 160292 transitions. Word has length 51 [2021-04-14 23:53:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:40,968 INFO L480 AbstractCegarLoop]: Abstraction has 37710 states and 160292 transitions. [2021-04-14 23:53:40,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 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) [2021-04-14 23:53:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 37710 states and 160292 transitions. [2021-04-14 23:53:40,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-04-14 23:53:40,987 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:40,987 INFO L551 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] [2021-04-14 23:53:40,987 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-14 23:53:40,987 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:40,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:40,988 INFO L82 PathProgramCache]: Analyzing trace with hash -25477645, now seen corresponding path program 3 times [2021-04-14 23:53:40,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:40,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205158703] [2021-04-14 23:53:40,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:41,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205158703] [2021-04-14 23:53:41,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:41,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-14 23:53:41,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836708965] [2021-04-14 23:53:41,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-14 23:53:41,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:41,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-14 23:53:41,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-04-14 23:53:41,074 INFO L87 Difference]: Start difference. First operand 37710 states and 160292 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:41,830 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2021-04-14 23:53:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:41,845 INFO L93 Difference]: Finished difference Result 51735 states and 218583 transitions. [2021-04-14 23:53:41,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-14 23:53:41,845 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-04-14 23:53:41,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:42,077 INFO L225 Difference]: With dead ends: 51735 [2021-04-14 23:53:42,078 INFO L226 Difference]: Without dead ends: 51429 [2021-04-14 23:53:42,078 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 458.6ms TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-04-14 23:53:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51429 states. [2021-04-14 23:53:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51429 to 37552. [2021-04-14 23:53:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37552 states, 37550 states have (on average 4.257709720372836) internal successors, (159877), 37551 states have internal predecessors, (159877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37552 states to 37552 states and 159877 transitions. [2021-04-14 23:53:42,935 INFO L78 Accepts]: Start accepts. Automaton has 37552 states and 159877 transitions. Word has length 51 [2021-04-14 23:53:42,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:42,935 INFO L480 AbstractCegarLoop]: Abstraction has 37552 states and 159877 transitions. [2021-04-14 23:53:42,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:42,935 INFO L276 IsEmpty]: Start isEmpty. Operand 37552 states and 159877 transitions. [2021-04-14 23:53:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-04-14 23:53:43,402 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:43,402 INFO L551 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] [2021-04-14 23:53:43,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-14 23:53:43,403 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:43,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:43,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1544252542, now seen corresponding path program 1 times [2021-04-14 23:53:43,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:43,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666943646] [2021-04-14 23:53:43,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:43,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666943646] [2021-04-14 23:53:43,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:43,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-04-14 23:53:43,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589086395] [2021-04-14 23:53:43,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-04-14 23:53:43,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:43,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-04-14 23:53:43,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-04-14 23:53:43,657 INFO L87 Difference]: Start difference. First operand 37552 states and 159877 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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) [2021-04-14 23:53:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:44,454 INFO L93 Difference]: Finished difference Result 45869 states and 194423 transitions. [2021-04-14 23:53:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-14 23:53:44,455 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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 [2021-04-14 23:53:44,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:44,575 INFO L225 Difference]: With dead ends: 45869 [2021-04-14 23:53:44,575 INFO L226 Difference]: Without dead ends: 45563 [2021-04-14 23:53:44,576 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 411.4ms TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2021-04-14 23:53:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45563 states. [2021-04-14 23:53:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45563 to 37212. [2021-04-14 23:53:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37212 states, 37210 states have (on average 4.253292125772642) internal successors, (158265), 37211 states have internal predecessors, (158265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37212 states to 37212 states and 158265 transitions. [2021-04-14 23:53:45,675 INFO L78 Accepts]: Start accepts. Automaton has 37212 states and 158265 transitions. Word has length 53 [2021-04-14 23:53:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:45,675 INFO L480 AbstractCegarLoop]: Abstraction has 37212 states and 158265 transitions. [2021-04-14 23:53:45,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 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) [2021-04-14 23:53:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 37212 states and 158265 transitions. [2021-04-14 23:53:45,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-04-14 23:53:45,699 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:45,699 INFO L551 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] [2021-04-14 23:53:45,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-04-14 23:53:45,699 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:45,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:45,700 INFO L82 PathProgramCache]: Analyzing trace with hash 735522932, now seen corresponding path program 2 times [2021-04-14 23:53:45,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:45,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357654343] [2021-04-14 23:53:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:46,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357654343] [2021-04-14 23:53:46,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:46,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-04-14 23:53:46,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419848468] [2021-04-14 23:53:46,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-04-14 23:53:46,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:46,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-04-14 23:53:46,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-04-14 23:53:46,018 INFO L87 Difference]: Start difference. First operand 37212 states and 158265 transitions. Second operand has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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) [2021-04-14 23:53:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:47,057 INFO L93 Difference]: Finished difference Result 42608 states and 179111 transitions. [2021-04-14 23:53:47,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-14 23:53:47,057 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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 [2021-04-14 23:53:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:47,182 INFO L225 Difference]: With dead ends: 42608 [2021-04-14 23:53:47,182 INFO L226 Difference]: Without dead ends: 42302 [2021-04-14 23:53:47,182 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 461.7ms TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2021-04-14 23:53:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42302 states. [2021-04-14 23:53:47,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42302 to 34165. [2021-04-14 23:53:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34165 states, 34163 states have (on average 4.2155841114656205) internal successors, (144017), 34164 states have internal predecessors, (144017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34165 states to 34165 states and 144017 transitions. [2021-04-14 23:53:47,929 INFO L78 Accepts]: Start accepts. Automaton has 34165 states and 144017 transitions. Word has length 53 [2021-04-14 23:53:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:47,929 INFO L480 AbstractCegarLoop]: Abstraction has 34165 states and 144017 transitions. [2021-04-14 23:53:47,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 17 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) [2021-04-14 23:53:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 34165 states and 144017 transitions. [2021-04-14 23:53:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-04-14 23:53:47,952 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:47,952 INFO L551 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] [2021-04-14 23:53:47,952 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-04-14 23:53:47,952 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:47,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:47,952 INFO L82 PathProgramCache]: Analyzing trace with hash 61882406, now seen corresponding path program 1 times [2021-04-14 23:53:47,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:47,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075566597] [2021-04-14 23:53:47,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:48,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075566597] [2021-04-14 23:53:48,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:48,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-14 23:53:48,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043732055] [2021-04-14 23:53:48,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-14 23:53:48,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:48,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-14 23:53:48,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-14 23:53:48,017 INFO L87 Difference]: Start difference. First operand 34165 states and 144017 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:48,576 INFO L93 Difference]: Finished difference Result 38885 states and 161863 transitions. [2021-04-14 23:53:48,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-14 23:53:48,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-04-14 23:53:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:48,668 INFO L225 Difference]: With dead ends: 38885 [2021-04-14 23:53:48,668 INFO L226 Difference]: Without dead ends: 38051 [2021-04-14 23:53:48,669 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 72.8ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-04-14 23:53:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38051 states. [2021-04-14 23:53:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38051 to 36233. [2021-04-14 23:53:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36233 states, 36231 states have (on average 4.20648063812757) internal successors, (152405), 36232 states have internal predecessors, (152405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36233 states to 36233 states and 152405 transitions. [2021-04-14 23:53:49,752 INFO L78 Accepts]: Start accepts. Automaton has 36233 states and 152405 transitions. Word has length 54 [2021-04-14 23:53:49,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:49,752 INFO L480 AbstractCegarLoop]: Abstraction has 36233 states and 152405 transitions. [2021-04-14 23:53:49,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:49,752 INFO L276 IsEmpty]: Start isEmpty. Operand 36233 states and 152405 transitions. [2021-04-14 23:53:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-04-14 23:53:49,779 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:49,779 INFO L551 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] [2021-04-14 23:53:49,779 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-04-14 23:53:49,779 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:49,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1118414621, now seen corresponding path program 1 times [2021-04-14 23:53:49,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:49,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127586438] [2021-04-14 23:53:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:50,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127586438] [2021-04-14 23:53:50,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:50,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-04-14 23:53:50,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498636272] [2021-04-14 23:53:50,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-04-14 23:53:50,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:50,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-04-14 23:53:50,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-04-14 23:53:50,124 INFO L87 Difference]: Start difference. First operand 36233 states and 152405 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:52,169 INFO L93 Difference]: Finished difference Result 39493 states and 163860 transitions. [2021-04-14 23:53:52,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-04-14 23:53:52,169 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-04-14 23:53:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:52,267 INFO L225 Difference]: With dead ends: 39493 [2021-04-14 23:53:52,267 INFO L226 Difference]: Without dead ends: 38755 [2021-04-14 23:53:52,268 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1434.8ms TimeCoverageRelationStatistics Valid=369, Invalid=1271, Unknown=0, NotChecked=0, Total=1640 [2021-04-14 23:53:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38755 states. [2021-04-14 23:53:52,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38755 to 31287. [2021-04-14 23:53:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31287 states, 31285 states have (on average 4.18264343934793) internal successors, (130854), 31286 states have internal predecessors, (130854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31287 states to 31287 states and 130854 transitions. [2021-04-14 23:53:52,927 INFO L78 Accepts]: Start accepts. Automaton has 31287 states and 130854 transitions. Word has length 54 [2021-04-14 23:53:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:52,927 INFO L480 AbstractCegarLoop]: Abstraction has 31287 states and 130854 transitions. [2021-04-14 23:53:52,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 31287 states and 130854 transitions. [2021-04-14 23:53:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-04-14 23:53:52,950 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:52,950 INFO L551 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] [2021-04-14 23:53:52,951 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-04-14 23:53:52,951 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:52,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:52,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1036650710, now seen corresponding path program 2 times [2021-04-14 23:53:52,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:52,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499463661] [2021-04-14 23:53:52,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:53,354 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2021-04-14 23:53:53,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:53,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499463661] [2021-04-14 23:53:53,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:53,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-04-14 23:53:53,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202630539] [2021-04-14 23:53:53,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-04-14 23:53:53,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:53,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-04-14 23:53:53,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-04-14 23:53:53,517 INFO L87 Difference]: Start difference. First operand 31287 states and 130854 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:54,377 INFO L93 Difference]: Finished difference Result 35916 states and 148477 transitions. [2021-04-14 23:53:54,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-14 23:53:54,377 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-04-14 23:53:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:54,495 INFO L225 Difference]: With dead ends: 35916 [2021-04-14 23:53:54,495 INFO L226 Difference]: Without dead ends: 35127 [2021-04-14 23:53:54,496 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 726.7ms TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2021-04-14 23:53:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35127 states. [2021-04-14 23:53:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35127 to 31107. [2021-04-14 23:53:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31107 states, 31105 states have (on average 4.178106413759846) internal successors, (129960), 31106 states have internal predecessors, (129960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31107 states to 31107 states and 129960 transitions. [2021-04-14 23:53:55,436 INFO L78 Accepts]: Start accepts. Automaton has 31107 states and 129960 transitions. Word has length 54 [2021-04-14 23:53:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:55,436 INFO L480 AbstractCegarLoop]: Abstraction has 31107 states and 129960 transitions. [2021-04-14 23:53:55,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 31107 states and 129960 transitions. [2021-04-14 23:53:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-04-14 23:53:55,459 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:55,459 INFO L551 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] [2021-04-14 23:53:55,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-04-14 23:53:55,459 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:55,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:55,460 INFO L82 PathProgramCache]: Analyzing trace with hash 161468892, now seen corresponding path program 3 times [2021-04-14 23:53:55,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:55,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712733523] [2021-04-14 23:53:55,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:55,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712733523] [2021-04-14 23:53:55,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:55,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-04-14 23:53:55,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871450099] [2021-04-14 23:53:55,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-04-14 23:53:55,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:55,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-04-14 23:53:55,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-04-14 23:53:55,590 INFO L87 Difference]: Start difference. First operand 31107 states and 129960 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:56,044 INFO L93 Difference]: Finished difference Result 40604 states and 166238 transitions. [2021-04-14 23:53:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-04-14 23:53:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-04-14 23:53:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:56,138 INFO L225 Difference]: With dead ends: 40604 [2021-04-14 23:53:56,138 INFO L226 Difference]: Without dead ends: 39770 [2021-04-14 23:53:56,139 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 235.8ms TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2021-04-14 23:53:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39770 states. [2021-04-14 23:53:56,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39770 to 30436. [2021-04-14 23:53:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30436 states, 30434 states have (on average 4.1693829269895515) internal successors, (126891), 30435 states have internal predecessors, (126891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30436 states to 30436 states and 126891 transitions. [2021-04-14 23:53:57,062 INFO L78 Accepts]: Start accepts. Automaton has 30436 states and 126891 transitions. Word has length 54 [2021-04-14 23:53:57,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:57,062 INFO L480 AbstractCegarLoop]: Abstraction has 30436 states and 126891 transitions. [2021-04-14 23:53:57,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:57,062 INFO L276 IsEmpty]: Start isEmpty. Operand 30436 states and 126891 transitions. [2021-04-14 23:53:57,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-04-14 23:53:57,085 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:57,085 INFO L551 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] [2021-04-14 23:53:57,085 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-04-14 23:53:57,085 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:57,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:57,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1751553278, now seen corresponding path program 1 times [2021-04-14 23:53:57,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:57,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392217935] [2021-04-14 23:53:57,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:57,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392217935] [2021-04-14 23:53:57,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:57,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-14 23:53:57,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535786137] [2021-04-14 23:53:57,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-14 23:53:57,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:57,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-14 23:53:57,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-04-14 23:53:57,142 INFO L87 Difference]: Start difference. First operand 30436 states and 126891 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:57,613 INFO L93 Difference]: Finished difference Result 47417 states and 191269 transitions. [2021-04-14 23:53:57,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-14 23:53:57,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-04-14 23:53:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:57,699 INFO L225 Difference]: With dead ends: 47417 [2021-04-14 23:53:57,699 INFO L226 Difference]: Without dead ends: 35565 [2021-04-14 23:53:57,699 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 129.6ms TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-04-14 23:53:57,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35565 states. [2021-04-14 23:53:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35565 to 27821. [2021-04-14 23:53:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27821 states, 27819 states have (on average 4.13918544879399) internal successors, (115148), 27820 states have internal predecessors, (115148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27821 states to 27821 states and 115148 transitions. [2021-04-14 23:53:58,654 INFO L78 Accepts]: Start accepts. Automaton has 27821 states and 115148 transitions. Word has length 54 [2021-04-14 23:53:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:53:58,654 INFO L480 AbstractCegarLoop]: Abstraction has 27821 states and 115148 transitions. [2021-04-14 23:53:58,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 27821 states and 115148 transitions. [2021-04-14 23:53:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-04-14 23:53:58,673 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:53:58,673 INFO L551 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] [2021-04-14 23:53:58,673 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-04-14 23:53:58,673 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:53:58,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:53:58,674 INFO L82 PathProgramCache]: Analyzing trace with hash 342901692, now seen corresponding path program 1 times [2021-04-14 23:53:58,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:53:58,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050662213] [2021-04-14 23:53:58,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:53:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:53:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:53:58,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050662213] [2021-04-14 23:53:58,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:53:58,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-14 23:53:58,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653535559] [2021-04-14 23:53:58,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-14 23:53:58,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:53:58,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-14 23:53:58,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-04-14 23:53:58,790 INFO L87 Difference]: Start difference. First operand 27821 states and 115148 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:53:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:53:59,259 INFO L93 Difference]: Finished difference Result 39569 states and 159562 transitions. [2021-04-14 23:53:59,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-14 23:53:59,260 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-04-14 23:53:59,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:53:59,344 INFO L225 Difference]: With dead ends: 39569 [2021-04-14 23:53:59,344 INFO L226 Difference]: Without dead ends: 34345 [2021-04-14 23:53:59,344 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 195.1ms TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2021-04-14 23:53:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34345 states. [2021-04-14 23:54:00,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34345 to 27827. [2021-04-14 23:54:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27827 states, 27825 states have (on average 4.139442946990116) internal successors, (115180), 27826 states have internal predecessors, (115180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27827 states to 27827 states and 115180 transitions. [2021-04-14 23:54:00,333 INFO L78 Accepts]: Start accepts. Automaton has 27827 states and 115180 transitions. Word has length 54 [2021-04-14 23:54:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:00,334 INFO L480 AbstractCegarLoop]: Abstraction has 27827 states and 115180 transitions. [2021-04-14 23:54:00,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 27827 states and 115180 transitions. [2021-04-14 23:54:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-04-14 23:54:00,352 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:00,352 INFO L551 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] [2021-04-14 23:54:00,352 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-04-14 23:54:00,353 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:00,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:00,353 INFO L82 PathProgramCache]: Analyzing trace with hash -505554466, now seen corresponding path program 2 times [2021-04-14 23:54:00,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:00,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153576540] [2021-04-14 23:54:00,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:00,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153576540] [2021-04-14 23:54:00,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:00,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-04-14 23:54:00,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747762589] [2021-04-14 23:54:00,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-04-14 23:54:00,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:00,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-04-14 23:54:00,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-04-14 23:54:00,468 INFO L87 Difference]: Start difference. First operand 27827 states and 115180 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:01,005 INFO L93 Difference]: Finished difference Result 36531 states and 147402 transitions. [2021-04-14 23:54:01,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-14 23:54:01,006 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-04-14 23:54:01,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:01,082 INFO L225 Difference]: With dead ends: 36531 [2021-04-14 23:54:01,082 INFO L226 Difference]: Without dead ends: 32267 [2021-04-14 23:54:01,083 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 251.2ms TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2021-04-14 23:54:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32267 states. [2021-04-14 23:54:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32267 to 26073. [2021-04-14 23:54:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26073 states, 26071 states have (on average 4.132484369606075) internal successors, (107738), 26072 states have internal predecessors, (107738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26073 states to 26073 states and 107738 transitions. [2021-04-14 23:54:01,972 INFO L78 Accepts]: Start accepts. Automaton has 26073 states and 107738 transitions. Word has length 54 [2021-04-14 23:54:01,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:01,972 INFO L480 AbstractCegarLoop]: Abstraction has 26073 states and 107738 transitions. [2021-04-14 23:54:01,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 26073 states and 107738 transitions. [2021-04-14 23:54:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-04-14 23:54:01,995 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:01,995 INFO L551 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] [2021-04-14 23:54:01,995 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-04-14 23:54:01,995 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1045043691, now seen corresponding path program 1 times [2021-04-14 23:54:01,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:01,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366300875] [2021-04-14 23:54:01,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:02,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:02,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366300875] [2021-04-14 23:54:02,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:02,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-04-14 23:54:02,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379232146] [2021-04-14 23:54:02,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-04-14 23:54:02,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:02,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-04-14 23:54:02,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-04-14 23:54:02,347 INFO L87 Difference]: Start difference. First operand 26073 states and 107738 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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) [2021-04-14 23:54:04,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:04,314 INFO L93 Difference]: Finished difference Result 32925 states and 135274 transitions. [2021-04-14 23:54:04,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-04-14 23:54:04,314 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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 [2021-04-14 23:54:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:04,423 INFO L225 Difference]: With dead ends: 32925 [2021-04-14 23:54:04,423 INFO L226 Difference]: Without dead ends: 31935 [2021-04-14 23:54:04,424 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1309.6ms TimeCoverageRelationStatistics Valid=396, Invalid=1326, Unknown=0, NotChecked=0, Total=1722 [2021-04-14 23:54:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31935 states. [2021-04-14 23:54:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31935 to 25312. [2021-04-14 23:54:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25312 states, 25310 states have (on average 4.174318451205057) internal successors, (105652), 25311 states have internal predecessors, (105652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25312 states to 25312 states and 105652 transitions. [2021-04-14 23:54:04,968 INFO L78 Accepts]: Start accepts. Automaton has 25312 states and 105652 transitions. Word has length 56 [2021-04-14 23:54:04,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:04,969 INFO L480 AbstractCegarLoop]: Abstraction has 25312 states and 105652 transitions. [2021-04-14 23:54:04,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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) [2021-04-14 23:54:04,969 INFO L276 IsEmpty]: Start isEmpty. Operand 25312 states and 105652 transitions. [2021-04-14 23:54:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-04-14 23:54:04,993 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:04,993 INFO L551 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] [2021-04-14 23:54:04,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-04-14 23:54:04,993 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:04,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:04,993 INFO L82 PathProgramCache]: Analyzing trace with hash 629509943, now seen corresponding path program 1 times [2021-04-14 23:54:04,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:04,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602392045] [2021-04-14 23:54:04,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:05,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602392045] [2021-04-14 23:54:05,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:05,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-04-14 23:54:05,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941005037] [2021-04-14 23:54:05,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-04-14 23:54:05,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:05,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-04-14 23:54:05,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-04-14 23:54:05,554 INFO L87 Difference]: Start difference. First operand 25312 states and 105652 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 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) [2021-04-14 23:54:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:06,241 INFO L93 Difference]: Finished difference Result 31366 states and 129292 transitions. [2021-04-14 23:54:06,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-14 23:54:06,241 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 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 [2021-04-14 23:54:06,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:06,317 INFO L225 Difference]: With dead ends: 31366 [2021-04-14 23:54:06,317 INFO L226 Difference]: Without dead ends: 30817 [2021-04-14 23:54:06,318 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 773.5ms TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2021-04-14 23:54:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30817 states. [2021-04-14 23:54:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30817 to 25256. [2021-04-14 23:54:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25256 states, 25254 states have (on average 4.174546606478182) internal successors, (105424), 25255 states have internal predecessors, (105424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25256 states to 25256 states and 105424 transitions. [2021-04-14 23:54:07,136 INFO L78 Accepts]: Start accepts. Automaton has 25256 states and 105424 transitions. Word has length 56 [2021-04-14 23:54:07,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:07,136 INFO L480 AbstractCegarLoop]: Abstraction has 25256 states and 105424 transitions. [2021-04-14 23:54:07,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 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) [2021-04-14 23:54:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 25256 states and 105424 transitions. [2021-04-14 23:54:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-04-14 23:54:07,164 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:07,164 INFO L551 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] [2021-04-14 23:54:07,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-04-14 23:54:07,164 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:07,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:07,166 INFO L82 PathProgramCache]: Analyzing trace with hash -179219667, now seen corresponding path program 2 times [2021-04-14 23:54:07,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:07,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430748265] [2021-04-14 23:54:07,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:07,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430748265] [2021-04-14 23:54:07,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:07,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-04-14 23:54:07,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409017347] [2021-04-14 23:54:07,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-04-14 23:54:07,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:07,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-04-14 23:54:07,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-04-14 23:54:07,550 INFO L87 Difference]: Start difference. First operand 25256 states and 105424 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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) [2021-04-14 23:54:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:08,816 INFO L93 Difference]: Finished difference Result 26055 states and 106079 transitions. [2021-04-14 23:54:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-04-14 23:54:08,817 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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 [2021-04-14 23:54:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:08,869 INFO L225 Difference]: With dead ends: 26055 [2021-04-14 23:54:08,870 INFO L226 Difference]: Without dead ends: 24174 [2021-04-14 23:54:08,870 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1070.4ms TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2021-04-14 23:54:08,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24174 states. [2021-04-14 23:54:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24174 to 17424. [2021-04-14 23:54:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17424 states, 17422 states have (on average 4.059178050740443) internal successors, (70719), 17423 states have internal predecessors, (70719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17424 states to 17424 states and 70719 transitions. [2021-04-14 23:54:09,402 INFO L78 Accepts]: Start accepts. Automaton has 17424 states and 70719 transitions. Word has length 56 [2021-04-14 23:54:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:09,402 INFO L480 AbstractCegarLoop]: Abstraction has 17424 states and 70719 transitions. [2021-04-14 23:54:09,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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) [2021-04-14 23:54:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 17424 states and 70719 transitions. [2021-04-14 23:54:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-04-14 23:54:09,417 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:09,417 INFO L551 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] [2021-04-14 23:54:09,417 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-04-14 23:54:09,417 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1977303013, now seen corresponding path program 1 times [2021-04-14 23:54:09,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:09,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987700641] [2021-04-14 23:54:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:09,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987700641] [2021-04-14 23:54:09,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:09,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-04-14 23:54:09,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429273222] [2021-04-14 23:54:09,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-04-14 23:54:09,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:09,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-04-14 23:54:09,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-04-14 23:54:09,692 INFO L87 Difference]: Start difference. First operand 17424 states and 70719 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) [2021-04-14 23:54:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:10,467 INFO L93 Difference]: Finished difference Result 25985 states and 104210 transitions. [2021-04-14 23:54:10,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-04-14 23:54:10,467 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 [2021-04-14 23:54:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:10,529 INFO L225 Difference]: With dead ends: 25985 [2021-04-14 23:54:10,529 INFO L226 Difference]: Without dead ends: 25616 [2021-04-14 23:54:10,530 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 553.5ms TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2021-04-14 23:54:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25616 states. [2021-04-14 23:54:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25616 to 17115. [2021-04-14 23:54:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17115 states, 17113 states have (on average 4.073452930520657) internal successors, (69709), 17114 states have internal predecessors, (69709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17115 states to 17115 states and 69709 transitions. [2021-04-14 23:54:11,094 INFO L78 Accepts]: Start accepts. Automaton has 17115 states and 69709 transitions. Word has length 56 [2021-04-14 23:54:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:11,094 INFO L480 AbstractCegarLoop]: Abstraction has 17115 states and 69709 transitions. [2021-04-14 23:54:11,094 INFO L481 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) [2021-04-14 23:54:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 17115 states and 69709 transitions. [2021-04-14 23:54:11,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-04-14 23:54:11,111 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:11,111 INFO L551 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] [2021-04-14 23:54:11,111 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-04-14 23:54:11,112 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:11,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash -941599182, now seen corresponding path program 1 times [2021-04-14 23:54:11,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:11,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89192553] [2021-04-14 23:54:11,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:11,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89192553] [2021-04-14 23:54:11,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:11,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-14 23:54:11,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973144704] [2021-04-14 23:54:11,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-14 23:54:11,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:11,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-14 23:54:11,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-14 23:54:11,159 INFO L87 Difference]: Start difference. First operand 17115 states and 69709 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:11,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:11,406 INFO L93 Difference]: Finished difference Result 20107 states and 80008 transitions. [2021-04-14 23:54:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-14 23:54:11,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-04-14 23:54:11,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:11,449 INFO L225 Difference]: With dead ends: 20107 [2021-04-14 23:54:11,449 INFO L226 Difference]: Without dead ends: 19387 [2021-04-14 23:54:11,450 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 66.2ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-04-14 23:54:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19387 states. [2021-04-14 23:54:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19387 to 18967. [2021-04-14 23:54:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18967 states, 18965 states have (on average 4.029053519641445) internal successors, (76411), 18966 states have internal predecessors, (76411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18967 states to 18967 states and 76411 transitions. [2021-04-14 23:54:11,789 INFO L78 Accepts]: Start accepts. Automaton has 18967 states and 76411 transitions. Word has length 57 [2021-04-14 23:54:11,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:11,789 INFO L480 AbstractCegarLoop]: Abstraction has 18967 states and 76411 transitions. [2021-04-14 23:54:11,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 18967 states and 76411 transitions. [2021-04-14 23:54:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-04-14 23:54:11,807 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:11,807 INFO L551 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] [2021-04-14 23:54:11,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-04-14 23:54:11,807 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:11,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:11,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1752728816, now seen corresponding path program 2 times [2021-04-14 23:54:11,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:11,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458552225] [2021-04-14 23:54:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:12,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458552225] [2021-04-14 23:54:12,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:12,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-04-14 23:54:12,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365232035] [2021-04-14 23:54:12,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-04-14 23:54:12,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:12,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-04-14 23:54:12,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-04-14 23:54:12,133 INFO L87 Difference]: Start difference. First operand 18967 states and 76411 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:13,865 INFO L93 Difference]: Finished difference Result 24595 states and 97604 transitions. [2021-04-14 23:54:13,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-04-14 23:54:13,866 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-04-14 23:54:13,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:13,915 INFO L225 Difference]: With dead ends: 24595 [2021-04-14 23:54:13,915 INFO L226 Difference]: Without dead ends: 22435 [2021-04-14 23:54:13,916 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1226.1ms TimeCoverageRelationStatistics Valid=404, Invalid=1318, Unknown=0, NotChecked=0, Total=1722 [2021-04-14 23:54:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22435 states. [2021-04-14 23:54:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22435 to 18295. [2021-04-14 23:54:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18295 states, 18293 states have (on average 4.02793418247417) internal successors, (73683), 18294 states have internal predecessors, (73683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18295 states to 18295 states and 73683 transitions. [2021-04-14 23:54:14,261 INFO L78 Accepts]: Start accepts. Automaton has 18295 states and 73683 transitions. Word has length 57 [2021-04-14 23:54:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:14,261 INFO L480 AbstractCegarLoop]: Abstraction has 18295 states and 73683 transitions. [2021-04-14 23:54:14,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:14,262 INFO L276 IsEmpty]: Start isEmpty. Operand 18295 states and 73683 transitions. [2021-04-14 23:54:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-04-14 23:54:14,278 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:14,278 INFO L551 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] [2021-04-14 23:54:14,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-04-14 23:54:14,278 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1610836384, now seen corresponding path program 3 times [2021-04-14 23:54:14,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:14,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569724727] [2021-04-14 23:54:14,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:14,559 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2021-04-14 23:54:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:14,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569724727] [2021-04-14 23:54:14,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:14,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-04-14 23:54:14,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634640977] [2021-04-14 23:54:14,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-04-14 23:54:14,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:14,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-04-14 23:54:14,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-04-14 23:54:14,725 INFO L87 Difference]: Start difference. First operand 18295 states and 73683 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:15,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:15,413 INFO L93 Difference]: Finished difference Result 24232 states and 94272 transitions. [2021-04-14 23:54:15,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-04-14 23:54:15,413 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2021-04-14 23:54:15,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:15,463 INFO L225 Difference]: With dead ends: 24232 [2021-04-14 23:54:15,463 INFO L226 Difference]: Without dead ends: 23512 [2021-04-14 23:54:15,464 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 631.0ms TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2021-04-14 23:54:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23512 states. [2021-04-14 23:54:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23512 to 17556. [2021-04-14 23:54:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17556 states, 17554 states have (on average 4.029395009684403) internal successors, (70732), 17555 states have internal predecessors, (70732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17556 states to 17556 states and 70732 transitions. [2021-04-14 23:54:15,803 INFO L78 Accepts]: Start accepts. Automaton has 17556 states and 70732 transitions. Word has length 57 [2021-04-14 23:54:15,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:15,803 INFO L480 AbstractCegarLoop]: Abstraction has 17556 states and 70732 transitions. [2021-04-14 23:54:15,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 17556 states and 70732 transitions. [2021-04-14 23:54:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-04-14 23:54:15,821 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:15,821 INFO L551 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] [2021-04-14 23:54:15,821 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-04-14 23:54:15,821 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:15,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash 192157498, now seen corresponding path program 1 times [2021-04-14 23:54:15,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:15,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362664638] [2021-04-14 23:54:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:16,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362664638] [2021-04-14 23:54:16,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:16,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-04-14 23:54:16,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951560654] [2021-04-14 23:54:16,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-04-14 23:54:16,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:16,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-04-14 23:54:16,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-04-14 23:54:16,163 INFO L87 Difference]: Start difference. First operand 17556 states and 70732 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 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) [2021-04-14 23:54:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:17,977 INFO L93 Difference]: Finished difference Result 19776 states and 78160 transitions. [2021-04-14 23:54:17,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-04-14 23:54:17,977 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 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 [2021-04-14 23:54:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:18,018 INFO L225 Difference]: With dead ends: 19776 [2021-04-14 23:54:18,018 INFO L226 Difference]: Without dead ends: 19461 [2021-04-14 23:54:18,019 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1538.3ms TimeCoverageRelationStatistics Valid=376, Invalid=1264, Unknown=0, NotChecked=0, Total=1640 [2021-04-14 23:54:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19461 states. [2021-04-14 23:54:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19461 to 13407. [2021-04-14 23:54:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13407 states, 13405 states have (on average 4.007012308839985) internal successors, (53714), 13406 states have internal predecessors, (53714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13407 states to 13407 states and 53714 transitions. [2021-04-14 23:54:18,309 INFO L78 Accepts]: Start accepts. Automaton has 13407 states and 53714 transitions. Word has length 58 [2021-04-14 23:54:18,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:18,309 INFO L480 AbstractCegarLoop]: Abstraction has 13407 states and 53714 transitions. [2021-04-14 23:54:18,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 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) [2021-04-14 23:54:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 13407 states and 53714 transitions. [2021-04-14 23:54:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-04-14 23:54:18,325 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:18,325 INFO L551 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] [2021-04-14 23:54:18,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-04-14 23:54:18,325 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1126503497, now seen corresponding path program 1 times [2021-04-14 23:54:18,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:18,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942311955] [2021-04-14 23:54:18,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:18,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942311955] [2021-04-14 23:54:18,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:18,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-04-14 23:54:18,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525346730] [2021-04-14 23:54:18,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-04-14 23:54:18,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-04-14 23:54:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-04-14 23:54:18,747 INFO L87 Difference]: Start difference. First operand 13407 states and 53714 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:19,838 INFO L93 Difference]: Finished difference Result 21219 states and 82407 transitions. [2021-04-14 23:54:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-04-14 23:54:19,839 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-04-14 23:54:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:19,883 INFO L225 Difference]: With dead ends: 21219 [2021-04-14 23:54:19,883 INFO L226 Difference]: Without dead ends: 20643 [2021-04-14 23:54:19,884 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1044.8ms TimeCoverageRelationStatistics Valid=419, Invalid=1303, Unknown=0, NotChecked=0, Total=1722 [2021-04-14 23:54:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20643 states. [2021-04-14 23:54:20,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20643 to 13491. [2021-04-14 23:54:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13491 states, 13489 states have (on average 4.007116910074876) internal successors, (54052), 13490 states have internal predecessors, (54052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13491 states to 13491 states and 54052 transitions. [2021-04-14 23:54:20,160 INFO L78 Accepts]: Start accepts. Automaton has 13491 states and 54052 transitions. Word has length 59 [2021-04-14 23:54:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:20,160 INFO L480 AbstractCegarLoop]: Abstraction has 13491 states and 54052 transitions. [2021-04-14 23:54:20,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 13491 states and 54052 transitions. [2021-04-14 23:54:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-04-14 23:54:20,176 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:20,176 INFO L551 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] [2021-04-14 23:54:20,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-04-14 23:54:20,176 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:20,176 INFO L82 PathProgramCache]: Analyzing trace with hash 232200031, now seen corresponding path program 2 times [2021-04-14 23:54:20,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:20,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010963822] [2021-04-14 23:54:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:20,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:20,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010963822] [2021-04-14 23:54:20,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:20,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-04-14 23:54:20,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853781543] [2021-04-14 23:54:20,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-04-14 23:54:20,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:20,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-04-14 23:54:20,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-04-14 23:54:20,504 INFO L87 Difference]: Start difference. First operand 13491 states and 54052 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:20,713 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2021-04-14 23:54:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:22,177 INFO L93 Difference]: Finished difference Result 20907 states and 80054 transitions. [2021-04-14 23:54:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-04-14 23:54:22,178 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-04-14 23:54:22,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:22,219 INFO L225 Difference]: With dead ends: 20907 [2021-04-14 23:54:22,220 INFO L226 Difference]: Without dead ends: 20331 [2021-04-14 23:54:22,220 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1408.2ms TimeCoverageRelationStatistics Valid=649, Invalid=2321, Unknown=0, NotChecked=0, Total=2970 [2021-04-14 23:54:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20331 states. [2021-04-14 23:54:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20331 to 13380. [2021-04-14 23:54:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13380 states, 13378 states have (on average 4.017341904619524) internal successors, (53744), 13379 states have internal predecessors, (53744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13380 states to 13380 states and 53744 transitions. [2021-04-14 23:54:22,500 INFO L78 Accepts]: Start accepts. Automaton has 13380 states and 53744 transitions. Word has length 59 [2021-04-14 23:54:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:22,500 INFO L480 AbstractCegarLoop]: Abstraction has 13380 states and 53744 transitions. [2021-04-14 23:54:22,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 13380 states and 53744 transitions. [2021-04-14 23:54:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-04-14 23:54:22,517 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:22,517 INFO L551 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] [2021-04-14 23:54:22,517 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-04-14 23:54:22,517 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:22,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:22,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1640125077, now seen corresponding path program 3 times [2021-04-14 23:54:22,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:22,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528190836] [2021-04-14 23:54:22,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:22,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528190836] [2021-04-14 23:54:22,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:22,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-04-14 23:54:22,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410603534] [2021-04-14 23:54:22,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-04-14 23:54:22,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:22,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-04-14 23:54:22,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-04-14 23:54:22,893 INFO L87 Difference]: Start difference. First operand 13380 states and 53744 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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) [2021-04-14 23:54:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:23,696 INFO L93 Difference]: Finished difference Result 17568 states and 68661 transitions. [2021-04-14 23:54:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-04-14 23:54:23,696 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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 [2021-04-14 23:54:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:23,733 INFO L225 Difference]: With dead ends: 17568 [2021-04-14 23:54:23,733 INFO L226 Difference]: Without dead ends: 16992 [2021-04-14 23:54:23,733 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 788.6ms TimeCoverageRelationStatistics Valid=320, Invalid=940, Unknown=0, NotChecked=0, Total=1260 [2021-04-14 23:54:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16992 states. [2021-04-14 23:54:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16992 to 12612. [2021-04-14 23:54:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12612 states, 12610 states have (on average 3.977795400475813) internal successors, (50160), 12611 states have internal predecessors, (50160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12612 states to 12612 states and 50160 transitions. [2021-04-14 23:54:23,980 INFO L78 Accepts]: Start accepts. Automaton has 12612 states and 50160 transitions. Word has length 59 [2021-04-14 23:54:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:23,980 INFO L480 AbstractCegarLoop]: Abstraction has 12612 states and 50160 transitions. [2021-04-14 23:54:23,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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) [2021-04-14 23:54:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 12612 states and 50160 transitions. [2021-04-14 23:54:23,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-04-14 23:54:23,994 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:23,994 INFO L551 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] [2021-04-14 23:54:23,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-04-14 23:54:23,994 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:23,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:23,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1760538753, now seen corresponding path program 4 times [2021-04-14 23:54:23,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:23,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511074122] [2021-04-14 23:54:23,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:24,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511074122] [2021-04-14 23:54:24,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:24,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-04-14 23:54:24,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821764852] [2021-04-14 23:54:24,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-04-14 23:54:24,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:24,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-04-14 23:54:24,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-04-14 23:54:24,241 INFO L87 Difference]: Start difference. First operand 12612 states and 50160 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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) [2021-04-14 23:54:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:25,394 INFO L93 Difference]: Finished difference Result 11232 states and 43701 transitions. [2021-04-14 23:54:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-04-14 23:54:25,394 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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 [2021-04-14 23:54:25,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:25,417 INFO L225 Difference]: With dead ends: 11232 [2021-04-14 23:54:25,417 INFO L226 Difference]: Without dead ends: 10656 [2021-04-14 23:54:25,418 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 932.1ms TimeCoverageRelationStatistics Valid=493, Invalid=1577, Unknown=0, NotChecked=0, Total=2070 [2021-04-14 23:54:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10656 states. [2021-04-14 23:54:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10656 to 6918. [2021-04-14 23:54:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6918 states, 6917 states have (on average 4.09411594621946) internal successors, (28319), 6917 states have internal predecessors, (28319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6918 states to 6918 states and 28319 transitions. [2021-04-14 23:54:25,562 INFO L78 Accepts]: Start accepts. Automaton has 6918 states and 28319 transitions. Word has length 59 [2021-04-14 23:54:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:25,562 INFO L480 AbstractCegarLoop]: Abstraction has 6918 states and 28319 transitions. [2021-04-14 23:54:25,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 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) [2021-04-14 23:54:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 6918 states and 28319 transitions. [2021-04-14 23:54:25,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-04-14 23:54:25,576 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:25,576 INFO L551 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] [2021-04-14 23:54:25,576 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-04-14 23:54:25,576 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:25,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:25,577 INFO L82 PathProgramCache]: Analyzing trace with hash -557780459, now seen corresponding path program 1 times [2021-04-14 23:54:25,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:25,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325947311] [2021-04-14 23:54:25,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:25,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325947311] [2021-04-14 23:54:25,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:25,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-14 23:54:25,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749084723] [2021-04-14 23:54:25,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-14 23:54:25,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:25,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-14 23:54:25,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-04-14 23:54:25,714 INFO L87 Difference]: Start difference. First operand 6918 states and 28319 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:25,984 INFO L93 Difference]: Finished difference Result 6918 states and 28253 transitions. [2021-04-14 23:54:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-14 23:54:25,984 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-04-14 23:54:25,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:25,999 INFO L225 Difference]: With dead ends: 6918 [2021-04-14 23:54:25,999 INFO L226 Difference]: Without dead ends: 6918 [2021-04-14 23:54:26,000 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 234.7ms TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-04-14 23:54:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6918 states. [2021-04-14 23:54:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6918 to 6918. [2021-04-14 23:54:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6918 states, 6917 states have (on average 4.08457423738615) internal successors, (28253), 6917 states have internal predecessors, (28253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6918 states to 6918 states and 28253 transitions. [2021-04-14 23:54:26,109 INFO L78 Accepts]: Start accepts. Automaton has 6918 states and 28253 transitions. Word has length 92 [2021-04-14 23:54:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:26,109 INFO L480 AbstractCegarLoop]: Abstraction has 6918 states and 28253 transitions. [2021-04-14 23:54:26,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 6918 states and 28253 transitions. [2021-04-14 23:54:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-04-14 23:54:26,120 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:26,120 INFO L551 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] [2021-04-14 23:54:26,120 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-04-14 23:54:26,120 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:26,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:26,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1878832212, now seen corresponding path program 1 times [2021-04-14 23:54:26,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:26,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394793314] [2021-04-14 23:54:26,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:26,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394793314] [2021-04-14 23:54:26,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:26,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-14 23:54:26,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460496948] [2021-04-14 23:54:26,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-14 23:54:26,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:26,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-14 23:54:26,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-04-14 23:54:26,277 INFO L87 Difference]: Start difference. First operand 6918 states and 28253 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:26,568 INFO L93 Difference]: Finished difference Result 6918 states and 28199 transitions. [2021-04-14 23:54:26,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-14 23:54:26,569 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-04-14 23:54:26,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:26,583 INFO L225 Difference]: With dead ends: 6918 [2021-04-14 23:54:26,583 INFO L226 Difference]: Without dead ends: 6747 [2021-04-14 23:54:26,583 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 237.3ms TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-04-14 23:54:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6747 states. [2021-04-14 23:54:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6747 to 6747. [2021-04-14 23:54:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6747 states, 6746 states have (on average 4.075155647791283) internal successors, (27491), 6746 states have internal predecessors, (27491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6747 states to 6747 states and 27491 transitions. [2021-04-14 23:54:26,689 INFO L78 Accepts]: Start accepts. Automaton has 6747 states and 27491 transitions. Word has length 92 [2021-04-14 23:54:26,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:26,689 INFO L480 AbstractCegarLoop]: Abstraction has 6747 states and 27491 transitions. [2021-04-14 23:54:26,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand 6747 states and 27491 transitions. [2021-04-14 23:54:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-04-14 23:54:26,700 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:26,700 INFO L551 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] [2021-04-14 23:54:26,700 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-04-14 23:54:26,700 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:26,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:26,701 INFO L82 PathProgramCache]: Analyzing trace with hash 841063983, now seen corresponding path program 1 times [2021-04-14 23:54:26,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:26,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507537163] [2021-04-14 23:54:26,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:26,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507537163] [2021-04-14 23:54:26,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:26,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-14 23:54:26,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402217126] [2021-04-14 23:54:26,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-14 23:54:26,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:26,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-14 23:54:26,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-14 23:54:26,765 INFO L87 Difference]: Start difference. First operand 6747 states and 27491 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:26,923 INFO L93 Difference]: Finished difference Result 6747 states and 27485 transitions. [2021-04-14 23:54:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-14 23:54:26,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-04-14 23:54:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:26,937 INFO L225 Difference]: With dead ends: 6747 [2021-04-14 23:54:26,938 INFO L226 Difference]: Without dead ends: 6360 [2021-04-14 23:54:26,938 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 74.3ms TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-04-14 23:54:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6360 states. [2021-04-14 23:54:27,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6360 to 6360. [2021-04-14 23:54:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6360 states, 6359 states have (on average 4.075011794307281) internal successors, (25913), 6359 states have internal predecessors, (25913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6360 states to 6360 states and 25913 transitions. [2021-04-14 23:54:27,038 INFO L78 Accepts]: Start accepts. Automaton has 6360 states and 25913 transitions. Word has length 92 [2021-04-14 23:54:27,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:27,038 INFO L480 AbstractCegarLoop]: Abstraction has 6360 states and 25913 transitions. [2021-04-14 23:54:27,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 6360 states and 25913 transitions. [2021-04-14 23:54:27,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-04-14 23:54:27,048 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:27,048 INFO L551 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] [2021-04-14 23:54:27,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-04-14 23:54:27,049 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:27,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:27,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1325647602, now seen corresponding path program 1 times [2021-04-14 23:54:27,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:27,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860395769] [2021-04-14 23:54:27,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-14 23:54:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-14 23:54:27,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860395769] [2021-04-14 23:54:27,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-14 23:54:27,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-14 23:54:27,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557789721] [2021-04-14 23:54:27,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-14 23:54:27,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-14 23:54:27,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-14 23:54:27,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-14 23:54:27,112 INFO L87 Difference]: Start difference. First operand 6360 states and 25913 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-14 23:54:27,268 INFO L93 Difference]: Finished difference Result 6360 states and 25907 transitions. [2021-04-14 23:54:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-14 23:54:27,269 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-04-14 23:54:27,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-14 23:54:27,282 INFO L225 Difference]: With dead ends: 6360 [2021-04-14 23:54:27,282 INFO L226 Difference]: Without dead ends: 4785 [2021-04-14 23:54:27,282 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 79.4ms TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-04-14 23:54:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2021-04-14 23:54:27,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 4785. [2021-04-14 23:54:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4785 states, 4784 states have (on average 4.0495401337792645) internal successors, (19373), 4784 states have internal predecessors, (19373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4785 states to 4785 states and 19373 transitions. [2021-04-14 23:54:27,382 INFO L78 Accepts]: Start accepts. Automaton has 4785 states and 19373 transitions. Word has length 92 [2021-04-14 23:54:27,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-14 23:54:27,382 INFO L480 AbstractCegarLoop]: Abstraction has 4785 states and 19373 transitions. [2021-04-14 23:54:27,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-14 23:54:27,382 INFO L276 IsEmpty]: Start isEmpty. Operand 4785 states and 19373 transitions. [2021-04-14 23:54:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-04-14 23:54:27,389 INFO L543 BasicCegarLoop]: Found error trace [2021-04-14 23:54:27,389 INFO L551 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] [2021-04-14 23:54:27,389 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-04-14 23:54:27,389 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thread0Err6INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Thread1of1ForFork4Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err4INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, thread0Thread1of1ForFork4Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Err9INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err2INUSE_VIOLATION]=== [2021-04-14 23:54:27,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-14 23:54:27,390 INFO L82 PathProgramCache]: Analyzing trace with hash -689208394, now seen corresponding path program 1 times [2021-04-14 23:54:27,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-14 23:54:27,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293155766] [2021-04-14 23:54:27,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-14 23:54:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-14 23:54:27,403 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-14 23:54:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-14 23:54:27,428 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-14 23:54:27,470 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-14 23:54:27,471 INFO L652 BasicCegarLoop]: Counterexample might be feasible [2021-04-14 23:54:27,471 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-04-14 23:54:27,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 11:54:27 BasicIcfg [2021-04-14 23:54:27,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-14 23:54:27,597 INFO L168 Benchmark]: Toolchain (without parser) took 91575.39 ms. Allocated memory was 255.9 MB in the beginning and 15.6 GB in the end (delta: 15.4 GB). Free memory was 232.1 MB in the beginning and 8.4 GB in the end (delta: -8.1 GB). Peak memory consumption was 7.2 GB. Max. memory is 16.0 GB. [2021-04-14 23:54:27,598 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-14 23:54:27,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.27 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 231.6 MB in the beginning and 339.6 MB in the end (delta: -108.0 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.0 GB. [2021-04-14 23:54:27,598 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.43 ms. Allocated memory is still 358.6 MB. Free memory was 339.6 MB in the beginning and 337.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-14 23:54:27,598 INFO L168 Benchmark]: Boogie Preprocessor took 42.78 ms. Allocated memory is still 358.6 MB. Free memory was 337.5 MB in the beginning and 336.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-14 23:54:27,598 INFO L168 Benchmark]: RCFGBuilder took 447.57 ms. Allocated memory is still 358.6 MB. Free memory was 336.3 MB in the beginning and 309.0 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. [2021-04-14 23:54:27,598 INFO L168 Benchmark]: TraceAbstraction took 90353.55 ms. Allocated memory was 358.6 MB in the beginning and 15.6 GB in the end (delta: 15.3 GB). Free memory was 308.1 MB in the beginning and 8.4 GB in the end (delta: -8.1 GB). Peak memory consumption was 7.2 GB. Max. memory is 16.0 GB. [2021-04-14 23:54:27,599 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.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 659.27 ms. Allocated memory was 255.9 MB in the beginning and 358.6 MB in the end (delta: 102.8 MB). Free memory was 231.6 MB in the beginning and 339.6 MB in the end (delta: -108.0 MB). Peak memory consumption was 56.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 57.43 ms. Allocated memory is still 358.6 MB. Free memory was 339.6 MB in the beginning and 337.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 42.78 ms. Allocated memory is still 358.6 MB. Free memory was 337.5 MB in the beginning and 336.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 447.57 ms. Allocated memory is still 358.6 MB. Free memory was 336.3 MB in the beginning and 309.0 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 90353.55 ms. Allocated memory was 358.6 MB in the beginning and 15.6 GB in the end (delta: 15.3 GB). Free memory was 308.1 MB in the beginning and 8.4 GB in the end (delta: -8.1 GB). Peak memory consumption was 7.2 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1123]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1124] 0 char *v; VAL [v={0:0}] [L1161] 0 pthread_t t; VAL [v={0:0}] [L1162] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1146] 1 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={10:0}, v={0:0}] [L1146] 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}] [L1147] 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}] [L1127] 2 v = malloc(sizeof(char)) VAL [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}] [L1128] 2 return 0; VAL [\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}] [L1148] 1 \read(t1) 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}] [L1148] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1163] 0 \read(t) VAL [\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}] [L1149] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1150] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1151] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1133] 5 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}, 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}] [L1152] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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}] [L1133] 6 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}, 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}] [L1135] 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}] [L1153] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1135] 5 return 0; VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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}] [L1133] 3 v[0] = 'X' VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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}] [L1135] 3 return 0; VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] 4 v[0] = 'Y' 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}] [L1153] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1142] 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}] [L1154] 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}] [L1154] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1155] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1155] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1156] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1156] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, t1={10:0}, t2={11:0}, t3={13:0}, t4={14:0}, t5={6:0}, v={-1:0}] [L1157] 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}] [L1157] 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}] [L1157] 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}] [L1157] 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}] [L1157] 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}] [L1157] 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}] [L1163] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, v={-1:0}] [L1164] 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}] [L1123] 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}] [L1123] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={-1:0}, v={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 89927.6ms, OverallIterations: 42, TraceHistogramMax: 1, EmptinessCheckTime: 1453.2ms, AutomataDifference: 41152.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3642.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7876 SDtfs, 23473 SDslu, 36771 SDs, 0 SdLazy, 17896 SolverSat, 2900 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9430.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1145 GetRequests, 138 SyntacticMatches, 51 SemanticMatches, 956 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5143 ImplicationChecksByTransitivity, 21392.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=49592occurred in iteration=0, InterpolantAutomatonStates: 714, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 33395.6ms AutomataMinimizationTime, 41 MinimizatonAttempts, 276505 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 71.2ms SsaConstructionTime, 388.9ms SatisfiabilityAnalysisTime, 9392.5ms InterpolantComputationTime, 2402 NumberOfCodeBlocks, 2402 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2269 ConstructedInterpolants, 0 QuantifiedInterpolants, 32243 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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...