/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread/singleton.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 20:09:41,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 20:09:41,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 20:09:41,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 20:09:41,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 20:09:41,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 20:09:41,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 20:09:41,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 20:09:41,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 20:09:41,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 20:09:41,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 20:09:41,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 20:09:41,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 20:09:41,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 20:09:41,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 20:09:41,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 20:09:41,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 20:09:41,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 20:09:41,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 20:09:41,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 20:09:41,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 20:09:41,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 20:09:41,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 20:09:41,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 20:09:41,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 20:09:41,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 20:09:41,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 20:09:41,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 20:09:41,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 20:09:41,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 20:09:41,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 20:09:41,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 20:09:41,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 20:09:41,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 20:09:41,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 20:09:41,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 20:09:41,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 20:09:41,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 20:09:41,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 20:09:41,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 20:09:41,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 20:09:41,951 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-SemanticLbe.epf [2020-10-15 20:09:41,993 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 20:09:41,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 20:09:41,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 20:09:41,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 20:09:41,995 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 20:09:41,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 20:09:41,996 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 20:09:41,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 20:09:41,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 20:09:41,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 20:09:41,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 20:09:41,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 20:09:41,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 20:09:41,997 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 20:09:41,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 20:09:41,997 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 20:09:41,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 20:09:41,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 20:09:41,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 20:09:41,998 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 20:09:41,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 20:09:41,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 20:09:41,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 20:09:41,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 20:09:41,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 20:09:41,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 20:09:42,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 20:09:42,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 20:09:42,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 20:09:42,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 20:09:42,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 20:09:42,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 20:09:42,346 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 20:09:42,346 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 20:09:42,347 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton.i [2020-10-15 20:09:42,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aff8d1fe/2c009db12b074ed4af42cce9a260a346/FLAG503c1d7ab [2020-10-15 20:09:42,929 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 20:09:42,930 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton.i [2020-10-15 20:09:42,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aff8d1fe/2c009db12b074ed4af42cce9a260a346/FLAG503c1d7ab [2020-10-15 20:09:43,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aff8d1fe/2c009db12b074ed4af42cce9a260a346 [2020-10-15 20:09:43,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 20:09:43,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 20:09:43,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 20:09:43,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 20:09:43,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 20:09:43,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:09:43" (1/1) ... [2020-10-15 20:09:43,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614ecef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:09:43, skipping insertion in model container [2020-10-15 20:09:43,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 08:09:43" (1/1) ... [2020-10-15 20:09:43,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 20:09:43,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 20:09:43,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 20:09:43,968 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 20:09:44,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 20:09:44,206 INFO L208 MainTranslator]: Completed translation [2020-10-15 20:09:44,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:09:44 WrapperNode [2020-10-15 20:09:44,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 20:09:44,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 20:09:44,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 20:09:44,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 20:09:44,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:09:44" (1/1) ... [2020-10-15 20:09:44,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:09:44" (1/1) ... [2020-10-15 20:09:44,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 20:09:44,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 20:09:44,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 20:09:44,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 20:09:44,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:09:44" (1/1) ... [2020-10-15 20:09:44,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:09:44" (1/1) ... [2020-10-15 20:09:44,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:09:44" (1/1) ... [2020-10-15 20:09:44,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:09:44" (1/1) ... [2020-10-15 20:09:44,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:09:44" (1/1) ... [2020-10-15 20:09:44,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:09:44" (1/1) ... [2020-10-15 20:09:44,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:09:44" (1/1) ... [2020-10-15 20:09:44,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 20:09:44,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 20:09:44,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 20:09:44,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 20:09:44,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:09:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 20:09:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 20:09:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 20:09:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-15 20:09:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2020-10-15 20:09:44,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2020-10-15 20:09:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2020-10-15 20:09:44,391 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2020-10-15 20:09:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2020-10-15 20:09:44,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2020-10-15 20:09:44,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2020-10-15 20:09:44,393 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2020-10-15 20:09:44,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 20:09:44,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-15 20:09:44,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 20:09:44,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 20:09:44,395 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 20:09:44,824 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 20:09:44,824 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-15 20:09:44,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:09:44 BoogieIcfgContainer [2020-10-15 20:09:44,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 20:09:44,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 20:09:44,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 20:09:44,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 20:09:44,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 08:09:43" (1/3) ... [2020-10-15 20:09:44,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ccd7a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:09:44, skipping insertion in model container [2020-10-15 20:09:44,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 08:09:44" (2/3) ... [2020-10-15 20:09:44,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ccd7a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 08:09:44, skipping insertion in model container [2020-10-15 20:09:44,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 08:09:44" (3/3) ... [2020-10-15 20:09:44,836 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton.i [2020-10-15 20:09:44,848 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 20:09:44,849 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 20:09:44,857 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-15 20:09:44,858 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 20:09:44,898 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,899 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,899 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,899 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,900 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,900 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,900 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,900 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,901 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,901 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,901 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,902 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,902 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,902 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,902 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,903 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,903 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,903 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,904 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,904 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,905 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,905 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,905 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,906 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,906 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,906 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,906 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,907 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,907 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,907 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,907 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,908 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,908 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,908 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,909 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,909 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,909 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,909 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,910 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,910 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,910 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,910 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,911 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,911 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,911 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,911 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,912 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,912 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,912 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,912 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,913 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,913 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,913 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,913 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,914 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,915 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,916 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,916 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,916 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,916 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,917 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,917 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,917 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,917 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,918 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,918 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,918 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,919 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,919 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,919 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,920 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,920 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,920 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,920 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,921 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,921 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,921 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,921 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,922 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,922 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,922 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,922 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,923 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,923 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,923 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,923 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,924 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,924 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,925 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,925 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,925 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,925 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,926 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,926 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,930 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,930 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,930 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,930 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,936 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,936 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,936 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,937 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,939 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,939 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,939 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,940 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,946 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,946 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,946 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,947 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,947 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,947 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,947 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,947 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,948 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,948 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,948 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,948 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,948 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,949 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,949 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,949 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,949 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,950 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,950 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,950 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,950 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,950 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,951 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,951 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork3_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,954 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,954 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,954 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,954 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,955 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,955 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,957 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,957 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,958 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,958 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,960 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,960 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,961 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,961 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,961 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,961 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork4_#t~malloc2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,963 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,964 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,964 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,964 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,966 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,967 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,967 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,967 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,969 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,970 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,970 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,970 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,972 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,972 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,973 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:44,973 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 20:09:45,128 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-10-15 20:09:45,151 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 20:09:45,151 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 20:09:45,151 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 20:09:45,152 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 20:09:45,152 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 20:09:45,152 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 20:09:45,152 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 20:09:45,152 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 20:09:45,171 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 20:09:45,174 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 243 transitions, 866 flow [2020-10-15 20:09:45,177 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 243 transitions, 866 flow [2020-10-15 20:09:45,179 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 172 places, 243 transitions, 866 flow [2020-10-15 20:09:45,274 INFO L129 PetriNetUnfolder]: 61/264 cut-off events. [2020-10-15 20:09:45,275 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2020-10-15 20:09:45,286 INFO L80 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 264 events. 61/264 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 353. Up to 24 conditions per place. [2020-10-15 20:09:45,297 INFO L117 LiptonReduction]: Number of co-enabled transitions 4038 [2020-10-15 20:09:47,128 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-15 20:09:47,234 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-15 20:09:47,455 INFO L132 LiptonReduction]: Checked pairs total: 47722 [2020-10-15 20:09:47,456 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-15 20:09:47,462 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 173 transitions, 726 flow [2020-10-15 20:09:47,959 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3502 states. [2020-10-15 20:09:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states. [2020-10-15 20:09:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 20:09:47,968 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:47,969 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:47,969 INFO L429 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:47,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1069688068, now seen corresponding path program 1 times [2020-10-15 20:09:47,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:47,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078561198] [2020-10-15 20:09:47,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:48,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078561198] [2020-10-15 20:09:48,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:48,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 20:09:48,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923499918] [2020-10-15 20:09:48,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 20:09:48,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:48,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 20:09:48,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 20:09:48,277 INFO L87 Difference]: Start difference. First operand 3502 states. Second operand 6 states. [2020-10-15 20:09:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:48,649 INFO L93 Difference]: Finished difference Result 4760 states and 19900 transitions. [2020-10-15 20:09:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 20:09:48,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-15 20:09:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:48,713 INFO L225 Difference]: With dead ends: 4760 [2020-10-15 20:09:48,714 INFO L226 Difference]: Without dead ends: 4272 [2020-10-15 20:09:48,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 20:09:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2020-10-15 20:09:48,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3018. [2020-10-15 20:09:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-10-15 20:09:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 12272 transitions. [2020-10-15 20:09:49,074 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 12272 transitions. Word has length 9 [2020-10-15 20:09:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:49,075 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 12272 transitions. [2020-10-15 20:09:49,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 20:09:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 12272 transitions. [2020-10-15 20:09:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 20:09:49,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:49,079 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:49,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 20:09:49,088 INFO L429 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:49,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1263032832, now seen corresponding path program 2 times [2020-10-15 20:09:49,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:49,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078107078] [2020-10-15 20:09:49,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:49,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078107078] [2020-10-15 20:09:49,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:49,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 20:09:49,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849700421] [2020-10-15 20:09:49,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 20:09:49,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:49,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 20:09:49,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 20:09:49,193 INFO L87 Difference]: Start difference. First operand 3018 states and 12272 transitions. Second operand 6 states. [2020-10-15 20:09:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:49,553 INFO L93 Difference]: Finished difference Result 5518 states and 23821 transitions. [2020-10-15 20:09:49,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 20:09:49,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-15 20:09:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:49,624 INFO L225 Difference]: With dead ends: 5518 [2020-10-15 20:09:49,624 INFO L226 Difference]: Without dead ends: 5518 [2020-10-15 20:09:49,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-15 20:09:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2020-10-15 20:09:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 3008. [2020-10-15 20:09:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2020-10-15 20:09:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 12255 transitions. [2020-10-15 20:09:49,842 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 12255 transitions. Word has length 9 [2020-10-15 20:09:49,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:49,842 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 12255 transitions. [2020-10-15 20:09:49,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 20:09:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 12255 transitions. [2020-10-15 20:09:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 20:09:49,844 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:49,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:49,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 20:09:49,845 INFO L429 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:49,846 INFO L82 PathProgramCache]: Analyzing trace with hash -690496787, now seen corresponding path program 1 times [2020-10-15 20:09:49,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:49,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943349386] [2020-10-15 20:09:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:49,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943349386] [2020-10-15 20:09:49,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:49,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 20:09:49,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901680557] [2020-10-15 20:09:49,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 20:09:49,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:49,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 20:09:49,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 20:09:49,971 INFO L87 Difference]: Start difference. First operand 3008 states and 12255 transitions. Second operand 3 states. [2020-10-15 20:09:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:50,132 INFO L93 Difference]: Finished difference Result 4848 states and 19273 transitions. [2020-10-15 20:09:50,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 20:09:50,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-15 20:09:50,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:50,179 INFO L225 Difference]: With dead ends: 4848 [2020-10-15 20:09:50,179 INFO L226 Difference]: Without dead ends: 3558 [2020-10-15 20:09:50,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 20:09:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3558 states. [2020-10-15 20:09:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3558 to 3181. [2020-10-15 20:09:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2020-10-15 20:09:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 12171 transitions. [2020-10-15 20:09:50,326 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 12171 transitions. Word has length 16 [2020-10-15 20:09:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:50,327 INFO L481 AbstractCegarLoop]: Abstraction has 3181 states and 12171 transitions. [2020-10-15 20:09:50,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 20:09:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 12171 transitions. [2020-10-15 20:09:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 20:09:50,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:50,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:50,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 20:09:50,331 INFO L429 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:50,332 INFO L82 PathProgramCache]: Analyzing trace with hash 69435085, now seen corresponding path program 1 times [2020-10-15 20:09:50,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:50,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446969622] [2020-10-15 20:09:50,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:50,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446969622] [2020-10-15 20:09:50,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:50,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 20:09:50,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113786740] [2020-10-15 20:09:50,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 20:09:50,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:50,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 20:09:50,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 20:09:50,453 INFO L87 Difference]: Start difference. First operand 3181 states and 12171 transitions. Second operand 6 states. [2020-10-15 20:09:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:50,732 INFO L93 Difference]: Finished difference Result 4417 states and 17212 transitions. [2020-10-15 20:09:50,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 20:09:50,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-15 20:09:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:50,752 INFO L225 Difference]: With dead ends: 4417 [2020-10-15 20:09:50,752 INFO L226 Difference]: Without dead ends: 4393 [2020-10-15 20:09:50,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-15 20:09:50,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2020-10-15 20:09:50,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 3588. [2020-10-15 20:09:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2020-10-15 20:09:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 14085 transitions. [2020-10-15 20:09:50,905 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 14085 transitions. Word has length 17 [2020-10-15 20:09:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:50,906 INFO L481 AbstractCegarLoop]: Abstraction has 3588 states and 14085 transitions. [2020-10-15 20:09:50,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 20:09:50,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 14085 transitions. [2020-10-15 20:09:50,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 20:09:50,913 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:50,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:50,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 20:09:50,913 INFO L429 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:50,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:50,914 INFO L82 PathProgramCache]: Analyzing trace with hash -954298863, now seen corresponding path program 2 times [2020-10-15 20:09:50,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:50,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754206388] [2020-10-15 20:09:50,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:51,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754206388] [2020-10-15 20:09:51,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:51,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 20:09:51,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454239214] [2020-10-15 20:09:51,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 20:09:51,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:51,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 20:09:51,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 20:09:51,021 INFO L87 Difference]: Start difference. First operand 3588 states and 14085 transitions. Second operand 6 states. [2020-10-15 20:09:51,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:51,140 INFO L93 Difference]: Finished difference Result 4024 states and 15445 transitions. [2020-10-15 20:09:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 20:09:51,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-15 20:09:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:51,161 INFO L225 Difference]: With dead ends: 4024 [2020-10-15 20:09:51,161 INFO L226 Difference]: Without dead ends: 4024 [2020-10-15 20:09:51,162 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 20:09:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2020-10-15 20:09:51,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3573. [2020-10-15 20:09:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3573 states. [2020-10-15 20:09:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3573 states to 3573 states and 14045 transitions. [2020-10-15 20:09:51,297 INFO L78 Accepts]: Start accepts. Automaton has 3573 states and 14045 transitions. Word has length 17 [2020-10-15 20:09:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:51,298 INFO L481 AbstractCegarLoop]: Abstraction has 3573 states and 14045 transitions. [2020-10-15 20:09:51,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 20:09:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3573 states and 14045 transitions. [2020-10-15 20:09:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 20:09:51,299 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:51,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:51,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 20:09:51,300 INFO L429 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:51,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:51,300 INFO L82 PathProgramCache]: Analyzing trace with hash -687500069, now seen corresponding path program 1 times [2020-10-15 20:09:51,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:51,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790083937] [2020-10-15 20:09:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:51,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790083937] [2020-10-15 20:09:51,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:51,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 20:09:51,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005864056] [2020-10-15 20:09:51,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 20:09:51,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:51,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 20:09:51,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 20:09:51,355 INFO L87 Difference]: Start difference. First operand 3573 states and 14045 transitions. Second operand 6 states. [2020-10-15 20:09:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:51,551 INFO L93 Difference]: Finished difference Result 4225 states and 16225 transitions. [2020-10-15 20:09:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 20:09:51,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-15 20:09:51,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:51,568 INFO L225 Difference]: With dead ends: 4225 [2020-10-15 20:09:51,569 INFO L226 Difference]: Without dead ends: 4129 [2020-10-15 20:09:51,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-15 20:09:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2020-10-15 20:09:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 3713. [2020-10-15 20:09:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2020-10-15 20:09:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 14455 transitions. [2020-10-15 20:09:51,717 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 14455 transitions. Word has length 18 [2020-10-15 20:09:51,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:51,718 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 14455 transitions. [2020-10-15 20:09:51,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 20:09:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 14455 transitions. [2020-10-15 20:09:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 20:09:51,720 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:51,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:51,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 20:09:51,720 INFO L429 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:51,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:51,721 INFO L82 PathProgramCache]: Analyzing trace with hash -454402421, now seen corresponding path program 2 times [2020-10-15 20:09:51,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:51,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740264512] [2020-10-15 20:09:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:51,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740264512] [2020-10-15 20:09:51,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:51,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 20:09:51,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409511749] [2020-10-15 20:09:51,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 20:09:51,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:51,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 20:09:51,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 20:09:51,805 INFO L87 Difference]: Start difference. First operand 3713 states and 14455 transitions. Second operand 7 states. [2020-10-15 20:09:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:52,192 INFO L93 Difference]: Finished difference Result 4979 states and 19779 transitions. [2020-10-15 20:09:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 20:09:52,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-15 20:09:52,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:52,213 INFO L225 Difference]: With dead ends: 4979 [2020-10-15 20:09:52,213 INFO L226 Difference]: Without dead ends: 4905 [2020-10-15 20:09:52,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-15 20:09:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2020-10-15 20:09:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4131. [2020-10-15 20:09:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4131 states. [2020-10-15 20:09:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 16620 transitions. [2020-10-15 20:09:52,359 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 16620 transitions. Word has length 18 [2020-10-15 20:09:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:52,359 INFO L481 AbstractCegarLoop]: Abstraction has 4131 states and 16620 transitions. [2020-10-15 20:09:52,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 20:09:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 16620 transitions. [2020-10-15 20:09:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 20:09:52,361 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:52,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:52,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 20:09:52,362 INFO L429 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:52,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:52,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1254406997, now seen corresponding path program 3 times [2020-10-15 20:09:52,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:52,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101980888] [2020-10-15 20:09:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:52,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101980888] [2020-10-15 20:09:52,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:52,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 20:09:52,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295342744] [2020-10-15 20:09:52,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 20:09:52,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:52,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 20:09:52,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 20:09:52,445 INFO L87 Difference]: Start difference. First operand 4131 states and 16620 transitions. Second operand 8 states. [2020-10-15 20:09:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:52,776 INFO L93 Difference]: Finished difference Result 6735 states and 27904 transitions. [2020-10-15 20:09:52,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 20:09:52,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-15 20:09:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:52,809 INFO L225 Difference]: With dead ends: 6735 [2020-10-15 20:09:52,810 INFO L226 Difference]: Without dead ends: 6661 [2020-10-15 20:09:52,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-10-15 20:09:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2020-10-15 20:09:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4129. [2020-10-15 20:09:52,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4129 states. [2020-10-15 20:09:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 4129 states and 16616 transitions. [2020-10-15 20:09:52,970 INFO L78 Accepts]: Start accepts. Automaton has 4129 states and 16616 transitions. Word has length 18 [2020-10-15 20:09:52,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:52,970 INFO L481 AbstractCegarLoop]: Abstraction has 4129 states and 16616 transitions. [2020-10-15 20:09:52,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 20:09:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4129 states and 16616 transitions. [2020-10-15 20:09:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 20:09:52,972 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:52,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:52,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 20:09:52,973 INFO L429 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:52,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:52,973 INFO L82 PathProgramCache]: Analyzing trace with hash -164095139, now seen corresponding path program 4 times [2020-10-15 20:09:52,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:52,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806199705] [2020-10-15 20:09:52,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:53,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806199705] [2020-10-15 20:09:53,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:53,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 20:09:53,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702175724] [2020-10-15 20:09:53,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 20:09:53,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:53,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 20:09:53,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-15 20:09:53,104 INFO L87 Difference]: Start difference. First operand 4129 states and 16616 transitions. Second operand 10 states. [2020-10-15 20:09:53,307 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-10-15 20:09:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:53,717 INFO L93 Difference]: Finished difference Result 6639 states and 26238 transitions. [2020-10-15 20:09:53,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 20:09:53,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-10-15 20:09:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:53,744 INFO L225 Difference]: With dead ends: 6639 [2020-10-15 20:09:53,744 INFO L226 Difference]: Without dead ends: 6491 [2020-10-15 20:09:53,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-10-15 20:09:53,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6491 states. [2020-10-15 20:09:53,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6491 to 3873. [2020-10-15 20:09:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3873 states. [2020-10-15 20:09:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 15364 transitions. [2020-10-15 20:09:53,895 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 15364 transitions. Word has length 18 [2020-10-15 20:09:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:53,898 INFO L481 AbstractCegarLoop]: Abstraction has 3873 states and 15364 transitions. [2020-10-15 20:09:53,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 20:09:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 15364 transitions. [2020-10-15 20:09:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-15 20:09:53,899 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:53,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:53,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 20:09:53,900 INFO L429 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:53,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:53,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2041625758, now seen corresponding path program 1 times [2020-10-15 20:09:53,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:53,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099911844] [2020-10-15 20:09:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:54,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099911844] [2020-10-15 20:09:54,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:54,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 20:09:54,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858738666] [2020-10-15 20:09:54,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 20:09:54,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:54,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 20:09:54,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 20:09:54,026 INFO L87 Difference]: Start difference. First operand 3873 states and 15364 transitions. Second operand 7 states. [2020-10-15 20:09:54,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:54,183 INFO L93 Difference]: Finished difference Result 4264 states and 16502 transitions. [2020-10-15 20:09:54,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 20:09:54,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-15 20:09:54,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:54,202 INFO L225 Difference]: With dead ends: 4264 [2020-10-15 20:09:54,203 INFO L226 Difference]: Without dead ends: 4264 [2020-10-15 20:09:54,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-15 20:09:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4264 states. [2020-10-15 20:09:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4264 to 3841. [2020-10-15 20:09:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2020-10-15 20:09:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 15250 transitions. [2020-10-15 20:09:54,323 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 15250 transitions. Word has length 19 [2020-10-15 20:09:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:54,324 INFO L481 AbstractCegarLoop]: Abstraction has 3841 states and 15250 transitions. [2020-10-15 20:09:54,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 20:09:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 15250 transitions. [2020-10-15 20:09:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 20:09:54,326 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:54,326 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:54,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 20:09:54,326 INFO L429 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:54,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1134272272, now seen corresponding path program 1 times [2020-10-15 20:09:54,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:54,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970633079] [2020-10-15 20:09:54,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:54,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970633079] [2020-10-15 20:09:54,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:54,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 20:09:54,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903874145] [2020-10-15 20:09:54,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 20:09:54,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:54,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 20:09:54,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-15 20:09:54,478 INFO L87 Difference]: Start difference. First operand 3841 states and 15250 transitions. Second operand 9 states. [2020-10-15 20:09:54,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:54,804 INFO L93 Difference]: Finished difference Result 5256 states and 20905 transitions. [2020-10-15 20:09:54,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 20:09:54,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-15 20:09:54,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:54,822 INFO L225 Difference]: With dead ends: 5256 [2020-10-15 20:09:54,822 INFO L226 Difference]: Without dead ends: 5210 [2020-10-15 20:09:54,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-10-15 20:09:54,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5210 states. [2020-10-15 20:09:55,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5210 to 3994. [2020-10-15 20:09:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3994 states. [2020-10-15 20:09:55,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 15976 transitions. [2020-10-15 20:09:55,101 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 15976 transitions. Word has length 20 [2020-10-15 20:09:55,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:55,102 INFO L481 AbstractCegarLoop]: Abstraction has 3994 states and 15976 transitions. [2020-10-15 20:09:55,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 20:09:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 15976 transitions. [2020-10-15 20:09:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 20:09:55,105 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:55,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:55,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 20:09:55,106 INFO L429 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:55,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:55,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1058647793, now seen corresponding path program 1 times [2020-10-15 20:09:55,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:55,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095611086] [2020-10-15 20:09:55,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:55,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095611086] [2020-10-15 20:09:55,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:55,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 20:09:55,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657150459] [2020-10-15 20:09:55,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 20:09:55,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:55,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 20:09:55,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-15 20:09:55,246 INFO L87 Difference]: Start difference. First operand 3994 states and 15976 transitions. Second operand 9 states. [2020-10-15 20:09:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:55,534 INFO L93 Difference]: Finished difference Result 5328 states and 21486 transitions. [2020-10-15 20:09:55,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 20:09:55,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-15 20:09:55,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:55,551 INFO L225 Difference]: With dead ends: 5328 [2020-10-15 20:09:55,551 INFO L226 Difference]: Without dead ends: 5282 [2020-10-15 20:09:55,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-15 20:09:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2020-10-15 20:09:55,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 3840. [2020-10-15 20:09:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3840 states. [2020-10-15 20:09:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 15247 transitions. [2020-10-15 20:09:55,674 INFO L78 Accepts]: Start accepts. Automaton has 3840 states and 15247 transitions. Word has length 20 [2020-10-15 20:09:55,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:55,675 INFO L481 AbstractCegarLoop]: Abstraction has 3840 states and 15247 transitions. [2020-10-15 20:09:55,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 20:09:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3840 states and 15247 transitions. [2020-10-15 20:09:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 20:09:55,677 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:55,677 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:55,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 20:09:55,678 INFO L429 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:55,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2045819536, now seen corresponding path program 2 times [2020-10-15 20:09:55,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:55,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566259358] [2020-10-15 20:09:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:55,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566259358] [2020-10-15 20:09:55,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:55,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 20:09:55,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888159604] [2020-10-15 20:09:55,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 20:09:55,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:55,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 20:09:55,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-15 20:09:55,809 INFO L87 Difference]: Start difference. First operand 3840 states and 15247 transitions. Second operand 10 states. [2020-10-15 20:09:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:56,240 INFO L93 Difference]: Finished difference Result 5284 states and 20663 transitions. [2020-10-15 20:09:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 20:09:56,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-15 20:09:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:56,256 INFO L225 Difference]: With dead ends: 5284 [2020-10-15 20:09:56,256 INFO L226 Difference]: Without dead ends: 5192 [2020-10-15 20:09:56,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2020-10-15 20:09:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2020-10-15 20:09:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 3734. [2020-10-15 20:09:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3734 states. [2020-10-15 20:09:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 14462 transitions. [2020-10-15 20:09:56,374 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 14462 transitions. Word has length 20 [2020-10-15 20:09:56,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:56,374 INFO L481 AbstractCegarLoop]: Abstraction has 3734 states and 14462 transitions. [2020-10-15 20:09:56,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 20:09:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 14462 transitions. [2020-10-15 20:09:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 20:09:56,377 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:56,377 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:56,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 20:09:56,377 INFO L429 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:56,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:56,378 INFO L82 PathProgramCache]: Analyzing trace with hash 258643217, now seen corresponding path program 2 times [2020-10-15 20:09:56,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:56,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809457502] [2020-10-15 20:09:56,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:56,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809457502] [2020-10-15 20:09:56,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:56,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 20:09:56,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754257863] [2020-10-15 20:09:56,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 20:09:56,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:56,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 20:09:56,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-15 20:09:56,495 INFO L87 Difference]: Start difference. First operand 3734 states and 14462 transitions. Second operand 10 states. [2020-10-15 20:09:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:57,048 INFO L93 Difference]: Finished difference Result 6322 states and 24832 transitions. [2020-10-15 20:09:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 20:09:57,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-15 20:09:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:57,071 INFO L225 Difference]: With dead ends: 6322 [2020-10-15 20:09:57,072 INFO L226 Difference]: Without dead ends: 6276 [2020-10-15 20:09:57,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-10-15 20:09:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6276 states. [2020-10-15 20:09:57,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6276 to 3733. [2020-10-15 20:09:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2020-10-15 20:09:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 14461 transitions. [2020-10-15 20:09:57,214 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 14461 transitions. Word has length 20 [2020-10-15 20:09:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:57,214 INFO L481 AbstractCegarLoop]: Abstraction has 3733 states and 14461 transitions. [2020-10-15 20:09:57,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 20:09:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 14461 transitions. [2020-10-15 20:09:57,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 20:09:57,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:57,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:57,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 20:09:57,220 INFO L429 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:57,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:57,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1348955075, now seen corresponding path program 3 times [2020-10-15 20:09:57,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:57,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701646280] [2020-10-15 20:09:57,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:57,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701646280] [2020-10-15 20:09:57,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:57,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 20:09:57,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638138954] [2020-10-15 20:09:57,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 20:09:57,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:57,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 20:09:57,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-15 20:09:57,441 INFO L87 Difference]: Start difference. First operand 3733 states and 14461 transitions. Second operand 11 states. [2020-10-15 20:09:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:58,132 INFO L93 Difference]: Finished difference Result 4743 states and 18376 transitions. [2020-10-15 20:09:58,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 20:09:58,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-10-15 20:09:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:58,145 INFO L225 Difference]: With dead ends: 4743 [2020-10-15 20:09:58,145 INFO L226 Difference]: Without dead ends: 4709 [2020-10-15 20:09:58,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2020-10-15 20:09:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4709 states. [2020-10-15 20:09:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4709 to 3733. [2020-10-15 20:09:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3733 states. [2020-10-15 20:09:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 14461 transitions. [2020-10-15 20:09:58,250 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 14461 transitions. Word has length 20 [2020-10-15 20:09:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:58,250 INFO L481 AbstractCegarLoop]: Abstraction has 3733 states and 14461 transitions. [2020-10-15 20:09:58,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 20:09:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 14461 transitions. [2020-10-15 20:09:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 20:09:58,252 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:58,253 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:58,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 20:09:58,253 INFO L429 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1331080475, now seen corresponding path program 4 times [2020-10-15 20:09:58,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:58,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619433702] [2020-10-15 20:09:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:58,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619433702] [2020-10-15 20:09:58,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:58,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 20:09:58,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181515200] [2020-10-15 20:09:58,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 20:09:58,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:58,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 20:09:58,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-15 20:09:58,447 INFO L87 Difference]: Start difference. First operand 3733 states and 14461 transitions. Second operand 10 states. [2020-10-15 20:09:58,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:58,850 INFO L93 Difference]: Finished difference Result 4987 states and 19433 transitions. [2020-10-15 20:09:58,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 20:09:58,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-15 20:09:58,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:58,867 INFO L225 Difference]: With dead ends: 4987 [2020-10-15 20:09:58,867 INFO L226 Difference]: Without dead ends: 4941 [2020-10-15 20:09:58,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-10-15 20:09:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2020-10-15 20:09:58,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 3727. [2020-10-15 20:09:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3727 states. [2020-10-15 20:09:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 14449 transitions. [2020-10-15 20:09:58,980 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 14449 transitions. Word has length 20 [2020-10-15 20:09:58,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:58,980 INFO L481 AbstractCegarLoop]: Abstraction has 3727 states and 14449 transitions. [2020-10-15 20:09:58,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 20:09:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 14449 transitions. [2020-10-15 20:09:58,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 20:09:58,983 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:58,983 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:58,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 20:09:58,983 INFO L429 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:58,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:58,984 INFO L82 PathProgramCache]: Analyzing trace with hash 657525156, now seen corresponding path program 3 times [2020-10-15 20:09:58,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:58,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130101801] [2020-10-15 20:09:58,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:59,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130101801] [2020-10-15 20:09:59,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:59,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 20:09:59,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618481645] [2020-10-15 20:09:59,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 20:09:59,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:59,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 20:09:59,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 20:09:59,066 INFO L87 Difference]: Start difference. First operand 3727 states and 14449 transitions. Second operand 7 states. [2020-10-15 20:09:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:59,462 INFO L93 Difference]: Finished difference Result 5325 states and 20419 transitions. [2020-10-15 20:09:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 20:09:59,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-15 20:09:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:59,478 INFO L225 Difference]: With dead ends: 5325 [2020-10-15 20:09:59,478 INFO L226 Difference]: Without dead ends: 5279 [2020-10-15 20:09:59,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-15 20:09:59,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2020-10-15 20:09:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 2948. [2020-10-15 20:09:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2020-10-15 20:09:59,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 10967 transitions. [2020-10-15 20:09:59,594 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 10967 transitions. Word has length 20 [2020-10-15 20:09:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:59,596 INFO L481 AbstractCegarLoop]: Abstraction has 2948 states and 10967 transitions. [2020-10-15 20:09:59,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 20:09:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 10967 transitions. [2020-10-15 20:09:59,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 20:09:59,599 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:59,599 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:59,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 20:09:59,599 INFO L429 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:59,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:59,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1935934284, now seen corresponding path program 1 times [2020-10-15 20:09:59,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:59,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68270254] [2020-10-15 20:09:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:09:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:09:59,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68270254] [2020-10-15 20:09:59,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:09:59,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 20:09:59,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199996902] [2020-10-15 20:09:59,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 20:09:59,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:09:59,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 20:09:59,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 20:09:59,658 INFO L87 Difference]: Start difference. First operand 2948 states and 10967 transitions. Second operand 6 states. [2020-10-15 20:09:59,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:09:59,785 INFO L93 Difference]: Finished difference Result 3727 states and 13634 transitions. [2020-10-15 20:09:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 20:09:59,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-15 20:09:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:09:59,797 INFO L225 Difference]: With dead ends: 3727 [2020-10-15 20:09:59,797 INFO L226 Difference]: Without dead ends: 3652 [2020-10-15 20:09:59,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-15 20:09:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3652 states. [2020-10-15 20:09:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 3270. [2020-10-15 20:09:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2020-10-15 20:09:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 12154 transitions. [2020-10-15 20:09:59,885 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 12154 transitions. Word has length 21 [2020-10-15 20:09:59,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:09:59,886 INFO L481 AbstractCegarLoop]: Abstraction has 3270 states and 12154 transitions. [2020-10-15 20:09:59,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 20:09:59,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 12154 transitions. [2020-10-15 20:09:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 20:09:59,888 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:09:59,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:09:59,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 20:09:59,889 INFO L429 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:09:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:09:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash 558788524, now seen corresponding path program 1 times [2020-10-15 20:09:59,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:09:59,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870952478] [2020-10-15 20:09:59,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:09:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:00,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870952478] [2020-10-15 20:10:00,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:00,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-15 20:10:00,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837655768] [2020-10-15 20:10:00,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 20:10:00,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:00,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 20:10:00,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-15 20:10:00,082 INFO L87 Difference]: Start difference. First operand 3270 states and 12154 transitions. Second operand 12 states. [2020-10-15 20:10:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:00,790 INFO L93 Difference]: Finished difference Result 4405 states and 16600 transitions. [2020-10-15 20:10:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 20:10:00,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-15 20:10:00,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:00,802 INFO L225 Difference]: With dead ends: 4405 [2020-10-15 20:10:00,802 INFO L226 Difference]: Without dead ends: 4371 [2020-10-15 20:10:00,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-10-15 20:10:00,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2020-10-15 20:10:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 3270. [2020-10-15 20:10:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2020-10-15 20:10:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 12154 transitions. [2020-10-15 20:10:00,898 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 12154 transitions. Word has length 21 [2020-10-15 20:10:00,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:00,898 INFO L481 AbstractCegarLoop]: Abstraction has 3270 states and 12154 transitions. [2020-10-15 20:10:00,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 20:10:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 12154 transitions. [2020-10-15 20:10:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 20:10:00,909 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:00,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:00,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 20:10:00,910 INFO L429 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:00,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:00,910 INFO L82 PathProgramCache]: Analyzing trace with hash 540913924, now seen corresponding path program 2 times [2020-10-15 20:10:00,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:00,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720838810] [2020-10-15 20:10:00,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:01,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720838810] [2020-10-15 20:10:01,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:01,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 20:10:01,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931972463] [2020-10-15 20:10:01,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 20:10:01,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:01,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 20:10:01,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-15 20:10:01,083 INFO L87 Difference]: Start difference. First operand 3270 states and 12154 transitions. Second operand 11 states. [2020-10-15 20:10:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:01,526 INFO L93 Difference]: Finished difference Result 4064 states and 15268 transitions. [2020-10-15 20:10:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 20:10:01,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-15 20:10:01,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:01,542 INFO L225 Difference]: With dead ends: 4064 [2020-10-15 20:10:01,542 INFO L226 Difference]: Without dead ends: 3972 [2020-10-15 20:10:01,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2020-10-15 20:10:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3972 states. [2020-10-15 20:10:01,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3972 to 2499. [2020-10-15 20:10:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2499 states. [2020-10-15 20:10:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 9076 transitions. [2020-10-15 20:10:01,615 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 9076 transitions. Word has length 21 [2020-10-15 20:10:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:01,615 INFO L481 AbstractCegarLoop]: Abstraction has 2499 states and 9076 transitions. [2020-10-15 20:10:01,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 20:10:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 9076 transitions. [2020-10-15 20:10:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 20:10:01,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:01,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:01,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 20:10:01,618 INFO L429 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:01,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:01,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1608946948, now seen corresponding path program 2 times [2020-10-15 20:10:01,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:01,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838450031] [2020-10-15 20:10:01,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:02,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838450031] [2020-10-15 20:10:02,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:02,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 20:10:02,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899335991] [2020-10-15 20:10:02,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 20:10:02,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:02,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 20:10:02,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 20:10:02,011 INFO L87 Difference]: Start difference. First operand 2499 states and 9076 transitions. Second operand 6 states. [2020-10-15 20:10:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:02,141 INFO L93 Difference]: Finished difference Result 2874 states and 10132 transitions. [2020-10-15 20:10:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 20:10:02,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-15 20:10:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:02,152 INFO L225 Difference]: With dead ends: 2874 [2020-10-15 20:10:02,152 INFO L226 Difference]: Without dead ends: 2650 [2020-10-15 20:10:02,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 20:10:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-15 20:10:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2211. [2020-10-15 20:10:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2020-10-15 20:10:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 7918 transitions. [2020-10-15 20:10:02,226 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 7918 transitions. Word has length 21 [2020-10-15 20:10:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:02,227 INFO L481 AbstractCegarLoop]: Abstraction has 2211 states and 7918 transitions. [2020-10-15 20:10:02,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 20:10:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 7918 transitions. [2020-10-15 20:10:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 20:10:02,230 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:02,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:02,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-15 20:10:02,231 INFO L429 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:02,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:02,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1396456954, now seen corresponding path program 1 times [2020-10-15 20:10:02,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:02,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971038942] [2020-10-15 20:10:02,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:02,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971038942] [2020-10-15 20:10:02,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:02,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 20:10:02,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424955777] [2020-10-15 20:10:02,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 20:10:02,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:02,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 20:10:02,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 20:10:02,358 INFO L87 Difference]: Start difference. First operand 2211 states and 7918 transitions. Second operand 7 states. [2020-10-15 20:10:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:02,569 INFO L93 Difference]: Finished difference Result 2930 states and 10378 transitions. [2020-10-15 20:10:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 20:10:02,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-15 20:10:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:02,578 INFO L225 Difference]: With dead ends: 2930 [2020-10-15 20:10:02,578 INFO L226 Difference]: Without dead ends: 2870 [2020-10-15 20:10:02,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-15 20:10:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2020-10-15 20:10:02,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2208. [2020-10-15 20:10:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2020-10-15 20:10:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 7913 transitions. [2020-10-15 20:10:02,634 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 7913 transitions. Word has length 22 [2020-10-15 20:10:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:02,634 INFO L481 AbstractCegarLoop]: Abstraction has 2208 states and 7913 transitions. [2020-10-15 20:10:02,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 20:10:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 7913 transitions. [2020-10-15 20:10:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 20:10:02,637 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:02,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:02,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-15 20:10:02,637 INFO L429 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash 644682778, now seen corresponding path program 2 times [2020-10-15 20:10:02,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:02,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535629765] [2020-10-15 20:10:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:02,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535629765] [2020-10-15 20:10:02,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:02,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 20:10:02,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371865790] [2020-10-15 20:10:02,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 20:10:02,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:02,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 20:10:02,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 20:10:02,724 INFO L87 Difference]: Start difference. First operand 2208 states and 7913 transitions. Second operand 8 states. [2020-10-15 20:10:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:03,000 INFO L93 Difference]: Finished difference Result 2920 states and 10358 transitions. [2020-10-15 20:10:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 20:10:03,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-15 20:10:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:03,007 INFO L225 Difference]: With dead ends: 2920 [2020-10-15 20:10:03,008 INFO L226 Difference]: Without dead ends: 2860 [2020-10-15 20:10:03,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-15 20:10:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2020-10-15 20:10:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2202. [2020-10-15 20:10:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-15 20:10:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 7899 transitions. [2020-10-15 20:10:03,063 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 7899 transitions. Word has length 22 [2020-10-15 20:10:03,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:03,064 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 7899 transitions. [2020-10-15 20:10:03,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 20:10:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 7899 transitions. [2020-10-15 20:10:03,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 20:10:03,066 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:03,066 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:03,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-15 20:10:03,067 INFO L429 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:03,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:03,067 INFO L82 PathProgramCache]: Analyzing trace with hash -787433364, now seen corresponding path program 3 times [2020-10-15 20:10:03,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:03,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461908] [2020-10-15 20:10:03,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:03,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461908] [2020-10-15 20:10:03,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:03,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 20:10:03,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509616370] [2020-10-15 20:10:03,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 20:10:03,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:03,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 20:10:03,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 20:10:03,147 INFO L87 Difference]: Start difference. First operand 2202 states and 7899 transitions. Second operand 9 states. [2020-10-15 20:10:03,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:03,342 INFO L93 Difference]: Finished difference Result 2905 states and 10327 transitions. [2020-10-15 20:10:03,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 20:10:03,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-15 20:10:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:03,349 INFO L225 Difference]: With dead ends: 2905 [2020-10-15 20:10:03,349 INFO L226 Difference]: Without dead ends: 2845 [2020-10-15 20:10:03,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-15 20:10:03,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2020-10-15 20:10:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2202. [2020-10-15 20:10:03,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-15 20:10:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 7899 transitions. [2020-10-15 20:10:03,401 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 7899 transitions. Word has length 22 [2020-10-15 20:10:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:03,402 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 7899 transitions. [2020-10-15 20:10:03,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 20:10:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 7899 transitions. [2020-10-15 20:10:03,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 20:10:03,404 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:03,405 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:03,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-15 20:10:03,405 INFO L429 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:03,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:03,405 INFO L82 PathProgramCache]: Analyzing trace with hash -270857424, now seen corresponding path program 4 times [2020-10-15 20:10:03,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:03,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187793627] [2020-10-15 20:10:03,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:03,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187793627] [2020-10-15 20:10:03,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:03,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 20:10:03,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342529264] [2020-10-15 20:10:03,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 20:10:03,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:03,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 20:10:03,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-15 20:10:03,598 INFO L87 Difference]: Start difference. First operand 2202 states and 7899 transitions. Second operand 11 states. [2020-10-15 20:10:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:03,955 INFO L93 Difference]: Finished difference Result 3120 states and 11113 transitions. [2020-10-15 20:10:03,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 20:10:03,955 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-15 20:10:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:03,964 INFO L225 Difference]: With dead ends: 3120 [2020-10-15 20:10:03,964 INFO L226 Difference]: Without dead ends: 3060 [2020-10-15 20:10:03,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-15 20:10:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2020-10-15 20:10:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 2202. [2020-10-15 20:10:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-10-15 20:10:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 7896 transitions. [2020-10-15 20:10:04,011 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 7896 transitions. Word has length 22 [2020-10-15 20:10:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:04,011 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 7896 transitions. [2020-10-15 20:10:04,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 20:10:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 7896 transitions. [2020-10-15 20:10:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-15 20:10:04,015 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:04,015 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:04,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-15 20:10:04,015 INFO L429 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:04,016 INFO L82 PathProgramCache]: Analyzing trace with hash -503603988, now seen corresponding path program 5 times [2020-10-15 20:10:04,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:04,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780746485] [2020-10-15 20:10:04,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:04,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780746485] [2020-10-15 20:10:04,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:04,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 20:10:04,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618075102] [2020-10-15 20:10:04,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 20:10:04,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:04,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 20:10:04,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-15 20:10:04,111 INFO L87 Difference]: Start difference. First operand 2202 states and 7896 transitions. Second operand 9 states. [2020-10-15 20:10:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:04,432 INFO L93 Difference]: Finished difference Result 3737 states and 13299 transitions. [2020-10-15 20:10:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 20:10:04,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-10-15 20:10:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:04,441 INFO L225 Difference]: With dead ends: 3737 [2020-10-15 20:10:04,441 INFO L226 Difference]: Without dead ends: 3677 [2020-10-15 20:10:04,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-15 20:10:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2020-10-15 20:10:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 2170. [2020-10-15 20:10:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2020-10-15 20:10:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 7789 transitions. [2020-10-15 20:10:04,501 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 7789 transitions. Word has length 22 [2020-10-15 20:10:04,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:04,502 INFO L481 AbstractCegarLoop]: Abstraction has 2170 states and 7789 transitions. [2020-10-15 20:10:04,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 20:10:04,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 7789 transitions. [2020-10-15 20:10:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 20:10:04,505 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:04,505 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:04,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-15 20:10:04,505 INFO L429 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:04,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1357008819, now seen corresponding path program 1 times [2020-10-15 20:10:04,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:04,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153253016] [2020-10-15 20:10:04,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:04,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153253016] [2020-10-15 20:10:04,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:04,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 20:10:04,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247719242] [2020-10-15 20:10:04,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 20:10:04,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:04,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 20:10:04,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-15 20:10:04,629 INFO L87 Difference]: Start difference. First operand 2170 states and 7789 transitions. Second operand 10 states. [2020-10-15 20:10:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:05,132 INFO L93 Difference]: Finished difference Result 3595 states and 12502 transitions. [2020-10-15 20:10:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 20:10:05,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-15 20:10:05,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:05,143 INFO L225 Difference]: With dead ends: 3595 [2020-10-15 20:10:05,143 INFO L226 Difference]: Without dead ends: 3478 [2020-10-15 20:10:05,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-15 20:10:05,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2020-10-15 20:10:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 1979. [2020-10-15 20:10:05,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2020-10-15 20:10:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 7017 transitions. [2020-10-15 20:10:05,255 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 7017 transitions. Word has length 23 [2020-10-15 20:10:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:05,256 INFO L481 AbstractCegarLoop]: Abstraction has 1979 states and 7017 transitions. [2020-10-15 20:10:05,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 20:10:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 7017 transitions. [2020-10-15 20:10:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 20:10:05,260 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:05,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:05,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-15 20:10:05,260 INFO L429 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:05,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:05,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1309010247, now seen corresponding path program 1 times [2020-10-15 20:10:05,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:05,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122254673] [2020-10-15 20:10:05,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:05,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:05,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122254673] [2020-10-15 20:10:05,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:05,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 20:10:05,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731995859] [2020-10-15 20:10:05,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 20:10:05,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:05,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 20:10:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 20:10:05,330 INFO L87 Difference]: Start difference. First operand 1979 states and 7017 transitions. Second operand 6 states. [2020-10-15 20:10:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:05,459 INFO L93 Difference]: Finished difference Result 2476 states and 8453 transitions. [2020-10-15 20:10:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 20:10:05,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-15 20:10:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:05,465 INFO L225 Difference]: With dead ends: 2476 [2020-10-15 20:10:05,465 INFO L226 Difference]: Without dead ends: 2412 [2020-10-15 20:10:05,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-15 20:10:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2020-10-15 20:10:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2291. [2020-10-15 20:10:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-10-15 20:10:05,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 8009 transitions. [2020-10-15 20:10:05,513 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 8009 transitions. Word has length 24 [2020-10-15 20:10:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:05,514 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 8009 transitions. [2020-10-15 20:10:05,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 20:10:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 8009 transitions. [2020-10-15 20:10:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 20:10:05,517 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:05,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:05,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-15 20:10:05,517 INFO L429 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:05,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:05,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1793125216, now seen corresponding path program 1 times [2020-10-15 20:10:05,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:05,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599126247] [2020-10-15 20:10:05,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:05,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599126247] [2020-10-15 20:10:05,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:05,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 20:10:05,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626948166] [2020-10-15 20:10:05,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 20:10:05,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:05,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 20:10:05,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-15 20:10:05,608 INFO L87 Difference]: Start difference. First operand 2291 states and 8009 transitions. Second operand 9 states. [2020-10-15 20:10:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:05,795 INFO L93 Difference]: Finished difference Result 3139 states and 10958 transitions. [2020-10-15 20:10:05,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 20:10:05,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-10-15 20:10:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:05,802 INFO L225 Difference]: With dead ends: 3139 [2020-10-15 20:10:05,802 INFO L226 Difference]: Without dead ends: 3115 [2020-10-15 20:10:05,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-15 20:10:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2020-10-15 20:10:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 2290. [2020-10-15 20:10:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2020-10-15 20:10:05,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 8008 transitions. [2020-10-15 20:10:05,844 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 8008 transitions. Word has length 24 [2020-10-15 20:10:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:05,845 INFO L481 AbstractCegarLoop]: Abstraction has 2290 states and 8008 transitions. [2020-10-15 20:10:05,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 20:10:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 8008 transitions. [2020-10-15 20:10:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 20:10:05,847 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:05,847 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:05,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-15 20:10:05,848 INFO L429 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1041351040, now seen corresponding path program 2 times [2020-10-15 20:10:05,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:05,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016545909] [2020-10-15 20:10:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:05,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016545909] [2020-10-15 20:10:05,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:05,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 20:10:05,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36825006] [2020-10-15 20:10:05,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 20:10:05,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:05,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 20:10:05,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-15 20:10:05,961 INFO L87 Difference]: Start difference. First operand 2290 states and 8008 transitions. Second operand 10 states. [2020-10-15 20:10:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:06,318 INFO L93 Difference]: Finished difference Result 3138 states and 10954 transitions. [2020-10-15 20:10:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 20:10:06,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-15 20:10:06,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:06,326 INFO L225 Difference]: With dead ends: 3138 [2020-10-15 20:10:06,326 INFO L226 Difference]: Without dead ends: 3114 [2020-10-15 20:10:06,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-10-15 20:10:06,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2020-10-15 20:10:06,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 2293. [2020-10-15 20:10:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2020-10-15 20:10:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 8015 transitions. [2020-10-15 20:10:06,369 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 8015 transitions. Word has length 24 [2020-10-15 20:10:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:06,370 INFO L481 AbstractCegarLoop]: Abstraction has 2293 states and 8015 transitions. [2020-10-15 20:10:06,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 20:10:06,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 8015 transitions. [2020-10-15 20:10:06,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 20:10:06,372 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:06,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:06,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-15 20:10:06,372 INFO L429 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:06,372 INFO L82 PathProgramCache]: Analyzing trace with hash -106935726, now seen corresponding path program 3 times [2020-10-15 20:10:06,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:06,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071525907] [2020-10-15 20:10:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:06,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071525907] [2020-10-15 20:10:06,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:06,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-15 20:10:06,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672692933] [2020-10-15 20:10:06,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-15 20:10:06,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:06,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-15 20:10:06,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-15 20:10:06,512 INFO L87 Difference]: Start difference. First operand 2293 states and 8015 transitions. Second operand 11 states. [2020-10-15 20:10:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:06,825 INFO L93 Difference]: Finished difference Result 3732 states and 13122 transitions. [2020-10-15 20:10:06,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 20:10:06,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-10-15 20:10:06,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:06,834 INFO L225 Difference]: With dead ends: 3732 [2020-10-15 20:10:06,834 INFO L226 Difference]: Without dead ends: 3708 [2020-10-15 20:10:06,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2020-10-15 20:10:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2020-10-15 20:10:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 2271. [2020-10-15 20:10:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2271 states. [2020-10-15 20:10:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 7965 transitions. [2020-10-15 20:10:06,877 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 7965 transitions. Word has length 24 [2020-10-15 20:10:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:06,878 INFO L481 AbstractCegarLoop]: Abstraction has 2271 states and 7965 transitions. [2020-10-15 20:10:06,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-15 20:10:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 7965 transitions. [2020-10-15 20:10:06,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 20:10:06,881 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:06,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:06,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-15 20:10:06,882 INFO L429 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:06,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:06,882 INFO L82 PathProgramCache]: Analyzing trace with hash -408101783, now seen corresponding path program 2 times [2020-10-15 20:10:06,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:06,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023131753] [2020-10-15 20:10:06,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:06,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023131753] [2020-10-15 20:10:06,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:06,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 20:10:06,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663467163] [2020-10-15 20:10:06,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 20:10:06,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:06,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 20:10:06,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 20:10:06,952 INFO L87 Difference]: Start difference. First operand 2271 states and 7965 transitions. Second operand 7 states. [2020-10-15 20:10:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:07,176 INFO L93 Difference]: Finished difference Result 2765 states and 9396 transitions. [2020-10-15 20:10:07,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 20:10:07,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-15 20:10:07,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:07,182 INFO L225 Difference]: With dead ends: 2765 [2020-10-15 20:10:07,182 INFO L226 Difference]: Without dead ends: 2701 [2020-10-15 20:10:07,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-15 20:10:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2020-10-15 20:10:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2268. [2020-10-15 20:10:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2020-10-15 20:10:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 7960 transitions. [2020-10-15 20:10:07,214 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 7960 transitions. Word has length 24 [2020-10-15 20:10:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:07,215 INFO L481 AbstractCegarLoop]: Abstraction has 2268 states and 7960 transitions. [2020-10-15 20:10:07,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 20:10:07,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 7960 transitions. [2020-10-15 20:10:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 20:10:07,218 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:07,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:07,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-15 20:10:07,218 INFO L429 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:07,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:07,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1308579191, now seen corresponding path program 3 times [2020-10-15 20:10:07,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:07,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304718188] [2020-10-15 20:10:07,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:07,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304718188] [2020-10-15 20:10:07,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:07,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 20:10:07,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907663688] [2020-10-15 20:10:07,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 20:10:07,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:07,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 20:10:07,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 20:10:07,305 INFO L87 Difference]: Start difference. First operand 2268 states and 7960 transitions. Second operand 8 states. [2020-10-15 20:10:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:07,534 INFO L93 Difference]: Finished difference Result 2755 states and 9376 transitions. [2020-10-15 20:10:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-15 20:10:07,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-15 20:10:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:07,541 INFO L225 Difference]: With dead ends: 2755 [2020-10-15 20:10:07,541 INFO L226 Difference]: Without dead ends: 2691 [2020-10-15 20:10:07,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-15 20:10:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2020-10-15 20:10:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2262. [2020-10-15 20:10:07,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2020-10-15 20:10:07,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 7946 transitions. [2020-10-15 20:10:07,572 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 7946 transitions. Word has length 24 [2020-10-15 20:10:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:07,573 INFO L481 AbstractCegarLoop]: Abstraction has 2262 states and 7946 transitions. [2020-10-15 20:10:07,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 20:10:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 7946 transitions. [2020-10-15 20:10:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 20:10:07,576 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:07,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:07,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-15 20:10:07,577 INFO L429 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1370549309, now seen corresponding path program 4 times [2020-10-15 20:10:07,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:07,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265901744] [2020-10-15 20:10:07,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:07,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265901744] [2020-10-15 20:10:07,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:07,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 20:10:07,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946745691] [2020-10-15 20:10:07,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 20:10:07,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:07,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 20:10:07,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-15 20:10:07,691 INFO L87 Difference]: Start difference. First operand 2262 states and 7946 transitions. Second operand 10 states. [2020-10-15 20:10:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:07,907 INFO L93 Difference]: Finished difference Result 2704 states and 9243 transitions. [2020-10-15 20:10:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 20:10:07,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-15 20:10:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:07,914 INFO L225 Difference]: With dead ends: 2704 [2020-10-15 20:10:07,914 INFO L226 Difference]: Without dead ends: 2640 [2020-10-15 20:10:07,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-10-15 20:10:07,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2020-10-15 20:10:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2262. [2020-10-15 20:10:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2020-10-15 20:10:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 7946 transitions. [2020-10-15 20:10:07,975 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 7946 transitions. Word has length 24 [2020-10-15 20:10:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:07,976 INFO L481 AbstractCegarLoop]: Abstraction has 2262 states and 7946 transitions. [2020-10-15 20:10:07,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 20:10:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 7946 transitions. [2020-10-15 20:10:07,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 20:10:07,979 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:07,979 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:07,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-15 20:10:07,979 INFO L429 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:07,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:07,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1607134461, now seen corresponding path program 5 times [2020-10-15 20:10:07,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:07,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44724501] [2020-10-15 20:10:07,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:08,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44724501] [2020-10-15 20:10:08,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:08,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-15 20:10:08,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275046916] [2020-10-15 20:10:08,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-15 20:10:08,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:08,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-15 20:10:08,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-15 20:10:08,184 INFO L87 Difference]: Start difference. First operand 2262 states and 7946 transitions. Second operand 13 states. [2020-10-15 20:10:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:08,700 INFO L93 Difference]: Finished difference Result 4164 states and 14122 transitions. [2020-10-15 20:10:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 20:10:08,701 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2020-10-15 20:10:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:08,709 INFO L225 Difference]: With dead ends: 4164 [2020-10-15 20:10:08,710 INFO L226 Difference]: Without dead ends: 4036 [2020-10-15 20:10:08,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-10-15 20:10:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2020-10-15 20:10:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 2451. [2020-10-15 20:10:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2451 states. [2020-10-15 20:10:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 8748 transitions. [2020-10-15 20:10:08,753 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 8748 transitions. Word has length 24 [2020-10-15 20:10:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:08,753 INFO L481 AbstractCegarLoop]: Abstraction has 2451 states and 8748 transitions. [2020-10-15 20:10:08,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-15 20:10:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 8748 transitions. [2020-10-15 20:10:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 20:10:08,757 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:08,757 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:08,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-15 20:10:08,757 INFO L429 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:08,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:08,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1497656527, now seen corresponding path program 6 times [2020-10-15 20:10:08,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:08,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551588904] [2020-10-15 20:10:08,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:08,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551588904] [2020-10-15 20:10:08,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:08,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 20:10:08,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133030759] [2020-10-15 20:10:08,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 20:10:08,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:08,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 20:10:08,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-15 20:10:08,870 INFO L87 Difference]: Start difference. First operand 2451 states and 8748 transitions. Second operand 10 states. [2020-10-15 20:10:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:09,148 INFO L93 Difference]: Finished difference Result 3358 states and 11346 transitions. [2020-10-15 20:10:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 20:10:09,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-15 20:10:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:09,154 INFO L225 Difference]: With dead ends: 3358 [2020-10-15 20:10:09,154 INFO L226 Difference]: Without dead ends: 3294 [2020-10-15 20:10:09,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-10-15 20:10:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2020-10-15 20:10:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 2271. [2020-10-15 20:10:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2271 states. [2020-10-15 20:10:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 8062 transitions. [2020-10-15 20:10:09,190 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 8062 transitions. Word has length 24 [2020-10-15 20:10:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:09,190 INFO L481 AbstractCegarLoop]: Abstraction has 2271 states and 8062 transitions. [2020-10-15 20:10:09,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 20:10:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 8062 transitions. [2020-10-15 20:10:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-15 20:10:09,192 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:09,193 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:09,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-15 20:10:09,193 INFO L429 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:09,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:09,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1945194585, now seen corresponding path program 1 times [2020-10-15 20:10:09,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:09,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127795644] [2020-10-15 20:10:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:09,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127795644] [2020-10-15 20:10:09,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:09,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-15 20:10:09,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743729974] [2020-10-15 20:10:09,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 20:10:09,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:09,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 20:10:09,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-15 20:10:09,378 INFO L87 Difference]: Start difference. First operand 2271 states and 8062 transitions. Second operand 12 states. [2020-10-15 20:10:09,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:09,810 INFO L93 Difference]: Finished difference Result 2789 states and 9626 transitions. [2020-10-15 20:10:09,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-15 20:10:09,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-10-15 20:10:09,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:09,816 INFO L225 Difference]: With dead ends: 2789 [2020-10-15 20:10:09,817 INFO L226 Difference]: Without dead ends: 2742 [2020-10-15 20:10:09,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2020-10-15 20:10:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2020-10-15 20:10:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 1742. [2020-10-15 20:10:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2020-10-15 20:10:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 6049 transitions. [2020-10-15 20:10:09,846 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 6049 transitions. Word has length 25 [2020-10-15 20:10:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:09,846 INFO L481 AbstractCegarLoop]: Abstraction has 1742 states and 6049 transitions. [2020-10-15 20:10:09,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 20:10:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 6049 transitions. [2020-10-15 20:10:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 20:10:09,849 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:09,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:09,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-15 20:10:09,849 INFO L429 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:09,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:09,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1461991345, now seen corresponding path program 1 times [2020-10-15 20:10:09,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:09,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219017064] [2020-10-15 20:10:09,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:09,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219017064] [2020-10-15 20:10:09,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:09,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 20:10:09,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006327223] [2020-10-15 20:10:09,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 20:10:09,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:09,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 20:10:09,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-15 20:10:09,946 INFO L87 Difference]: Start difference. First operand 1742 states and 6049 transitions. Second operand 9 states. [2020-10-15 20:10:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:10,209 INFO L93 Difference]: Finished difference Result 2359 states and 7868 transitions. [2020-10-15 20:10:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 20:10:10,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-10-15 20:10:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:10,214 INFO L225 Difference]: With dead ends: 2359 [2020-10-15 20:10:10,214 INFO L226 Difference]: Without dead ends: 2337 [2020-10-15 20:10:10,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-15 20:10:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2020-10-15 20:10:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1741. [2020-10-15 20:10:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2020-10-15 20:10:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 6048 transitions. [2020-10-15 20:10:10,247 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 6048 transitions. Word has length 26 [2020-10-15 20:10:10,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:10,247 INFO L481 AbstractCegarLoop]: Abstraction has 1741 states and 6048 transitions. [2020-10-15 20:10:10,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 20:10:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 6048 transitions. [2020-10-15 20:10:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 20:10:10,250 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:10,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:10,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-10-15 20:10:10,251 INFO L429 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:10,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1932498543, now seen corresponding path program 2 times [2020-10-15 20:10:10,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:10,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336662724] [2020-10-15 20:10:10,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:10,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336662724] [2020-10-15 20:10:10,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:10,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-15 20:10:10,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761746558] [2020-10-15 20:10:10,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-15 20:10:10,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:10,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-15 20:10:10,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-15 20:10:10,377 INFO L87 Difference]: Start difference. First operand 1741 states and 6048 transitions. Second operand 10 states. [2020-10-15 20:10:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:10,658 INFO L93 Difference]: Finished difference Result 2355 states and 7860 transitions. [2020-10-15 20:10:10,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 20:10:10,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-10-15 20:10:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:10,665 INFO L225 Difference]: With dead ends: 2355 [2020-10-15 20:10:10,665 INFO L226 Difference]: Without dead ends: 2333 [2020-10-15 20:10:10,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-10-15 20:10:10,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2020-10-15 20:10:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 1744. [2020-10-15 20:10:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1744 states. [2020-10-15 20:10:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 6055 transitions. [2020-10-15 20:10:10,689 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 6055 transitions. Word has length 26 [2020-10-15 20:10:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:10,689 INFO L481 AbstractCegarLoop]: Abstraction has 1744 states and 6055 transitions. [2020-10-15 20:10:10,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-15 20:10:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 6055 transitions. [2020-10-15 20:10:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 20:10:10,691 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:10,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:10,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-10-15 20:10:10,692 INFO L429 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:10,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1870528425, now seen corresponding path program 3 times [2020-10-15 20:10:10,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:10,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352441320] [2020-10-15 20:10:10,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:10,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352441320] [2020-10-15 20:10:10,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:10,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-15 20:10:10,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331477003] [2020-10-15 20:10:10,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 20:10:10,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:10,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 20:10:10,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-15 20:10:10,854 INFO L87 Difference]: Start difference. First operand 1744 states and 6055 transitions. Second operand 12 states. [2020-10-15 20:10:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:11,171 INFO L93 Difference]: Finished difference Result 2375 states and 7965 transitions. [2020-10-15 20:10:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 20:10:11,172 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-10-15 20:10:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:11,178 INFO L225 Difference]: With dead ends: 2375 [2020-10-15 20:10:11,178 INFO L226 Difference]: Without dead ends: 2287 [2020-10-15 20:10:11,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2020-10-15 20:10:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2020-10-15 20:10:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 1491. [2020-10-15 20:10:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2020-10-15 20:10:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 5039 transitions. [2020-10-15 20:10:11,208 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 5039 transitions. Word has length 26 [2020-10-15 20:10:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:11,208 INFO L481 AbstractCegarLoop]: Abstraction has 1491 states and 5039 transitions. [2020-10-15 20:10:11,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 20:10:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 5039 transitions. [2020-10-15 20:10:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 20:10:11,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:11,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:11,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-10-15 20:10:11,210 INFO L429 AbstractCegarLoop]: === Iteration 41 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:11,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:11,211 INFO L82 PathProgramCache]: Analyzing trace with hash 443766965, now seen corresponding path program 4 times [2020-10-15 20:10:11,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:11,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314372119] [2020-10-15 20:10:11,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:11,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314372119] [2020-10-15 20:10:11,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:11,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-15 20:10:11,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143077112] [2020-10-15 20:10:11,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-15 20:10:11,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:11,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-15 20:10:11,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-10-15 20:10:11,382 INFO L87 Difference]: Start difference. First operand 1491 states and 5039 transitions. Second operand 12 states. [2020-10-15 20:10:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:11,786 INFO L93 Difference]: Finished difference Result 1544 states and 5003 transitions. [2020-10-15 20:10:11,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-15 20:10:11,787 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-10-15 20:10:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:11,790 INFO L225 Difference]: With dead ends: 1544 [2020-10-15 20:10:11,791 INFO L226 Difference]: Without dead ends: 1500 [2020-10-15 20:10:11,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-10-15 20:10:11,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2020-10-15 20:10:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 885. [2020-10-15 20:10:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-10-15 20:10:11,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3033 transitions. [2020-10-15 20:10:11,818 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3033 transitions. Word has length 26 [2020-10-15 20:10:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:11,818 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 3033 transitions. [2020-10-15 20:10:11,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-15 20:10:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3033 transitions. [2020-10-15 20:10:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-15 20:10:11,821 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:11,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:11,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-10-15 20:10:11,822 INFO L429 AbstractCegarLoop]: === Iteration 42 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:11,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash -416507732, now seen corresponding path program 1 times [2020-10-15 20:10:11,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:11,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581261990] [2020-10-15 20:10:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:11,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581261990] [2020-10-15 20:10:11,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:11,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 20:10:11,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407598717] [2020-10-15 20:10:11,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 20:10:11,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:11,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 20:10:11,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-15 20:10:11,909 INFO L87 Difference]: Start difference. First operand 885 states and 3033 transitions. Second operand 8 states. [2020-10-15 20:10:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:12,047 INFO L93 Difference]: Finished difference Result 885 states and 3029 transitions. [2020-10-15 20:10:12,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 20:10:12,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-15 20:10:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:12,052 INFO L225 Difference]: With dead ends: 885 [2020-10-15 20:10:12,052 INFO L226 Difference]: Without dead ends: 879 [2020-10-15 20:10:12,053 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-15 20:10:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2020-10-15 20:10:12,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2020-10-15 20:10:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2020-10-15 20:10:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3010 transitions. [2020-10-15 20:10:12,083 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3010 transitions. Word has length 41 [2020-10-15 20:10:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:12,084 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 3010 transitions. [2020-10-15 20:10:12,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 20:10:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3010 transitions. [2020-10-15 20:10:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-15 20:10:12,088 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:12,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:12,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-10-15 20:10:12,089 INFO L429 AbstractCegarLoop]: === Iteration 43 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:12,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:12,089 INFO L82 PathProgramCache]: Analyzing trace with hash 829092404, now seen corresponding path program 1 times [2020-10-15 20:10:12,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:12,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261200789] [2020-10-15 20:10:12,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 20:10:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 20:10:12,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261200789] [2020-10-15 20:10:12,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 20:10:12,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-15 20:10:12,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617071109] [2020-10-15 20:10:12,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 20:10:12,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 20:10:12,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 20:10:12,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-15 20:10:12,218 INFO L87 Difference]: Start difference. First operand 879 states and 3010 transitions. Second operand 8 states. [2020-10-15 20:10:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 20:10:12,416 INFO L93 Difference]: Finished difference Result 879 states and 3006 transitions. [2020-10-15 20:10:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 20:10:12,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-15 20:10:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 20:10:12,420 INFO L225 Difference]: With dead ends: 879 [2020-10-15 20:10:12,420 INFO L226 Difference]: Without dead ends: 819 [2020-10-15 20:10:12,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-15 20:10:12,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2020-10-15 20:10:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2020-10-15 20:10:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-10-15 20:10:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2784 transitions. [2020-10-15 20:10:12,445 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 2784 transitions. Word has length 41 [2020-10-15 20:10:12,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 20:10:12,445 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 2784 transitions. [2020-10-15 20:10:12,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 20:10:12,445 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 2784 transitions. [2020-10-15 20:10:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-15 20:10:12,448 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 20:10:12,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 20:10:12,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-10-15 20:10:12,448 INFO L429 AbstractCegarLoop]: === Iteration 44 === [thread0Err1INUSE_VIOLATION, thread0Err0INUSE_VIOLATION, thread0Err4INUSE_VIOLATION, thread0Err3INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5INUSE_VIOLATION, thread0Thread1of1ForFork3Err8INUSE_VIOLATION, thread0Thread1of1ForFork3Err9INUSE_VIOLATION, thread0Thread1of1ForFork3Err7INUSE_VIOLATION, thread0Thread1of1ForFork3Err6INUSE_VIOLATION, thread0Thread1of1ForFork3Err10INUSE_VIOLATION]=== [2020-10-15 20:10:12,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 20:10:12,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1378914744, now seen corresponding path program 1 times [2020-10-15 20:10:12,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 20:10:12,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549298005] [2020-10-15 20:10:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 20:10:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 20:10:12,467 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 20:10:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 20:10:12,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 20:10:12,531 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 20:10:12,531 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 20:10:12,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-10-15 20:10:12,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 08:10:12 BasicIcfg [2020-10-15 20:10:12,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 20:10:12,647 INFO L168 Benchmark]: Toolchain (without parser) took 29482.37 ms. Allocated memory was 253.2 MB in the beginning and 1.3 GB in the end (delta: 997.7 MB). Free memory was 209.2 MB in the beginning and 1.1 GB in the end (delta: -898.1 MB). Peak memory consumption was 99.7 MB. Max. memory is 14.2 GB. [2020-10-15 20:10:12,647 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 20:10:12,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1041.50 ms. Allocated memory was 253.2 MB in the beginning and 320.9 MB in the end (delta: 67.6 MB). Free memory was 209.2 MB in the beginning and 235.9 MB in the end (delta: -26.7 MB). Peak memory consumption was 51.1 MB. Max. memory is 14.2 GB. [2020-10-15 20:10:12,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.19 ms. Allocated memory is still 320.9 MB. Free memory was 235.9 MB in the beginning and 233.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 20:10:12,648 INFO L168 Benchmark]: Boogie Preprocessor took 30.99 ms. Allocated memory is still 320.9 MB. Free memory is still 233.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 20:10:12,648 INFO L168 Benchmark]: RCFGBuilder took 515.41 ms. Allocated memory is still 320.9 MB. Free memory was 230.9 MB in the beginning and 203.7 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 14.2 GB. [2020-10-15 20:10:12,649 INFO L168 Benchmark]: TraceAbstraction took 27816.86 ms. Allocated memory was 320.9 MB in the beginning and 1.3 GB in the end (delta: 930.1 MB). Free memory was 203.7 MB in the beginning and 1.1 GB in the end (delta: -903.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 14.2 GB. [2020-10-15 20:10:12,651 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1041.50 ms. Allocated memory was 253.2 MB in the beginning and 320.9 MB in the end (delta: 67.6 MB). Free memory was 209.2 MB in the beginning and 235.9 MB in the end (delta: -26.7 MB). Peak memory consumption was 51.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 72.19 ms. Allocated memory is still 320.9 MB. Free memory was 235.9 MB in the beginning and 233.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 30.99 ms. Allocated memory is still 320.9 MB. Free memory is still 233.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 515.41 ms. Allocated memory is still 320.9 MB. Free memory was 230.9 MB in the beginning and 203.7 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 27816.86 ms. Allocated memory was 320.9 MB in the beginning and 1.3 GB in the end (delta: 930.1 MB). Free memory was 203.7 MB in the beginning and 1.1 GB in the end (delta: -903.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 3325 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 1147 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.2s, 172 PlacesBefore, 101 PlacesAfterwards, 243 TransitionsBefore, 173 TransitionsAfterwards, 4038 CoEnabledTransitionPairs, 5 FixpointIterations, 23 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 47722 MoverChecksTotal - CounterExampleResult [Line: 1088]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1089] 0 char *v; [L1122] 0 pthread_t t; [L1123] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1107] 1 pthread_t t1, t2, t3, t4, t5; [L1108] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={0:0}] [L1109] 1 \read(t1) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={0:0}] [L1124] 0 \read(t) VAL [\read(t1)=0, arg={0:0}, arg={0:0}, arg={0:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={0:0}] [L1092] 2 v = malloc(sizeof(char)) [L1093] 2 return 0; [L1109] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={6:0}] [L1110] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={6:0}] [L1097] 3 v[0] = 'X' [L1098] 3 return 0; [L1111] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={6:0}] [L1112] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={6:0}] [L1113] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={6:0}] [L1114] 1 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={6:0}] [L1114] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={6:0}] [L1115] 1 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={6:0}] [L1097] 6 v[0] = 'X' [L1098] 6 return 0; [L1097] 5 v[0] = 'X' [L1098] 5 return 0; [L1102] 4 v[0] = 'Y' [L1103] 4 return 0; [L1115] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={6:0}] [L1116] 1 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={6:0}] [L1116] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={6:0}] [L1117] 1 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={6:0}] [L1117] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, t1={11:0}, t2={13:0}, t3={10:0}, t4={8:0}, t5={12:0}, v={6:0}] [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1118] 1 return 0; [L1124] FCALL, JOIN 1 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] [L1125] 0 v[0] [L1088] COND TRUE 0 !expression [L1088] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={6:0}, v={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.3s, OverallIterations: 44, TraceHistogramMax: 1, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 4657 SDtfs, 7459 SDslu, 14204 SDs, 0 SdLazy, 8536 SolverSat, 1019 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 534 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4131occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 43 MinimizatonAttempts, 43210 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 900 ConstructedInterpolants, 0 QuantifiedInterpolants, 216521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...