/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/13_unverif.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 08:28:02,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 08:28:02,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 08:28:02,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 08:28:02,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 08:28:02,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 08:28:02,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 08:28:02,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 08:28:02,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 08:28:02,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 08:28:02,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 08:28:02,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 08:28:02,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 08:28:02,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 08:28:02,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 08:28:02,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 08:28:02,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 08:28:02,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 08:28:02,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 08:28:02,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 08:28:02,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 08:28:02,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 08:28:02,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 08:28:02,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 08:28:02,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 08:28:02,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 08:28:02,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 08:28:02,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 08:28:02,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 08:28:02,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 08:28:02,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 08:28:02,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 08:28:02,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 08:28:02,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 08:28:02,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 08:28:02,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 08:28:02,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 08:28:02,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 08:28:02,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 08:28:02,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 08:28:02,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 08:28:02,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 08:28:02,729 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 08:28:02,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 08:28:02,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 08:28:02,729 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 08:28:02,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 08:28:02,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 08:28:02,731 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 08:28:02,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 08:28:02,732 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 08:28:02,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 08:28:02,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 08:28:02,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 08:28:02,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 08:28:02,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 08:28:02,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 08:28:02,733 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 08:28:02,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 08:28:02,733 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 08:28:02,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 08:28:02,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 08:28:02,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 08:28:02,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 08:28:02,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 08:28:02,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 08:28:02,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 08:28:02,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 08:28:02,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 08:28:02,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 08:28:02,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 08:28:02,734 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 08:28:02,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 08:28:02,734 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 08:28:02,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 08:28:02,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 08:28:02,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 08:28:02,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 08:28:03,000 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 08:28:03,001 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 08:28:03,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/13_unverif.i [2021-06-05 08:28:03,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9060ba483/b6e532e4b8f94298af7f60e0d5cb7fe0/FLAG70643351c [2021-06-05 08:28:03,465 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 08:28:03,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/13_unverif.i [2021-06-05 08:28:03,476 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9060ba483/b6e532e4b8f94298af7f60e0d5cb7fe0/FLAG70643351c [2021-06-05 08:28:03,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9060ba483/b6e532e4b8f94298af7f60e0d5cb7fe0 [2021-06-05 08:28:03,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 08:28:03,493 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 08:28:03,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 08:28:03,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 08:28:03,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 08:28:03,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:28:03" (1/1) ... [2021-06-05 08:28:03,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4224183a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:28:03, skipping insertion in model container [2021-06-05 08:28:03,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:28:03" (1/1) ... [2021-06-05 08:28:03,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 08:28:03,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 08:28:03,814 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/13_unverif.i[30213,30226] [2021-06-05 08:28:03,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 08:28:03,828 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 08:28:03,859 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/13_unverif.i[30213,30226] [2021-06-05 08:28:03,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 08:28:03,905 INFO L208 MainTranslator]: Completed translation [2021-06-05 08:28:03,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:28:03 WrapperNode [2021-06-05 08:28:03,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 08:28:03,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 08:28:03,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 08:28:03,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 08:28:03,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:28:03" (1/1) ... [2021-06-05 08:28:03,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:28:03" (1/1) ... [2021-06-05 08:28:03,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 08:28:03,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 08:28:03,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 08:28:03,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 08:28:03,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:28:03" (1/1) ... [2021-06-05 08:28:03,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:28:03" (1/1) ... [2021-06-05 08:28:03,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:28:03" (1/1) ... [2021-06-05 08:28:03,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:28:03" (1/1) ... [2021-06-05 08:28:03,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:28:03" (1/1) ... [2021-06-05 08:28:03,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:28:03" (1/1) ... [2021-06-05 08:28:03,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:28:03" (1/1) ... [2021-06-05 08:28:03,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 08:28:03,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 08:28:03,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 08:28:03,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 08:28:03,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:28:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 08:28:04,010 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2021-06-05 08:28:04,011 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2021-06-05 08:28:04,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 08:28:04,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 08:28:04,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 08:28:04,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 08:28:04,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 08:28:04,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 08:28:04,012 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 08:28:04,344 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 08:28:04,344 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-06-05 08:28:04,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:28:04 BoogieIcfgContainer [2021-06-05 08:28:04,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 08:28:04,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 08:28:04,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 08:28:04,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 08:28:04,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 08:28:03" (1/3) ... [2021-06-05 08:28:04,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395c0322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:28:04, skipping insertion in model container [2021-06-05 08:28:04,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:28:03" (2/3) ... [2021-06-05 08:28:04,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395c0322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:28:04, skipping insertion in model container [2021-06-05 08:28:04,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:28:04" (3/3) ... [2021-06-05 08:28:04,350 INFO L111 eAbstractionObserver]: Analyzing ICFG 13_unverif.i [2021-06-05 08:28:04,354 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 08:28:04,354 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 08:28:04,354 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 08:28:04,355 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 08:28:04,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,366 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,366 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,367 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,367 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,368 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,368 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,370 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,370 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:04,372 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:28:04,385 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 08:28:04,397 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:28:04,397 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:28:04,397 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:28:04,397 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:28:04,397 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:28:04,397 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:28:04,397 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:28:04,398 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:28:04,403 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 40 transitions, 85 flow [2021-06-05 08:28:04,413 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 191 states, 186 states have (on average 2.010752688172043) internal successors, (374), 190 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 186 states have (on average 2.010752688172043) internal successors, (374), 190 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:04,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 08:28:04,420 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:04,420 INFO L521 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] [2021-06-05 08:28:04,421 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:04,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:04,424 INFO L82 PathProgramCache]: Analyzing trace with hash 103127073, now seen corresponding path program 1 times [2021-06-05 08:28:04,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:04,429 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852632654] [2021-06-05 08:28:04,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:28:04,757 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:04,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852632654] [2021-06-05 08:28:04,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852632654] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:04,757 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:28:04,757 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:28:04,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165578914] [2021-06-05 08:28:04,760 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:28:04,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:04,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:28:04,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:28:04,770 INFO L87 Difference]: Start difference. First operand has 191 states, 186 states have (on average 2.010752688172043) internal successors, (374), 190 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:04,804 INFO L93 Difference]: Finished difference Result 145 states and 257 transitions. [2021-06-05 08:28:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:28:04,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-06-05 08:28:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:04,810 INFO L225 Difference]: With dead ends: 145 [2021-06-05 08:28:04,811 INFO L226 Difference]: Without dead ends: 121 [2021-06-05 08:28:04,811 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 78.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:28:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-06-05 08:28:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2021-06-05 08:28:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 112 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 197 transitions. [2021-06-05 08:28:04,837 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 197 transitions. Word has length 25 [2021-06-05 08:28:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:04,837 INFO L482 AbstractCegarLoop]: Abstraction has 113 states and 197 transitions. [2021-06-05 08:28:04,837 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 197 transitions. [2021-06-05 08:28:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-06-05 08:28:04,838 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:04,838 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:04,839 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 08:28:04,839 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:04,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1357889034, now seen corresponding path program 1 times [2021-06-05 08:28:04,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:04,840 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556848968] [2021-06-05 08:28:04,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:28:04,956 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:04,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556848968] [2021-06-05 08:28:04,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556848968] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:04,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:28:04,958 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:28:04,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530375022] [2021-06-05 08:28:04,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:28:04,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:04,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:28:04,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:28:04,966 INFO L87 Difference]: Start difference. First operand 113 states and 197 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:04,994 INFO L93 Difference]: Finished difference Result 97 states and 167 transitions. [2021-06-05 08:28:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:28:04,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-06-05 08:28:04,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:04,995 INFO L225 Difference]: With dead ends: 97 [2021-06-05 08:28:04,995 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 08:28:04,996 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:28:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 08:28:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 08:28:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 08:28:04,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2021-06-05 08:28:04,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:04,997 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 08:28:04,997 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 08:28:04,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 08:28:04,997 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 08:28:04,998 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 08:28:04,999 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 08:28:05,004 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:28:05,004 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:28:05,004 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:28:05,004 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:28:05,005 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:28:05,005 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:28:05,005 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:28:05,005 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 08:28:05,007 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 40 transitions, 85 flow [2021-06-05 08:28:05,014 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 191 states, 186 states have (on average 2.010752688172043) internal successors, (374), 190 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 186 states have (on average 2.010752688172043) internal successors, (374), 190 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-06-05 08:28:05,021 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:05,021 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:05,021 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 08:28:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:05,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1839751346, now seen corresponding path program 1 times [2021-06-05 08:28:05,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:05,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930894208] [2021-06-05 08:28:05,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:28:05,037 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:28:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:28:05,069 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:28:05,091 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 08:28:05,092 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 08:28:05,092 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 08:28:05,092 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 08:28:05,092 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 08:28:05,092 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 08:28:05,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,101 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,101 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,102 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,102 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,104 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,105 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,105 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,106 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,106 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,107 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,108 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,108 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,109 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,110 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,111 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,112 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,112 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:05,113 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:28:05,113 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 08:28:05,114 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:28:05,114 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:28:05,114 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:28:05,114 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:28:05,114 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:28:05,114 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:28:05,114 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:28:05,114 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:28:05,115 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 55 transitions, 122 flow [2021-06-05 08:28:05,178 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2375 states, 2364 states have (on average 3.0833333333333335) internal successors, (7289), 2374 states have internal predecessors, (7289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 2375 states, 2364 states have (on average 3.0833333333333335) internal successors, (7289), 2374 states have internal predecessors, (7289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 08:28:05,183 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:05,184 INFO L521 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] [2021-06-05 08:28:05,184 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:05,184 INFO L82 PathProgramCache]: Analyzing trace with hash -74875162, now seen corresponding path program 1 times [2021-06-05 08:28:05,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:05,184 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820061486] [2021-06-05 08:28:05,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:28:05,265 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:05,265 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820061486] [2021-06-05 08:28:05,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820061486] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:05,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:28:05,266 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:28:05,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537423920] [2021-06-05 08:28:05,266 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:28:05,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:05,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:28:05,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:28:05,272 INFO L87 Difference]: Start difference. First operand has 2375 states, 2364 states have (on average 3.0833333333333335) internal successors, (7289), 2374 states have internal predecessors, (7289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:05,326 INFO L93 Difference]: Finished difference Result 1833 states and 5140 transitions. [2021-06-05 08:28:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:28:05,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-06-05 08:28:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:05,337 INFO L225 Difference]: With dead ends: 1833 [2021-06-05 08:28:05,338 INFO L226 Difference]: Without dead ends: 1761 [2021-06-05 08:28:05,338 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 40.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:28:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2021-06-05 08:28:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1426. [2021-06-05 08:28:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1423 states have (on average 2.799718903724526) internal successors, (3984), 1425 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 3984 transitions. [2021-06-05 08:28:05,415 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 3984 transitions. Word has length 25 [2021-06-05 08:28:05,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:05,415 INFO L482 AbstractCegarLoop]: Abstraction has 1426 states and 3984 transitions. [2021-06-05 08:28:05,415 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 3984 transitions. [2021-06-05 08:28:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-06-05 08:28:05,416 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:05,416 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:05,416 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 08:28:05,417 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:05,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:05,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1516982070, now seen corresponding path program 1 times [2021-06-05 08:28:05,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:05,418 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017355948] [2021-06-05 08:28:05,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:28:05,509 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:05,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017355948] [2021-06-05 08:28:05,509 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017355948] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:05,510 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:28:05,510 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:28:05,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048419297] [2021-06-05 08:28:05,510 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:28:05,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:05,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:28:05,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:28:05,511 INFO L87 Difference]: Start difference. First operand 1426 states and 3984 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:05,560 INFO L93 Difference]: Finished difference Result 1580 states and 4399 transitions. [2021-06-05 08:28:05,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:28:05,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-06-05 08:28:05,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:05,566 INFO L225 Difference]: With dead ends: 1580 [2021-06-05 08:28:05,566 INFO L226 Difference]: Without dead ends: 1340 [2021-06-05 08:28:05,566 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:28:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2021-06-05 08:28:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1220. [2021-06-05 08:28:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 1218 states have (on average 2.7947454844006567) internal successors, (3404), 1219 states have internal predecessors, (3404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 3404 transitions. [2021-06-05 08:28:05,593 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 3404 transitions. Word has length 28 [2021-06-05 08:28:05,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:05,593 INFO L482 AbstractCegarLoop]: Abstraction has 1220 states and 3404 transitions. [2021-06-05 08:28:05,593 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 3404 transitions. [2021-06-05 08:28:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 08:28:05,594 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:05,594 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:05,595 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 08:28:05,595 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:05,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1598583638, now seen corresponding path program 1 times [2021-06-05 08:28:05,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:05,595 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823549146] [2021-06-05 08:28:05,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:28:05,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:05,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823549146] [2021-06-05 08:28:05,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823549146] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:05,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:28:05,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:28:05,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782361823] [2021-06-05 08:28:05,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:28:05,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:05,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:28:05,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:28:05,708 INFO L87 Difference]: Start difference. First operand 1220 states and 3404 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:05,749 INFO L93 Difference]: Finished difference Result 1508 states and 4224 transitions. [2021-06-05 08:28:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:28:05,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 08:28:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:05,755 INFO L225 Difference]: With dead ends: 1508 [2021-06-05 08:28:05,755 INFO L226 Difference]: Without dead ends: 1508 [2021-06-05 08:28:05,756 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 49.0ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:28:05,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2021-06-05 08:28:05,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1372. [2021-06-05 08:28:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1370 states have (on average 2.797810218978102) internal successors, (3833), 1371 states have internal predecessors, (3833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 3833 transitions. [2021-06-05 08:28:05,782 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 3833 transitions. Word has length 32 [2021-06-05 08:28:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:05,783 INFO L482 AbstractCegarLoop]: Abstraction has 1372 states and 3833 transitions. [2021-06-05 08:28:05,784 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 3833 transitions. [2021-06-05 08:28:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-06-05 08:28:05,800 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:05,800 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:05,800 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 08:28:05,800 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:05,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:05,800 INFO L82 PathProgramCache]: Analyzing trace with hash 808710156, now seen corresponding path program 1 times [2021-06-05 08:28:05,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:05,801 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787475665] [2021-06-05 08:28:05,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:28:05,841 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:05,841 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787475665] [2021-06-05 08:28:05,841 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787475665] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:05,841 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:28:05,841 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:28:05,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911409138] [2021-06-05 08:28:05,841 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:28:05,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:05,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:28:05,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:28:05,842 INFO L87 Difference]: Start difference. First operand 1372 states and 3833 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:05,883 INFO L93 Difference]: Finished difference Result 1620 states and 4490 transitions. [2021-06-05 08:28:05,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:28:05,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-06-05 08:28:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:05,888 INFO L225 Difference]: With dead ends: 1620 [2021-06-05 08:28:05,889 INFO L226 Difference]: Without dead ends: 1359 [2021-06-05 08:28:05,889 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:28:05,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2021-06-05 08:28:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1223. [2021-06-05 08:28:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 1222 states have (on average 2.8011456628477904) internal successors, (3423), 1222 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3423 transitions. [2021-06-05 08:28:05,911 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3423 transitions. Word has length 35 [2021-06-05 08:28:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:05,911 INFO L482 AbstractCegarLoop]: Abstraction has 1223 states and 3423 transitions. [2021-06-05 08:28:05,911 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3423 transitions. [2021-06-05 08:28:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 08:28:05,912 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:05,912 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:05,912 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 08:28:05,913 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:05,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:05,913 INFO L82 PathProgramCache]: Analyzing trace with hash -18085915, now seen corresponding path program 1 times [2021-06-05 08:28:05,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:05,913 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379662136] [2021-06-05 08:28:05,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:28:05,950 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:05,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379662136] [2021-06-05 08:28:05,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379662136] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:05,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800832069] [2021-06-05 08:28:05,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:28:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:06,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 21 conjunts are in the unsatisfiable core [2021-06-05 08:28:06,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:28:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:28:06,131 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800832069] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:06,131 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:28:06,131 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 11 [2021-06-05 08:28:06,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106368030] [2021-06-05 08:28:06,132 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:28:06,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:06,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:28:06,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:28:06,132 INFO L87 Difference]: Start difference. First operand 1223 states and 3423 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:06,220 INFO L93 Difference]: Finished difference Result 686 states and 1745 transitions. [2021-06-05 08:28:06,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 08:28:06,220 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 08:28:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:06,221 INFO L225 Difference]: With dead ends: 686 [2021-06-05 08:28:06,221 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 08:28:06,221 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 62.8ms TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:28:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 08:28:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 08:28:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 08:28:06,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2021-06-05 08:28:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:06,221 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 08:28:06,222 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 08:28:06,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 08:28:06,441 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-06-05 08:28:06,441 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 08:28:06,441 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 08:28:06,442 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:28:06,442 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:28:06,442 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:28:06,442 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:28:06,442 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:28:06,444 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:28:06,445 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:28:06,445 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 08:28:06,446 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 55 transitions, 122 flow [2021-06-05 08:28:06,483 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2375 states, 2364 states have (on average 3.0833333333333335) internal successors, (7289), 2374 states have internal predecessors, (7289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 2375 states, 2364 states have (on average 3.0833333333333335) internal successors, (7289), 2374 states have internal predecessors, (7289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-05 08:28:06,488 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:06,488 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:06,488 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 08:28:06,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:06,489 INFO L82 PathProgramCache]: Analyzing trace with hash -267490146, now seen corresponding path program 1 times [2021-06-05 08:28:06,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:06,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836177111] [2021-06-05 08:28:06,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:28:06,494 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:28:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:28:06,498 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:28:06,501 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 08:28:06,501 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 08:28:06,501 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 08:28:06,501 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 08:28:06,501 WARN L242 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 08:28:06,501 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2021-06-05 08:28:06,507 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,508 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,508 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,509 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,509 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,510 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,511 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,512 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,513 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,513 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,514 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,514 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,515 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,515 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,516 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,516 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,517 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:06,517 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:28:06,518 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 08:28:06,518 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:28:06,518 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:28:06,518 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:28:06,518 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:28:06,518 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:28:06,519 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:28:06,519 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:28:06,519 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:28:06,519 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 70 transitions, 161 flow [2021-06-05 08:28:09,104 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 30767 states, 30744 states have (on average 4.155607598230549) internal successors, (127760), 30766 states have internal predecessors, (127760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 30767 states, 30744 states have (on average 4.155607598230549) internal successors, (127760), 30766 states have internal predecessors, (127760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:09,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 08:28:09,148 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:09,148 INFO L521 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] [2021-06-05 08:28:09,148 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:09,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:09,149 INFO L82 PathProgramCache]: Analyzing trace with hash -968710086, now seen corresponding path program 1 times [2021-06-05 08:28:09,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:09,149 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880482712] [2021-06-05 08:28:09,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:28:09,210 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:09,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880482712] [2021-06-05 08:28:09,210 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880482712] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:09,210 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:28:09,210 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:28:09,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414357110] [2021-06-05 08:28:09,211 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:28:09,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:09,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:28:09,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:28:09,250 INFO L87 Difference]: Start difference. First operand has 30767 states, 30744 states have (on average 4.155607598230549) internal successors, (127760), 30766 states have internal predecessors, (127760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:09,582 INFO L93 Difference]: Finished difference Result 22124 states and 84167 transitions. [2021-06-05 08:28:09,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:28:09,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-06-05 08:28:09,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:09,792 INFO L225 Difference]: With dead ends: 22124 [2021-06-05 08:28:09,792 INFO L226 Difference]: Without dead ends: 21908 [2021-06-05 08:28:09,793 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 37.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:28:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21908 states. [2021-06-05 08:28:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21908 to 16950. [2021-06-05 08:28:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16950 states, 16943 states have (on average 3.8074130909520156) internal successors, (64509), 16949 states have internal predecessors, (64509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16950 states to 16950 states and 64509 transitions. [2021-06-05 08:28:10,500 INFO L78 Accepts]: Start accepts. Automaton has 16950 states and 64509 transitions. Word has length 25 [2021-06-05 08:28:10,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:10,500 INFO L482 AbstractCegarLoop]: Abstraction has 16950 states and 64509 transitions. [2021-06-05 08:28:10,500 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 16950 states and 64509 transitions. [2021-06-05 08:28:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-06-05 08:28:10,501 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:10,501 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:10,501 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 08:28:10,501 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:10,501 INFO L82 PathProgramCache]: Analyzing trace with hash -955898244, now seen corresponding path program 1 times [2021-06-05 08:28:10,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:10,502 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069636410] [2021-06-05 08:28:10,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:28:10,544 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:10,544 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069636410] [2021-06-05 08:28:10,544 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069636410] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:10,544 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:28:10,544 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:28:10,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670072802] [2021-06-05 08:28:10,545 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:28:10,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:10,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:28:10,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:28:10,545 INFO L87 Difference]: Start difference. First operand 16950 states and 64509 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:10,741 INFO L93 Difference]: Finished difference Result 21619 states and 81704 transitions. [2021-06-05 08:28:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:28:10,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-06-05 08:28:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:10,803 INFO L225 Difference]: With dead ends: 21619 [2021-06-05 08:28:10,803 INFO L226 Difference]: Without dead ends: 20899 [2021-06-05 08:28:10,803 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:28:11,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20899 states. [2021-06-05 08:28:11,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20899 to 18514. [2021-06-05 08:28:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18514 states, 18508 states have (on average 3.812351415604063) internal successors, (70559), 18513 states have internal predecessors, (70559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18514 states to 18514 states and 70559 transitions. [2021-06-05 08:28:11,532 INFO L78 Accepts]: Start accepts. Automaton has 18514 states and 70559 transitions. Word has length 28 [2021-06-05 08:28:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:11,532 INFO L482 AbstractCegarLoop]: Abstraction has 18514 states and 70559 transitions. [2021-06-05 08:28:11,532 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 18514 states and 70559 transitions. [2021-06-05 08:28:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 08:28:11,534 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:11,534 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:11,534 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 08:28:11,534 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:11,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:11,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1305575830, now seen corresponding path program 1 times [2021-06-05 08:28:11,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:11,534 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895358276] [2021-06-05 08:28:11,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:28:11,620 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:11,620 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895358276] [2021-06-05 08:28:11,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895358276] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:11,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:28:11,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:28:11,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19938703] [2021-06-05 08:28:11,621 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:28:11,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:11,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:28:11,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:28:11,621 INFO L87 Difference]: Start difference. First operand 18514 states and 70559 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:11,917 INFO L93 Difference]: Finished difference Result 23581 states and 89791 transitions. [2021-06-05 08:28:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:28:11,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 08:28:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:11,999 INFO L225 Difference]: With dead ends: 23581 [2021-06-05 08:28:11,999 INFO L226 Difference]: Without dead ends: 23581 [2021-06-05 08:28:12,000 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 40.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:28:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23581 states. [2021-06-05 08:28:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23581 to 19959. [2021-06-05 08:28:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19959 states, 19953 states have (on average 3.8070966771914) internal successors, (75963), 19958 states have internal predecessors, (75963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19959 states to 19959 states and 75963 transitions. [2021-06-05 08:28:12,725 INFO L78 Accepts]: Start accepts. Automaton has 19959 states and 75963 transitions. Word has length 32 [2021-06-05 08:28:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:12,726 INFO L482 AbstractCegarLoop]: Abstraction has 19959 states and 75963 transitions. [2021-06-05 08:28:12,726 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 19959 states and 75963 transitions. [2021-06-05 08:28:12,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-06-05 08:28:12,728 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:12,728 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:12,728 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 08:28:12,728 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:12,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:12,728 INFO L82 PathProgramCache]: Analyzing trace with hash -813255186, now seen corresponding path program 1 times [2021-06-05 08:28:12,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:12,729 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367966365] [2021-06-05 08:28:12,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:28:12,779 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:12,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367966365] [2021-06-05 08:28:12,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367966365] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:12,779 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:28:12,779 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:28:12,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119944951] [2021-06-05 08:28:12,779 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:28:12,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:12,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:28:12,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:28:12,780 INFO L87 Difference]: Start difference. First operand 19959 states and 75963 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:12,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:12,966 INFO L93 Difference]: Finished difference Result 26112 states and 98575 transitions. [2021-06-05 08:28:12,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:28:12,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-06-05 08:28:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:13,049 INFO L225 Difference]: With dead ends: 26112 [2021-06-05 08:28:13,049 INFO L226 Difference]: Without dead ends: 25392 [2021-06-05 08:28:13,049 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:28:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25392 states. [2021-06-05 08:28:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25392 to 22481. [2021-06-05 08:28:13,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22481 states, 22476 states have (on average 3.8107314468766686) internal successors, (85650), 22480 states have internal predecessors, (85650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22481 states to 22481 states and 85650 transitions. [2021-06-05 08:28:13,759 INFO L78 Accepts]: Start accepts. Automaton has 22481 states and 85650 transitions. Word has length 35 [2021-06-05 08:28:13,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:13,759 INFO L482 AbstractCegarLoop]: Abstraction has 22481 states and 85650 transitions. [2021-06-05 08:28:13,759 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 22481 states and 85650 transitions. [2021-06-05 08:28:13,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 08:28:13,761 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:13,761 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:13,761 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 08:28:13,761 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash 252303833, now seen corresponding path program 1 times [2021-06-05 08:28:13,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:13,762 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334519253] [2021-06-05 08:28:13,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:28:13,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:13,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334519253] [2021-06-05 08:28:13,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334519253] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:13,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086493044] [2021-06-05 08:28:13,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:28:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:13,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 21 conjunts are in the unsatisfiable core [2021-06-05 08:28:13,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:28:14,069 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2021-06-05 08:28:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:28:14,129 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086493044] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:14,130 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:28:14,130 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 9 [2021-06-05 08:28:14,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442277364] [2021-06-05 08:28:14,131 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 08:28:14,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:14,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 08:28:14,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 08:28:14,132 INFO L87 Difference]: Start difference. First operand 22481 states and 85650 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:14,270 INFO L93 Difference]: Finished difference Result 9430 states and 32023 transitions. [2021-06-05 08:28:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 08:28:14,270 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 08:28:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:14,277 INFO L225 Difference]: With dead ends: 9430 [2021-06-05 08:28:14,277 INFO L226 Difference]: Without dead ends: 2845 [2021-06-05 08:28:14,278 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 50.9ms TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 08:28:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2021-06-05 08:28:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2349. [2021-06-05 08:28:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 2348 states have (on average 3.4744463373083474) internal successors, (8158), 2348 states have internal predecessors, (8158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:14,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 8158 transitions. [2021-06-05 08:28:14,316 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 8158 transitions. Word has length 37 [2021-06-05 08:28:14,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:14,316 INFO L482 AbstractCegarLoop]: Abstraction has 2349 states and 8158 transitions. [2021-06-05 08:28:14,316 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 8158 transitions. [2021-06-05 08:28:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-06-05 08:28:14,317 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:14,317 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:14,533 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-06-05 08:28:14,533 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:14,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:14,534 INFO L82 PathProgramCache]: Analyzing trace with hash 905416891, now seen corresponding path program 1 times [2021-06-05 08:28:14,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:14,534 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607593867] [2021-06-05 08:28:14,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-06-05 08:28:14,624 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:14,624 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607593867] [2021-06-05 08:28:14,624 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607593867] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:14,624 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:28:14,624 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:28:14,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175516405] [2021-06-05 08:28:14,624 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:28:14,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:14,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:28:14,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:28:14,626 INFO L87 Difference]: Start difference. First operand 2349 states and 8158 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:14,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:14,654 INFO L93 Difference]: Finished difference Result 3917 states and 13786 transitions. [2021-06-05 08:28:14,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:28:14,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-06-05 08:28:14,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:14,664 INFO L225 Difference]: With dead ends: 3917 [2021-06-05 08:28:14,664 INFO L226 Difference]: Without dead ends: 3917 [2021-06-05 08:28:14,664 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 41.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:28:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2021-06-05 08:28:14,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3525. [2021-06-05 08:28:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 3524 states have (on average 3.5127695800227015) internal successors, (12379), 3524 states have internal predecessors, (12379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 12379 transitions. [2021-06-05 08:28:14,724 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 12379 transitions. Word has length 39 [2021-06-05 08:28:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:14,724 INFO L482 AbstractCegarLoop]: Abstraction has 3525 states and 12379 transitions. [2021-06-05 08:28:14,724 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 12379 transitions. [2021-06-05 08:28:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 08:28:14,726 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:14,726 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:14,726 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 08:28:14,726 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:14,727 INFO L82 PathProgramCache]: Analyzing trace with hash 880978957, now seen corresponding path program 1 times [2021-06-05 08:28:14,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:14,727 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100873782] [2021-06-05 08:28:14,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-06-05 08:28:14,761 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:14,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100873782] [2021-06-05 08:28:14,761 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100873782] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:14,761 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:28:14,761 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:28:14,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104084866] [2021-06-05 08:28:14,762 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:28:14,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:14,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:28:14,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:28:14,762 INFO L87 Difference]: Start difference. First operand 3525 states and 12379 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:14,783 INFO L93 Difference]: Finished difference Result 2741 states and 9565 transitions. [2021-06-05 08:28:14,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:28:14,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 08:28:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:14,784 INFO L225 Difference]: With dead ends: 2741 [2021-06-05 08:28:14,784 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 08:28:14,784 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:28:14,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 08:28:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 08:28:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 08:28:14,785 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2021-06-05 08:28:14,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:14,785 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 08:28:14,785 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 08:28:14,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 08:28:14,785 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 08:28:14,785 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 08:28:14,785 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 08:28:14,786 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:28:14,786 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:28:14,786 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:28:14,786 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:28:14,786 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:28:14,786 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:28:14,786 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:28:14,786 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 08:28:14,788 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 70 transitions, 161 flow [2021-06-05 08:28:17,304 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 30767 states, 30744 states have (on average 4.155607598230549) internal successors, (127760), 30766 states have internal predecessors, (127760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 30767 states, 30744 states have (on average 4.155607598230549) internal successors, (127760), 30766 states have internal predecessors, (127760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-06-05 08:28:17,342 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:17,342 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:17,342 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 08:28:17,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:17,343 INFO L82 PathProgramCache]: Analyzing trace with hash 679980973, now seen corresponding path program 1 times [2021-06-05 08:28:17,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:17,343 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049347139] [2021-06-05 08:28:17,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:28:17,350 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:28:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:28:17,355 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:28:17,360 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 08:28:17,360 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 08:28:17,360 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 08:28:17,361 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 08:28:17,361 WARN L242 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 08:28:17,361 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,369 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,370 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,370 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,370 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,370 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,370 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,371 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,371 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,372 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,372 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,373 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,374 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,375 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,376 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,377 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,379 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,379 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,380 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,381 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,381 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,382 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,383 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,384 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,384 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,385 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,385 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:28:17,385 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:28:17,386 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-05 08:28:17,386 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:28:17,386 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:28:17,387 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:28:17,387 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:28:17,387 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:28:17,387 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:28:17,387 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:28:17,387 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:28:17,388 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 85 transitions, 202 flow [2021-06-05 08:37:20,855 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 399863 states, 399816 states have (on average 5.230833683494407) internal successors, (2091371), 399862 states have internal predecessors, (2091371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:37:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 399863 states, 399816 states have (on average 5.230833683494407) internal successors, (2091371), 399862 states have internal predecessors, (2091371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:37:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 08:37:21,326 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:37:21,326 INFO L521 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] [2021-06-05 08:37:21,327 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:37:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:37:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1115692515, now seen corresponding path program 1 times [2021-06-05 08:37:21,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:37:21,327 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307698873] [2021-06-05 08:37:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:37:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:37:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:37:21,383 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:37:21,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307698873] [2021-06-05 08:37:21,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307698873] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:37:21,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:37:21,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:37:21,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207998585] [2021-06-05 08:37:21,383 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:37:21,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:37:21,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:37:21,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:37:21,844 INFO L87 Difference]: Start difference. First operand has 399863 states, 399816 states have (on average 5.230833683494407) internal successors, (2091371), 399862 states have internal predecessors, (2091371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:37:24,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:37:24,851 INFO L93 Difference]: Finished difference Result 256273 states and 1230449 transitions. [2021-06-05 08:37:24,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:37:24,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-06-05 08:37:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:37:26,384 INFO L225 Difference]: With dead ends: 256273 [2021-06-05 08:37:26,384 INFO L226 Difference]: Without dead ends: 255625 [2021-06-05 08:37:26,384 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:37:31,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255625 states. [2021-06-05 08:37:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255625 to 198122. [2021-06-05 08:37:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198122 states, 198107 states have (on average 4.808290469291848) internal successors, (952556), 198121 states have internal predecessors, (952556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:37:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198122 states to 198122 states and 952556 transitions. [2021-06-05 08:37:38,746 INFO L78 Accepts]: Start accepts. Automaton has 198122 states and 952556 transitions. Word has length 25 [2021-06-05 08:37:38,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:37:38,746 INFO L482 AbstractCegarLoop]: Abstraction has 198122 states and 952556 transitions. [2021-06-05 08:37:38,746 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:37:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 198122 states and 952556 transitions. [2021-06-05 08:37:38,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-06-05 08:37:38,747 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:37:38,747 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:37:38,747 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 08:37:38,747 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:37:38,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:37:38,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1157299644, now seen corresponding path program 1 times [2021-06-05 08:37:38,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:37:38,748 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000968836] [2021-06-05 08:37:38,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:37:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:37:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:37:38,783 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:37:38,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000968836] [2021-06-05 08:37:38,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000968836] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:37:38,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:37:38,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:37:38,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931087758] [2021-06-05 08:37:38,783 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:37:38,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:37:38,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:37:38,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:37:38,784 INFO L87 Difference]: Start difference. First operand 198122 states and 952556 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:37:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:37:41,347 INFO L93 Difference]: Finished difference Result 274296 states and 1308416 transitions. [2021-06-05 08:37:41,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:37:41,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-06-05 08:37:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:37:43,109 INFO L225 Difference]: With dead ends: 274296 [2021-06-05 08:37:43,109 INFO L226 Difference]: Without dead ends: 272136 [2021-06-05 08:37:43,109 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:37:48,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272136 states. [2021-06-05 08:37:54,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272136 to 236796. [2021-06-05 08:37:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236796 states, 236782 states have (on average 4.811708660286677) internal successors, (1139326), 236795 states have internal predecessors, (1139326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:37:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236796 states to 236796 states and 1139326 transitions. [2021-06-05 08:37:56,187 INFO L78 Accepts]: Start accepts. Automaton has 236796 states and 1139326 transitions. Word has length 28 [2021-06-05 08:37:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:37:56,187 INFO L482 AbstractCegarLoop]: Abstraction has 236796 states and 1139326 transitions. [2021-06-05 08:37:56,187 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:37:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 236796 states and 1139326 transitions. [2021-06-05 08:37:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 08:37:56,188 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:37:56,188 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:37:56,188 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 08:37:56,188 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:37:56,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:37:56,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1336870614, now seen corresponding path program 1 times [2021-06-05 08:37:56,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:37:56,188 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398338783] [2021-06-05 08:37:56,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:37:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:37:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:37:56,252 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:37:56,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398338783] [2021-06-05 08:37:56,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398338783] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:37:56,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:37:56,253 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:37:56,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717437426] [2021-06-05 08:37:56,253 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:37:56,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:37:56,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:37:56,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:37:56,253 INFO L87 Difference]: Start difference. First operand 236796 states and 1139326 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:37:59,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:37:59,706 INFO L93 Difference]: Finished difference Result 296706 states and 1425529 transitions. [2021-06-05 08:37:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:37:59,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 08:37:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:38:02,435 INFO L225 Difference]: With dead ends: 296706 [2021-06-05 08:38:02,435 INFO L226 Difference]: Without dead ends: 296706 [2021-06-05 08:38:02,435 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 35.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:38:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296706 states. [2021-06-05 08:38:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296706 to 249245. [2021-06-05 08:38:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249245 states, 249231 states have (on average 4.8070224009051845) internal successors, (1198059), 249244 states have internal predecessors, (1198059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249245 states to 249245 states and 1198059 transitions. [2021-06-05 08:38:16,053 INFO L78 Accepts]: Start accepts. Automaton has 249245 states and 1198059 transitions. Word has length 32 [2021-06-05 08:38:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:38:16,053 INFO L482 AbstractCegarLoop]: Abstraction has 249245 states and 1198059 transitions. [2021-06-05 08:38:16,054 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 249245 states and 1198059 transitions. [2021-06-05 08:38:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-06-05 08:38:16,055 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:38:16,055 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:38:16,055 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 08:38:16,055 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:38:16,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:38:16,055 INFO L82 PathProgramCache]: Analyzing trace with hash -518149967, now seen corresponding path program 1 times [2021-06-05 08:38:16,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:38:16,056 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230009218] [2021-06-05 08:38:16,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:38:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:38:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:38:16,099 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:38:16,099 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230009218] [2021-06-05 08:38:16,099 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230009218] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:38:16,099 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:38:16,099 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:38:16,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428341985] [2021-06-05 08:38:16,100 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:38:16,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:38:16,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:38:16,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:38:16,100 INFO L87 Difference]: Start difference. First operand 249245 states and 1198059 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:38:19,292 INFO L93 Difference]: Finished difference Result 346608 states and 1652691 transitions. [2021-06-05 08:38:19,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:38:19,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-06-05 08:38:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:38:21,462 INFO L225 Difference]: With dead ends: 346608 [2021-06-05 08:38:21,462 INFO L226 Difference]: Without dead ends: 344448 [2021-06-05 08:38:21,462 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:38:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344448 states. [2021-06-05 08:38:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344448 to 300262. [2021-06-05 08:38:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300262 states, 300249 states have (on average 4.809927759959234) internal successors, (1444176), 300261 states have internal predecessors, (1444176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300262 states to 300262 states and 1444176 transitions. [2021-06-05 08:38:38,045 INFO L78 Accepts]: Start accepts. Automaton has 300262 states and 1444176 transitions. Word has length 35 [2021-06-05 08:38:38,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:38:38,045 INFO L482 AbstractCegarLoop]: Abstraction has 300262 states and 1444176 transitions. [2021-06-05 08:38:38,045 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 300262 states and 1444176 transitions. [2021-06-05 08:38:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 08:38:38,048 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:38:38,048 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:38:38,048 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-05 08:38:38,048 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:38:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:38:38,048 INFO L82 PathProgramCache]: Analyzing trace with hash 867393630, now seen corresponding path program 1 times [2021-06-05 08:38:38,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:38:38,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092404974] [2021-06-05 08:38:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:38:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:38:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:38:38,609 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:38:38,609 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092404974] [2021-06-05 08:38:38,609 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092404974] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:38:38,609 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443007009] [2021-06-05 08:38:38,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:38:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:38:38,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 21 conjunts are in the unsatisfiable core [2021-06-05 08:38:38,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:38:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:38:38,903 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443007009] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:38:38,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:38:38,904 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 9 [2021-06-05 08:38:38,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145902370] [2021-06-05 08:38:38,904 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 08:38:38,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:38:38,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 08:38:38,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 08:38:38,904 INFO L87 Difference]: Start difference. First operand 300262 states and 1444176 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:38:39,854 INFO L93 Difference]: Finished difference Result 93059 states and 400725 transitions. [2021-06-05 08:38:39,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 08:38:39,854 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 08:38:39,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:38:39,988 INFO L225 Difference]: With dead ends: 93059 [2021-06-05 08:38:39,988 INFO L226 Difference]: Without dead ends: 36750 [2021-06-05 08:38:39,989 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 72.8ms TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 08:38:40,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36750 states. [2021-06-05 08:38:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36750 to 30588. [2021-06-05 08:38:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30588 states, 30586 states have (on average 4.375204341855751) internal successors, (133820), 30587 states have internal predecessors, (133820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30588 states to 30588 states and 133820 transitions. [2021-06-05 08:38:41,344 INFO L78 Accepts]: Start accepts. Automaton has 30588 states and 133820 transitions. Word has length 37 [2021-06-05 08:38:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:38:41,344 INFO L482 AbstractCegarLoop]: Abstraction has 30588 states and 133820 transitions. [2021-06-05 08:38:41,345 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 30588 states and 133820 transitions. [2021-06-05 08:38:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-06-05 08:38:41,357 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:38:41,357 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:38:41,572 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-06-05 08:38:41,572 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:38:41,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:38:41,572 INFO L82 PathProgramCache]: Analyzing trace with hash 43012350, now seen corresponding path program 1 times [2021-06-05 08:38:41,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:38:41,572 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600398146] [2021-06-05 08:38:41,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:38:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:38:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-06-05 08:38:41,663 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:38:41,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600398146] [2021-06-05 08:38:41,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600398146] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:38:41,663 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:38:41,663 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:38:41,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703655741] [2021-06-05 08:38:41,664 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:38:41,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:38:41,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:38:41,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:38:41,664 INFO L87 Difference]: Start difference. First operand 30588 states and 133820 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:38:42,350 INFO L93 Difference]: Finished difference Result 55480 states and 242936 transitions. [2021-06-05 08:38:42,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:38:42,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-06-05 08:38:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:38:42,677 INFO L225 Difference]: With dead ends: 55480 [2021-06-05 08:38:42,677 INFO L226 Difference]: Without dead ends: 55480 [2021-06-05 08:38:42,677 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:38:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55480 states. [2021-06-05 08:38:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55480 to 39849. [2021-06-05 08:38:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39849 states, 39847 states have (on average 4.372851155670439) internal successors, (174245), 39848 states have internal predecessors, (174245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39849 states to 39849 states and 174245 transitions. [2021-06-05 08:38:44,262 INFO L78 Accepts]: Start accepts. Automaton has 39849 states and 174245 transitions. Word has length 39 [2021-06-05 08:38:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:38:44,262 INFO L482 AbstractCegarLoop]: Abstraction has 39849 states and 174245 transitions. [2021-06-05 08:38:44,262 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 39849 states and 174245 transitions. [2021-06-05 08:38:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 08:38:44,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:38:44,264 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:38:44,264 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 08:38:44,264 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:38:44,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:38:44,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1481747103, now seen corresponding path program 1 times [2021-06-05 08:38:44,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:38:44,266 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451582174] [2021-06-05 08:38:44,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:38:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:38:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-06-05 08:38:44,314 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:38:44,314 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451582174] [2021-06-05 08:38:44,314 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451582174] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:38:44,314 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:38:44,314 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:38:44,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712760267] [2021-06-05 08:38:44,314 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:38:44,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:38:44,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:38:44,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:38:44,315 INFO L87 Difference]: Start difference. First operand 39849 states and 174245 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:38:44,541 INFO L93 Difference]: Finished difference Result 33675 states and 147295 transitions. [2021-06-05 08:38:44,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:38:44,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 08:38:44,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:38:44,612 INFO L225 Difference]: With dead ends: 33675 [2021-06-05 08:38:44,612 INFO L226 Difference]: Without dead ends: 14874 [2021-06-05 08:38:44,612 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:38:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14874 states. [2021-06-05 08:38:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14874 to 14874. [2021-06-05 08:38:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14874 states, 14873 states have (on average 4.378336583069992) internal successors, (65119), 14873 states have internal predecessors, (65119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14874 states to 14874 states and 65119 transitions. [2021-06-05 08:38:44,970 INFO L78 Accepts]: Start accepts. Automaton has 14874 states and 65119 transitions. Word has length 42 [2021-06-05 08:38:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:38:44,971 INFO L482 AbstractCegarLoop]: Abstraction has 14874 states and 65119 transitions. [2021-06-05 08:38:44,971 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 14874 states and 65119 transitions. [2021-06-05 08:38:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 08:38:44,973 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:38:44,973 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:38:44,973 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 08:38:44,973 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:38:44,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:38:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash 592890583, now seen corresponding path program 1 times [2021-06-05 08:38:44,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:38:44,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291553449] [2021-06-05 08:38:44,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:38:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:38:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-05 08:38:45,078 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:38:45,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291553449] [2021-06-05 08:38:45,079 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291553449] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:38:45,079 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:38:45,079 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:38:45,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185746467] [2021-06-05 08:38:45,079 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:38:45,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:38:45,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:38:45,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:38:45,080 INFO L87 Difference]: Start difference. First operand 14874 states and 65119 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:38:45,408 INFO L93 Difference]: Finished difference Result 25850 states and 113923 transitions. [2021-06-05 08:38:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:38:45,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 08:38:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:38:45,534 INFO L225 Difference]: With dead ends: 25850 [2021-06-05 08:38:45,534 INFO L226 Difference]: Without dead ends: 25850 [2021-06-05 08:38:45,535 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 51.2ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:38:45,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25850 states. [2021-06-05 08:38:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25850 to 23106. [2021-06-05 08:38:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23106 states, 23105 states have (on average 4.402596840510712) internal successors, (101722), 23105 states have internal predecessors, (101722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23106 states to 23106 states and 101722 transitions. [2021-06-05 08:38:46,099 INFO L78 Accepts]: Start accepts. Automaton has 23106 states and 101722 transitions. Word has length 46 [2021-06-05 08:38:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:38:46,100 INFO L482 AbstractCegarLoop]: Abstraction has 23106 states and 101722 transitions. [2021-06-05 08:38:46,100 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 23106 states and 101722 transitions. [2021-06-05 08:38:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-06-05 08:38:46,104 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:38:46,104 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:38:46,104 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 08:38:46,104 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:38:46,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:38:46,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1898933364, now seen corresponding path program 1 times [2021-06-05 08:38:46,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:38:46,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247462482] [2021-06-05 08:38:46,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:38:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:38:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-06-05 08:38:46,184 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:38:46,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247462482] [2021-06-05 08:38:46,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247462482] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:38:46,184 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:38:46,184 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:38:46,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641146294] [2021-06-05 08:38:46,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:38:46,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:38:46,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:38:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:38:46,185 INFO L87 Difference]: Start difference. First operand 23106 states and 101722 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:38:46,313 INFO L93 Difference]: Finished difference Result 17618 states and 77320 transitions. [2021-06-05 08:38:46,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:38:46,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-06-05 08:38:46,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:38:46,313 INFO L225 Difference]: With dead ends: 17618 [2021-06-05 08:38:46,313 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 08:38:46,314 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:38:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 08:38:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 08:38:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 08:38:46,314 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2021-06-05 08:38:46,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:38:46,314 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 08:38:46,314 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:38:46,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 08:38:46,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 08:38:46,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 08:38:46,314 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 08:38:46,315 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 08:38:46,323 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:38:46,323 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:38:46,323 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:38:46,324 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:38:46,324 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:38:46,324 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:38:46,324 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:38:46,324 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 08:38:46,324 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 85 transitions, 202 flow Received shutdown request... [2021-06-05 08:41:41,168 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 08:41:41,169 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 08:41:41,169 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2021-06-05 08:41:41,171 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 08:41:41,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 08:41:41 BasicIcfg [2021-06-05 08:41:41,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 08:41:41,173 INFO L168 Benchmark]: Toolchain (without parser) took 817679.20 ms. Allocated memory was 343.9 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 306.4 MB in the beginning and 7.6 GB in the end (delta: -7.3 GB). Peak memory consumption was 9.0 GB. Max. memory is 16.0 GB. [2021-06-05 08:41:41,173 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 343.9 MB. Free memory is still 324.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 08:41:41,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.81 ms. Allocated memory is still 343.9 MB. Free memory was 306.2 MB in the beginning and 306.2 MB in the end (delta: -3.5 kB). Peak memory consumption was 10.1 MB. Max. memory is 16.0 GB. [2021-06-05 08:41:41,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.03 ms. Allocated memory is still 343.9 MB. Free memory was 306.2 MB in the beginning and 304.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 08:41:41,173 INFO L168 Benchmark]: Boogie Preprocessor took 12.80 ms. Allocated memory is still 343.9 MB. Free memory was 304.2 MB in the beginning and 303.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 08:41:41,173 INFO L168 Benchmark]: RCFGBuilder took 386.64 ms. Allocated memory is still 343.9 MB. Free memory was 302.9 MB in the beginning and 318.3 MB in the end (delta: -15.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-06-05 08:41:41,174 INFO L168 Benchmark]: TraceAbstraction took 816825.30 ms. Allocated memory was 343.9 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 317.6 MB in the beginning and 7.6 GB in the end (delta: -7.3 GB). Peak memory consumption was 9.0 GB. Max. memory is 16.0 GB. [2021-06-05 08:41:41,174 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 343.9 MB. Free memory is still 324.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 410.81 ms. Allocated memory is still 343.9 MB. Free memory was 306.2 MB in the beginning and 306.2 MB in the end (delta: -3.5 kB). Peak memory consumption was 10.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 38.03 ms. Allocated memory is still 343.9 MB. Free memory was 306.2 MB in the beginning and 304.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 12.80 ms. Allocated memory is still 343.9 MB. Free memory was 304.2 MB in the beginning and 303.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 386.64 ms. Allocated memory is still 343.9 MB. Free memory was 302.9 MB in the beginning and 318.3 MB in the end (delta: -15.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 816825.30 ms. Allocated memory was 343.9 MB in the beginning and 15.9 GB in the end (delta: 15.5 GB). Free memory was 317.6 MB in the beginning and 7.6 GB in the end (delta: -7.3 GB). Peak memory consumption was 9.0 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 709]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 85 places, 85 transitions, 202 flow. Already constructed 258807 states. Currently 27564 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 51 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 602.4ms, OverallIterations: 2, TraceHistogramMax: 2, EmptinessCheckTime: 7.2ms, AutomataDifference: 85.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 84 SDtfs, 50 SDslu, 149 SDs, 0 SdLazy, 39 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 99.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 17.2ms AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 5.2ms SsaConstructionTime, 84.5ms SatisfiabilityAnalysisTime, 306.0ms InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 3/3 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 64 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1327.2ms, OverallIterations: 5, TraceHistogramMax: 2, EmptinessCheckTime: 24.0ms, AutomataDifference: 311.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 63.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 392 SDtfs, 288 SDslu, 975 SDs, 0 SdLazy, 369 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 169.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 184.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2375occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 152.2ms AutomataMinimizationTime, 5 MinimizatonAttempts, 727 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 11.8ms SsaConstructionTime, 70.6ms SatisfiabilityAnalysisTime, 403.5ms InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 847 SizeOfPredicates, 1 NumberOfNonLiveVariables, 106 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 16/26 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 77 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8266.8ms, OverallIterations: 7, TraceHistogramMax: 3, EmptinessCheckTime: 50.9ms, AutomataDifference: 1696.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2585.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 683 SDtfs, 596 SDslu, 1429 SDs, 0 SdLazy, 496 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 266.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 221.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=30767occurred in iteration=0, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2968.2ms AutomataMinimizationTime, 7 MinimizatonAttempts, 14764 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 12.0ms SsaConstructionTime, 49.4ms SatisfiabilityAnalysisTime, 608.4ms InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 1059 SizeOfPredicates, 1 NumberOfNonLiveVariables, 106 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 53/63 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 - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 90 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 628927.9ms, OverallIterations: 9, TraceHistogramMax: 4, EmptinessCheckTime: 488.9ms, AutomataDifference: 23851.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 543475.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1080 SDtfs, 1039 SDslu, 2244 SDs, 0 SdLazy, 791 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 422.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 298.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=399863occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 59501.9ms AutomataMinimizationTime, 9 MinimizatonAttempts, 209027 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 13.5ms SsaConstructionTime, 63.5ms SatisfiabilityAnalysisTime, 588.6ms InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 1364 SizeOfPredicates, 1 NumberOfNonLiveVariables, 106 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 128/138 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 51 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 88.2ms, OverallIterations: 1, TraceHistogramMax: 2, EmptinessCheckTime: 6.3ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1ms SsaConstructionTime, 4.6ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 64 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 59.1ms, OverallIterations: 1, TraceHistogramMax: 3, EmptinessCheckTime: 5.1ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 38.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2375occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5ms SsaConstructionTime, 2.9ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 3 thread instances CFG has 5 procedures, 77 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2574.4ms, OverallIterations: 1, TraceHistogramMax: 4, EmptinessCheckTime: 37.3ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2518.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=30767occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6ms SsaConstructionTime, 3.2ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 4 thread instances CFG has 6 procedures, 90 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 174845.3ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 174844.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown