/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-507b705 [2020-09-11 15:57:46,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-11 15:57:46,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-11 15:57:46,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-11 15:57:46,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-11 15:57:46,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-11 15:57:46,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-11 15:57:46,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-11 15:57:46,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-11 15:57:46,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-11 15:57:46,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-11 15:57:46,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-11 15:57:46,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-11 15:57:46,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-11 15:57:46,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-11 15:57:46,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-11 15:57:46,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-11 15:57:46,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-11 15:57:46,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-11 15:57:46,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-11 15:57:46,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-11 15:57:46,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-11 15:57:46,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-11 15:57:46,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-11 15:57:46,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-11 15:57:46,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-11 15:57:46,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-11 15:57:46,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-11 15:57:46,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-11 15:57:46,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-11 15:57:46,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-11 15:57:46,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-11 15:57:46,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-11 15:57:46,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-11 15:57:46,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-11 15:57:46,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-11 15:57:46,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-11 15:57:46,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-11 15:57:46,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-11 15:57:46,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-11 15:57:46,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-11 15:57:46,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-11 15:57:46,925 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-11 15:57:46,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-11 15:57:46,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-11 15:57:46,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-11 15:57:46,929 INFO L138 SettingsManager]: * Use SBE=true [2020-09-11 15:57:46,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-11 15:57:46,929 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-11 15:57:46,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-11 15:57:46,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-11 15:57:46,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-11 15:57:46,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-11 15:57:46,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-11 15:57:46,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-11 15:57:46,932 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-11 15:57:46,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-11 15:57:46,932 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-11 15:57:46,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-11 15:57:46,933 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-11 15:57:46,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-11 15:57:46,933 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-11 15:57:46,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-11 15:57:46,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-11 15:57:46,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-11 15:57:46,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-11 15:57:46,934 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-11 15:57:46,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-11 15:57:46,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-11 15:57:46,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-11 15:57:46,935 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-11 15:57:46,935 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-11 15:57:47,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-11 15:57:47,390 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-11 15:57:47,395 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-11 15:57:47,397 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-11 15:57:47,397 INFO L275 PluginConnector]: CDTParser initialized [2020-09-11 15:57:47,399 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2020-09-11 15:57:47,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7c9bc9e34/e075a49caca8425aa4ed5da28389aa8a/FLAG3c2babe66 [2020-09-11 15:57:48,132 INFO L306 CDTParser]: Found 1 translation units. [2020-09-11 15:57:48,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2020-09-11 15:57:48,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7c9bc9e34/e075a49caca8425aa4ed5da28389aa8a/FLAG3c2babe66 [2020-09-11 15:57:48,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7c9bc9e34/e075a49caca8425aa4ed5da28389aa8a [2020-09-11 15:57:48,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-11 15:57:48,470 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-11 15:57:48,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-11 15:57:48,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-11 15:57:48,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-11 15:57:48,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 03:57:48" (1/1) ... [2020-09-11 15:57:48,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68da41c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 03:57:48, skipping insertion in model container [2020-09-11 15:57:48,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 03:57:48" (1/1) ... [2020-09-11 15:57:48,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-11 15:57:48,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-11 15:57:49,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-11 15:57:49,118 INFO L203 MainTranslator]: Completed pre-run [2020-09-11 15:57:49,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-11 15:57:49,278 INFO L208 MainTranslator]: Completed translation [2020-09-11 15:57:49,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 03:57:49 WrapperNode [2020-09-11 15:57:49,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-11 15:57:49,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-11 15:57:49,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-11 15:57:49,280 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-11 15:57:49,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 03:57:49" (1/1) ... [2020-09-11 15:57:49,313 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 03:57:49" (1/1) ... [2020-09-11 15:57:49,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-11 15:57:49,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-11 15:57:49,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-11 15:57:49,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-11 15:57:49,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 03:57:49" (1/1) ... [2020-09-11 15:57:49,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 03:57:49" (1/1) ... [2020-09-11 15:57:49,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 03:57:49" (1/1) ... [2020-09-11 15:57:49,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 03:57:49" (1/1) ... [2020-09-11 15:57:49,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 03:57:49" (1/1) ... [2020-09-11 15:57:49,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 03:57:49" (1/1) ... [2020-09-11 15:57:49,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 03:57:49" (1/1) ... [2020-09-11 15:57:49,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-11 15:57:49,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-11 15:57:49,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-11 15:57:49,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-11 15:57:49,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 03:57:49" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-11 15:57:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-09-11 15:57:49,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-09-11 15:57:49,448 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-09-11 15:57:49,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-09-11 15:57:49,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-11 15:57:49,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-11 15:57:49,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-11 15:57:49,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-11 15:57:49,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-11 15:57:49,452 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-11 15:57:49,823 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-11 15:57:49,823 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-09-11 15:57:49,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 03:57:49 BoogieIcfgContainer [2020-09-11 15:57:49,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-11 15:57:49,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-11 15:57:49,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-11 15:57:49,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-11 15:57:49,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 03:57:48" (1/3) ... [2020-09-11 15:57:49,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bde19ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 03:57:49, skipping insertion in model container [2020-09-11 15:57:49,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 03:57:49" (2/3) ... [2020-09-11 15:57:49,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bde19ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 03:57:49, skipping insertion in model container [2020-09-11 15:57:49,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 03:57:49" (3/3) ... [2020-09-11 15:57:49,840 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013-1.i [2020-09-11 15:57:49,853 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-11 15:57:49,853 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-11 15:57:49,863 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-11 15:57:49,865 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-11 15:57:49,896 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,897 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,897 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,898 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,898 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,898 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,899 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,899 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,900 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,900 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,901 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,901 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,902 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,902 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,903 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,907 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,907 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,907 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,908 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,908 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,918 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,918 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,919 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,919 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:49,945 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-09-11 15:57:49,970 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 15:57:49,970 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 15:57:49,971 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-11 15:57:49,971 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 15:57:49,971 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 15:57:49,971 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 15:57:49,971 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 15:57:49,971 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 15:57:49,987 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 112 flow [2020-09-11 15:57:49,989 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 112 flow [2020-09-11 15:57:50,032 INFO L129 PetriNetUnfolder]: 3/61 cut-off events. [2020-09-11 15:57:50,032 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-09-11 15:57:50,039 INFO L80 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2020-09-11 15:57:50,042 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 112 flow [2020-09-11 15:57:50,063 INFO L129 PetriNetUnfolder]: 3/61 cut-off events. [2020-09-11 15:57:50,064 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-09-11 15:57:50,065 INFO L80 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2020-09-11 15:57:50,067 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2020-09-11 15:57:50,068 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-09-11 15:57:51,329 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-09-11 15:57:51,396 INFO L206 etLargeBlockEncoding]: Checked pairs total: 576 [2020-09-11 15:57:51,397 INFO L214 etLargeBlockEncoding]: Total number of compositions: 45 [2020-09-11 15:57:51,402 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-09-11 15:57:51,417 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-09-11 15:57:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-09-11 15:57:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-09-11 15:57:51,446 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:51,447 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-09-11 15:57:51,448 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:57:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:51,457 INFO L82 PathProgramCache]: Analyzing trace with hash 208056, now seen corresponding path program 1 times [2020-09-11 15:57:51,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:51,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103889845] [2020-09-11 15:57:51,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:57:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:57:51,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103889845] [2020-09-11 15:57:51,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:57:51,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-09-11 15:57:51,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371400924] [2020-09-11 15:57:51,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 15:57:51,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:57:51,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 15:57:51,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 15:57:51,795 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-09-11 15:57:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:57:51,848 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-09-11 15:57:51,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 15:57:51,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-09-11 15:57:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:57:51,868 INFO L225 Difference]: With dead ends: 35 [2020-09-11 15:57:51,869 INFO L226 Difference]: Without dead ends: 31 [2020-09-11 15:57:51,871 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 15:57:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-09-11 15:57:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-09-11 15:57:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-09-11 15:57:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-09-11 15:57:51,927 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-09-11 15:57:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:57:51,927 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-09-11 15:57:51,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 15:57:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-09-11 15:57:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-09-11 15:57:51,928 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:51,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:57:51,929 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-11 15:57:51,929 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:57:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:51,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1139052385, now seen corresponding path program 1 times [2020-09-11 15:57:51,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:51,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068017072] [2020-09-11 15:57:51,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:57:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:57:52,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068017072] [2020-09-11 15:57:52,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:57:52,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-11 15:57:52,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345056493] [2020-09-11 15:57:52,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-11 15:57:52,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:57:52,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-11 15:57:52,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-09-11 15:57:52,069 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2020-09-11 15:57:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:57:52,085 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-09-11 15:57:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-11 15:57:52,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-09-11 15:57:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:57:52,087 INFO L225 Difference]: With dead ends: 26 [2020-09-11 15:57:52,087 INFO L226 Difference]: Without dead ends: 24 [2020-09-11 15:57:52,088 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-09-11 15:57:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-09-11 15:57:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-09-11 15:57:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-09-11 15:57:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-09-11 15:57:52,093 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-09-11 15:57:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:57:52,094 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-09-11 15:57:52,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-11 15:57:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-09-11 15:57:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-09-11 15:57:52,095 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:52,095 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-09-11 15:57:52,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-11 15:57:52,095 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:57:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:52,096 INFO L82 PathProgramCache]: Analyzing trace with hash -950894116, now seen corresponding path program 1 times [2020-09-11 15:57:52,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:52,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593697962] [2020-09-11 15:57:52,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 15:57:52,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 15:57:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 15:57:52,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 15:57:52,186 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-11 15:57:52,187 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-11 15:57:52,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-11 15:57:52,188 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-09-11 15:57:52,189 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-09-11 15:57:52,199 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,199 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,199 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,199 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,200 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,200 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,200 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,200 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,201 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,201 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,201 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,201 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,201 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,202 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,202 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,202 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,202 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,203 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,203 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,204 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,209 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,209 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,210 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,210 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,210 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,212 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,212 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,213 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,213 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,213 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,216 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,216 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,218 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,218 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,219 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,219 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:52,221 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-09-11 15:57:52,221 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 15:57:52,222 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 15:57:52,222 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-11 15:57:52,222 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 15:57:52,222 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 15:57:52,222 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 15:57:52,222 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 15:57:52,222 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 15:57:52,225 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions, 162 flow [2020-09-11 15:57:52,226 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions, 162 flow [2020-09-11 15:57:52,245 INFO L129 PetriNetUnfolder]: 4/83 cut-off events. [2020-09-11 15:57:52,246 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-09-11 15:57:52,247 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 141 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2020-09-11 15:57:52,250 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions, 162 flow [2020-09-11 15:57:52,266 INFO L129 PetriNetUnfolder]: 4/83 cut-off events. [2020-09-11 15:57:52,267 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-09-11 15:57:52,268 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 141 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2020-09-11 15:57:52,270 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2020-09-11 15:57:52,271 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-09-11 15:57:53,504 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-09-11 15:57:53,592 INFO L206 etLargeBlockEncoding]: Checked pairs total: 964 [2020-09-11 15:57:53,593 INFO L214 etLargeBlockEncoding]: Total number of compositions: 59 [2020-09-11 15:57:53,593 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 21 transitions, 66 flow [2020-09-11 15:57:53,611 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2020-09-11 15:57:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2020-09-11 15:57:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-09-11 15:57:53,612 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:53,612 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-09-11 15:57:53,612 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:57:53,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:53,613 INFO L82 PathProgramCache]: Analyzing trace with hash 354555, now seen corresponding path program 1 times [2020-09-11 15:57:53,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:53,613 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961531395] [2020-09-11 15:57:53,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:57:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:57:53,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961531395] [2020-09-11 15:57:53,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:57:53,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-09-11 15:57:53,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199082173] [2020-09-11 15:57:53,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 15:57:53,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:57:53,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 15:57:53,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 15:57:53,652 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2020-09-11 15:57:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:57:53,678 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2020-09-11 15:57:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 15:57:53,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-09-11 15:57:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:57:53,683 INFO L225 Difference]: With dead ends: 185 [2020-09-11 15:57:53,684 INFO L226 Difference]: Without dead ends: 171 [2020-09-11 15:57:53,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 15:57:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-09-11 15:57:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-09-11 15:57:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-09-11 15:57:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 418 transitions. [2020-09-11 15:57:53,710 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 418 transitions. Word has length 3 [2020-09-11 15:57:53,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:57:53,710 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 418 transitions. [2020-09-11 15:57:53,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 15:57:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 418 transitions. [2020-09-11 15:57:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-11 15:57:53,711 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:53,711 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:57:53,711 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-11 15:57:53,712 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:57:53,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:53,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1106209149, now seen corresponding path program 1 times [2020-09-11 15:57:53,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:53,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284056348] [2020-09-11 15:57:53,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:57:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:57:53,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284056348] [2020-09-11 15:57:53,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:57:53,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:57:53,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679154026] [2020-09-11 15:57:53,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:57:53,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:57:53,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:57:53,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:57:53,835 INFO L87 Difference]: Start difference. First operand 171 states and 418 transitions. Second operand 5 states. [2020-09-11 15:57:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:57:53,920 INFO L93 Difference]: Finished difference Result 205 states and 460 transitions. [2020-09-11 15:57:53,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:57:53,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-09-11 15:57:53,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:57:53,926 INFO L225 Difference]: With dead ends: 205 [2020-09-11 15:57:53,926 INFO L226 Difference]: Without dead ends: 201 [2020-09-11 15:57:53,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:57:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-09-11 15:57:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2020-09-11 15:57:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-09-11 15:57:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2020-09-11 15:57:53,959 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2020-09-11 15:57:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:57:53,959 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2020-09-11 15:57:53,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:57:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2020-09-11 15:57:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-11 15:57:53,961 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:53,962 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:57:53,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-11 15:57:53,962 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:57:53,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:53,962 INFO L82 PathProgramCache]: Analyzing trace with hash 583411714, now seen corresponding path program 1 times [2020-09-11 15:57:53,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:53,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207691684] [2020-09-11 15:57:53,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:57:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:57:54,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207691684] [2020-09-11 15:57:54,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:57:54,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:57:54,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799702496] [2020-09-11 15:57:54,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:57:54,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:57:54,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:57:54,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:57:54,028 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2020-09-11 15:57:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:57:54,089 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2020-09-11 15:57:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:57:54,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-11 15:57:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:57:54,092 INFO L225 Difference]: With dead ends: 189 [2020-09-11 15:57:54,092 INFO L226 Difference]: Without dead ends: 185 [2020-09-11 15:57:54,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:57:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-09-11 15:57:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2020-09-11 15:57:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-09-11 15:57:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2020-09-11 15:57:54,107 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2020-09-11 15:57:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:57:54,108 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2020-09-11 15:57:54,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:57:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2020-09-11 15:57:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-11 15:57:54,110 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:54,110 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:57:54,110 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-11 15:57:54,110 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:57:54,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:54,111 INFO L82 PathProgramCache]: Analyzing trace with hash 903154619, now seen corresponding path program 1 times [2020-09-11 15:57:54,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:54,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308481397] [2020-09-11 15:57:54,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 15:57:54,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 15:57:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 15:57:54,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 15:57:54,149 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-11 15:57:54,149 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-11 15:57:54,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-11 15:57:54,150 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-09-11 15:57:54,151 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-09-11 15:57:54,161 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,161 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,162 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,162 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,162 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,162 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,162 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,163 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,163 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,163 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,163 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,163 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,164 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,164 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,164 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,164 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,164 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,164 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,165 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,165 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,165 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,165 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,165 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,166 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,166 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,166 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,166 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,170 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,171 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,171 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,172 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,172 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,173 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,173 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,173 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,174 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,174 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,174 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,174 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,174 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,176 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,176 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,177 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,177 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,177 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,178 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,178 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,179 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,179 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,179 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,180 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,181 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,181 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,183 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,183 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,183 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,183 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,183 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,184 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,185 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,185 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,185 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,186 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,186 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:54,187 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-09-11 15:57:54,188 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 15:57:54,188 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 15:57:54,188 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-11 15:57:54,188 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 15:57:54,188 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 15:57:54,188 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 15:57:54,188 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 15:57:54,188 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 15:57:54,190 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 87 transitions, 216 flow [2020-09-11 15:57:54,191 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions, 216 flow [2020-09-11 15:57:54,208 INFO L129 PetriNetUnfolder]: 5/105 cut-off events. [2020-09-11 15:57:54,209 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-09-11 15:57:54,210 INFO L80 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2020-09-11 15:57:54,213 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions, 216 flow [2020-09-11 15:57:54,227 INFO L129 PetriNetUnfolder]: 5/105 cut-off events. [2020-09-11 15:57:54,228 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-09-11 15:57:54,229 INFO L80 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2020-09-11 15:57:54,231 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2020-09-11 15:57:54,232 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-09-11 15:57:55,822 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-09-11 15:57:56,028 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1796 [2020-09-11 15:57:56,028 INFO L214 etLargeBlockEncoding]: Total number of compositions: 73 [2020-09-11 15:57:56,028 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 27 transitions, 96 flow [2020-09-11 15:57:56,057 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2020-09-11 15:57:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2020-09-11 15:57:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-09-11 15:57:56,058 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:56,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-09-11 15:57:56,059 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:57:56,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:56,059 INFO L82 PathProgramCache]: Analyzing trace with hash 535749, now seen corresponding path program 1 times [2020-09-11 15:57:56,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:56,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697847226] [2020-09-11 15:57:56,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:57:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:57:56,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697847226] [2020-09-11 15:57:56,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:57:56,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-09-11 15:57:56,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513756076] [2020-09-11 15:57:56,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 15:57:56,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:57:56,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 15:57:56,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 15:57:56,091 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2020-09-11 15:57:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:57:56,125 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2020-09-11 15:57:56,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 15:57:56,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-09-11 15:57:56,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:57:56,131 INFO L225 Difference]: With dead ends: 600 [2020-09-11 15:57:56,132 INFO L226 Difference]: Without dead ends: 559 [2020-09-11 15:57:56,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 15:57:56,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2020-09-11 15:57:56,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2020-09-11 15:57:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2020-09-11 15:57:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1737 transitions. [2020-09-11 15:57:56,192 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1737 transitions. Word has length 3 [2020-09-11 15:57:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:57:56,192 INFO L479 AbstractCegarLoop]: Abstraction has 559 states and 1737 transitions. [2020-09-11 15:57:56,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 15:57:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1737 transitions. [2020-09-11 15:57:56,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-11 15:57:56,193 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:56,193 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:57:56,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-11 15:57:56,194 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:57:56,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:56,194 INFO L82 PathProgramCache]: Analyzing trace with hash -404806880, now seen corresponding path program 1 times [2020-09-11 15:57:56,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:56,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234365089] [2020-09-11 15:57:56,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:57:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:57:56,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234365089] [2020-09-11 15:57:56,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:57:56,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:57:56,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687877903] [2020-09-11 15:57:56,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:57:56,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:57:56,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:57:56,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:57:56,245 INFO L87 Difference]: Start difference. First operand 559 states and 1737 transitions. Second operand 5 states. [2020-09-11 15:57:56,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:57:56,352 INFO L93 Difference]: Finished difference Result 817 states and 2317 transitions. [2020-09-11 15:57:56,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:57:56,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-09-11 15:57:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:57:56,360 INFO L225 Difference]: With dead ends: 817 [2020-09-11 15:57:56,360 INFO L226 Difference]: Without dead ends: 812 [2020-09-11 15:57:56,361 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:57:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-09-11 15:57:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 585. [2020-09-11 15:57:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2020-09-11 15:57:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1832 transitions. [2020-09-11 15:57:56,391 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1832 transitions. Word has length 9 [2020-09-11 15:57:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:57:56,391 INFO L479 AbstractCegarLoop]: Abstraction has 585 states and 1832 transitions. [2020-09-11 15:57:56,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:57:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1832 transitions. [2020-09-11 15:57:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-11 15:57:56,393 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:56,393 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:57:56,393 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-11 15:57:56,393 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:57:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:56,394 INFO L82 PathProgramCache]: Analyzing trace with hash -669323978, now seen corresponding path program 1 times [2020-09-11 15:57:56,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:56,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640957878] [2020-09-11 15:57:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:56,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:57:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:57:56,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640957878] [2020-09-11 15:57:56,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:57:56,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:57:56,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674721617] [2020-09-11 15:57:56,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:57:56,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:57:56,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:57:56,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:57:56,446 INFO L87 Difference]: Start difference. First operand 585 states and 1832 transitions. Second operand 5 states. [2020-09-11 15:57:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:57:56,535 INFO L93 Difference]: Finished difference Result 843 states and 2406 transitions. [2020-09-11 15:57:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:57:56,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-11 15:57:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:57:56,543 INFO L225 Difference]: With dead ends: 843 [2020-09-11 15:57:56,543 INFO L226 Difference]: Without dead ends: 836 [2020-09-11 15:57:56,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:57:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-09-11 15:57:56,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 611. [2020-09-11 15:57:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2020-09-11 15:57:56,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1906 transitions. [2020-09-11 15:57:56,581 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1906 transitions. Word has length 13 [2020-09-11 15:57:56,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:57:56,582 INFO L479 AbstractCegarLoop]: Abstraction has 611 states and 1906 transitions. [2020-09-11 15:57:56,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:57:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1906 transitions. [2020-09-11 15:57:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 15:57:56,584 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:56,584 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:57:56,584 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-11 15:57:56,584 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:57:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:56,585 INFO L82 PathProgramCache]: Analyzing trace with hash -56737855, now seen corresponding path program 1 times [2020-09-11 15:57:56,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:56,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080071445] [2020-09-11 15:57:56,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:57:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:57:56,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080071445] [2020-09-11 15:57:56,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463330741] [2020-09-11 15:57:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-11 15:57:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:57:56,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 15:57:56,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:57:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:57:56,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:57:56,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 15:57:56,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107159985] [2020-09-11 15:57:56,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:57:56,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:57:56,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:57:56,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:57:56,788 INFO L87 Difference]: Start difference. First operand 611 states and 1906 transitions. Second operand 9 states. [2020-09-11 15:57:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:57:56,992 INFO L93 Difference]: Finished difference Result 1059 states and 2818 transitions. [2020-09-11 15:57:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:57:56,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-09-11 15:57:56,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:57:57,001 INFO L225 Difference]: With dead ends: 1059 [2020-09-11 15:57:57,001 INFO L226 Difference]: Without dead ends: 1052 [2020-09-11 15:57:57,002 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 15:57:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2020-09-11 15:57:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 591. [2020-09-11 15:57:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-09-11 15:57:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1840 transitions. [2020-09-11 15:57:57,034 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1840 transitions. Word has length 15 [2020-09-11 15:57:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:57:57,034 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 1840 transitions. [2020-09-11 15:57:57,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:57:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1840 transitions. [2020-09-11 15:57:57,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 15:57:57,035 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:57,036 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:57:57,249 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-09-11 15:57:57,250 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:57:57,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:57,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1024744543, now seen corresponding path program 2 times [2020-09-11 15:57:57,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:57,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762367808] [2020-09-11 15:57:57,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:57:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:57:57,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762367808] [2020-09-11 15:57:57,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:57:57,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:57:57,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055694394] [2020-09-11 15:57:57,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:57:57,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:57:57,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:57:57,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:57:57,318 INFO L87 Difference]: Start difference. First operand 591 states and 1840 transitions. Second operand 7 states. [2020-09-11 15:57:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:57:57,511 INFO L93 Difference]: Finished difference Result 1053 states and 2807 transitions. [2020-09-11 15:57:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:57:57,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-09-11 15:57:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:57:57,521 INFO L225 Difference]: With dead ends: 1053 [2020-09-11 15:57:57,521 INFO L226 Difference]: Without dead ends: 1045 [2020-09-11 15:57:57,522 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:57:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2020-09-11 15:57:57,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2020-09-11 15:57:57,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2020-09-11 15:57:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2020-09-11 15:57:57,558 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2020-09-11 15:57:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:57:57,558 INFO L479 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2020-09-11 15:57:57,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:57:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2020-09-11 15:57:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-11 15:57:57,560 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:57,560 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:57:57,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-11 15:57:57,560 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:57:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:57,561 INFO L82 PathProgramCache]: Analyzing trace with hash 68174732, now seen corresponding path program 1 times [2020-09-11 15:57:57,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:57,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868133023] [2020-09-11 15:57:57,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:57:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:57:57,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868133023] [2020-09-11 15:57:57,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:57:57,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:57:57,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040577493] [2020-09-11 15:57:57,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:57:57,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:57:57,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:57:57,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:57:57,651 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2020-09-11 15:57:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:57:57,733 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2020-09-11 15:57:57,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:57:57,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-11 15:57:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:57:57,739 INFO L225 Difference]: With dead ends: 736 [2020-09-11 15:57:57,739 INFO L226 Difference]: Without dead ends: 728 [2020-09-11 15:57:57,740 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:57:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2020-09-11 15:57:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2020-09-11 15:57:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2020-09-11 15:57:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2020-09-11 15:57:57,762 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2020-09-11 15:57:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:57:57,762 INFO L479 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2020-09-11 15:57:57,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:57:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2020-09-11 15:57:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-11 15:57:57,764 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:57:57,764 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:57:57,764 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-11 15:57:57,764 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:57:57,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:57:57,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2109628021, now seen corresponding path program 1 times [2020-09-11 15:57:57,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:57:57,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604943163] [2020-09-11 15:57:57,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:57:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 15:57:57,791 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 15:57:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 15:57:57,803 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 15:57:57,817 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-11 15:57:57,817 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-11 15:57:57,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-11 15:57:57,819 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-09-11 15:57:57,819 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-09-11 15:57:57,843 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,843 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,843 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,843 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,844 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,844 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,845 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,845 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,845 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,846 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,846 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,846 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,846 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,846 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,847 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,847 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,847 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,847 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,847 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,848 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,848 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,848 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,848 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,848 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,848 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,849 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,849 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,849 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,849 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,849 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,849 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,850 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,850 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,850 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,850 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,850 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,851 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,851 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,852 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,852 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,852 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,852 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,853 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,853 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,854 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,854 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,854 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,854 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,855 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,855 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,855 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,855 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,855 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,856 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,856 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,856 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,856 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,857 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,857 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,857 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,857 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,857 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,858 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,858 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,858 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,859 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,859 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,859 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,859 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,859 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,863 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,864 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,864 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,864 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,864 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,866 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,866 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,866 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,866 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,866 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,869 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,869 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,870 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,870 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,870 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,872 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,872 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,873 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,874 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,874 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,875 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,875 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,875 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,877 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,878 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,881 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,881 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,882 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,882 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:57:57,885 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-09-11 15:57:57,885 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 15:57:57,885 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 15:57:57,885 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-11 15:57:57,886 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 15:57:57,886 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 15:57:57,886 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 15:57:57,886 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 15:57:57,886 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 15:57:57,889 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 105 transitions, 274 flow [2020-09-11 15:57:57,890 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions, 274 flow [2020-09-11 15:57:57,918 INFO L129 PetriNetUnfolder]: 6/127 cut-off events. [2020-09-11 15:57:57,918 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-09-11 15:57:57,920 INFO L80 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 211 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2020-09-11 15:57:57,924 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions, 274 flow [2020-09-11 15:57:57,939 INFO L129 PetriNetUnfolder]: 6/127 cut-off events. [2020-09-11 15:57:57,939 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-09-11 15:57:57,940 INFO L80 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 211 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2020-09-11 15:57:57,944 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2020-09-11 15:57:57,944 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-09-11 15:57:59,887 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2020-09-11 15:57:59,963 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2240 [2020-09-11 15:57:59,963 INFO L214 etLargeBlockEncoding]: Total number of compositions: 92 [2020-09-11 15:57:59,963 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 33 transitions, 130 flow [2020-09-11 15:58:00,079 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2020-09-11 15:58:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2020-09-11 15:58:00,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-09-11 15:58:00,080 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:00,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-09-11 15:58:00,081 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:00,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:00,081 INFO L82 PathProgramCache]: Analyzing trace with hash 753552, now seen corresponding path program 1 times [2020-09-11 15:58:00,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:00,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73911812] [2020-09-11 15:58:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:58:00,105 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73911812] [2020-09-11 15:58:00,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:00,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-09-11 15:58:00,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47263874] [2020-09-11 15:58:00,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 15:58:00,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:00,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 15:58:00,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 15:58:00,107 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2020-09-11 15:58:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:00,157 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2020-09-11 15:58:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 15:58:00,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-09-11 15:58:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:00,176 INFO L225 Difference]: With dead ends: 1889 [2020-09-11 15:58:00,176 INFO L226 Difference]: Without dead ends: 1767 [2020-09-11 15:58:00,177 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 15:58:00,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2020-09-11 15:58:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2020-09-11 15:58:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-09-11 15:58:00,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 6690 transitions. [2020-09-11 15:58:00,303 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 6690 transitions. Word has length 3 [2020-09-11 15:58:00,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:00,303 INFO L479 AbstractCegarLoop]: Abstraction has 1767 states and 6690 transitions. [2020-09-11 15:58:00,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 15:58:00,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 6690 transitions. [2020-09-11 15:58:00,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-11 15:58:00,304 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:00,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:00,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-11 15:58:00,305 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:00,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:00,305 INFO L82 PathProgramCache]: Analyzing trace with hash -260829075, now seen corresponding path program 1 times [2020-09-11 15:58:00,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:00,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470499884] [2020-09-11 15:58:00,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:58:00,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470499884] [2020-09-11 15:58:00,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:00,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:58:00,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972048814] [2020-09-11 15:58:00,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:58:00,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:00,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:58:00,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:58:00,353 INFO L87 Difference]: Start difference. First operand 1767 states and 6690 transitions. Second operand 5 states. [2020-09-11 15:58:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:00,478 INFO L93 Difference]: Finished difference Result 2905 states and 10138 transitions. [2020-09-11 15:58:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:58:00,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-09-11 15:58:00,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:00,511 INFO L225 Difference]: With dead ends: 2905 [2020-09-11 15:58:00,511 INFO L226 Difference]: Without dead ends: 2899 [2020-09-11 15:58:00,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-09-11 15:58:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1966. [2020-09-11 15:58:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2020-09-11 15:58:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 7503 transitions. [2020-09-11 15:58:00,640 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 7503 transitions. Word has length 9 [2020-09-11 15:58:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:00,640 INFO L479 AbstractCegarLoop]: Abstraction has 1966 states and 7503 transitions. [2020-09-11 15:58:00,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:58:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 7503 transitions. [2020-09-11 15:58:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-11 15:58:00,641 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:00,641 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:00,641 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-11 15:58:00,641 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:00,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1408743431, now seen corresponding path program 1 times [2020-09-11 15:58:00,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:00,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625438734] [2020-09-11 15:58:00,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:58:00,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625438734] [2020-09-11 15:58:00,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:00,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:58:00,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401434606] [2020-09-11 15:58:00,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:58:00,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:00,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:58:00,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:58:00,701 INFO L87 Difference]: Start difference. First operand 1966 states and 7503 transitions. Second operand 5 states. [2020-09-11 15:58:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:00,803 INFO L93 Difference]: Finished difference Result 3204 states and 11312 transitions. [2020-09-11 15:58:00,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:58:00,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-11 15:58:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:00,842 INFO L225 Difference]: With dead ends: 3204 [2020-09-11 15:58:00,842 INFO L226 Difference]: Without dead ends: 3194 [2020-09-11 15:58:00,843 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2020-09-11 15:58:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2200. [2020-09-11 15:58:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2020-09-11 15:58:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 8453 transitions. [2020-09-11 15:58:00,965 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 8453 transitions. Word has length 13 [2020-09-11 15:58:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:00,967 INFO L479 AbstractCegarLoop]: Abstraction has 2200 states and 8453 transitions. [2020-09-11 15:58:00,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:58:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 8453 transitions. [2020-09-11 15:58:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 15:58:00,967 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:00,968 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:00,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-11 15:58:00,968 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:00,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1555768808, now seen corresponding path program 1 times [2020-09-11 15:58:00,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:00,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488389706] [2020-09-11 15:58:00,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:58:01,032 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488389706] [2020-09-11 15:58:01,032 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651591143] [2020-09-11 15:58:01,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-11 15:58:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:01,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 15:58:01,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:58:01,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:01,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 15:58:01,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670330710] [2020-09-11 15:58:01,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:58:01,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:01,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:58:01,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:58:01,137 INFO L87 Difference]: Start difference. First operand 2200 states and 8453 transitions. Second operand 9 states. [2020-09-11 15:58:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:01,404 INFO L93 Difference]: Finished difference Result 4556 states and 14911 transitions. [2020-09-11 15:58:01,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:01,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-09-11 15:58:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:01,427 INFO L225 Difference]: With dead ends: 4556 [2020-09-11 15:58:01,428 INFO L226 Difference]: Without dead ends: 4546 [2020-09-11 15:58:01,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 15:58:01,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2020-09-11 15:58:01,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 2157. [2020-09-11 15:58:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2020-09-11 15:58:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 8278 transitions. [2020-09-11 15:58:01,560 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 8278 transitions. Word has length 15 [2020-09-11 15:58:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:01,560 INFO L479 AbstractCegarLoop]: Abstraction has 2157 states and 8278 transitions. [2020-09-11 15:58:01,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:58:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 8278 transitions. [2020-09-11 15:58:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 15:58:01,561 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:01,561 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:01,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-09-11 15:58:01,775 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash -887756896, now seen corresponding path program 2 times [2020-09-11 15:58:01,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:01,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355242513] [2020-09-11 15:58:01,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:58:01,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355242513] [2020-09-11 15:58:01,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:01,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:58:01,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426837021] [2020-09-11 15:58:01,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:58:01,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:01,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:58:01,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:01,843 INFO L87 Difference]: Start difference. First operand 2157 states and 8278 transitions. Second operand 7 states. [2020-09-11 15:58:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:02,104 INFO L93 Difference]: Finished difference Result 4612 states and 15111 transitions. [2020-09-11 15:58:02,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:02,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-09-11 15:58:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:02,122 INFO L225 Difference]: With dead ends: 4612 [2020-09-11 15:58:02,122 INFO L226 Difference]: Without dead ends: 4601 [2020-09-11 15:58:02,123 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:58:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2020-09-11 15:58:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 2035. [2020-09-11 15:58:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2020-09-11 15:58:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 7845 transitions. [2020-09-11 15:58:02,250 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 7845 transitions. Word has length 15 [2020-09-11 15:58:02,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:02,251 INFO L479 AbstractCegarLoop]: Abstraction has 2035 states and 7845 transitions. [2020-09-11 15:58:02,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:58:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 7845 transitions. [2020-09-11 15:58:02,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-11 15:58:02,252 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:02,252 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:02,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-11 15:58:02,253 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:02,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:02,253 INFO L82 PathProgramCache]: Analyzing trace with hash 695111130, now seen corresponding path program 1 times [2020-09-11 15:58:02,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:02,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656256161] [2020-09-11 15:58:02,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:58:02,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656256161] [2020-09-11 15:58:02,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:02,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:58:02,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362182072] [2020-09-11 15:58:02,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:58:02,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:02,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:58:02,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:58:02,330 INFO L87 Difference]: Start difference. First operand 2035 states and 7845 transitions. Second operand 5 states. [2020-09-11 15:58:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:02,416 INFO L93 Difference]: Finished difference Result 3265 states and 11681 transitions. [2020-09-11 15:58:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:58:02,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-11 15:58:02,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:02,430 INFO L225 Difference]: With dead ends: 3265 [2020-09-11 15:58:02,431 INFO L226 Difference]: Without dead ends: 3250 [2020-09-11 15:58:02,431 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-09-11 15:58:02,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2281. [2020-09-11 15:58:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2281 states. [2020-09-11 15:58:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 8755 transitions. [2020-09-11 15:58:02,548 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 8755 transitions. Word has length 17 [2020-09-11 15:58:02,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:02,548 INFO L479 AbstractCegarLoop]: Abstraction has 2281 states and 8755 transitions. [2020-09-11 15:58:02,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:58:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 8755 transitions. [2020-09-11 15:58:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 15:58:02,595 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:02,595 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:02,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-11 15:58:02,595 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:02,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1754455113, now seen corresponding path program 1 times [2020-09-11 15:58:02,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:02,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85610872] [2020-09-11 15:58:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 15:58:02,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85610872] [2020-09-11 15:58:02,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176389365] [2020-09-11 15:58:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-11 15:58:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:02,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 15:58:02,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 15:58:02,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:02,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 15:58:02,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231549637] [2020-09-11 15:58:02,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:58:02,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:02,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:58:02,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:58:02,799 INFO L87 Difference]: Start difference. First operand 2281 states and 8755 transitions. Second operand 9 states. [2020-09-11 15:58:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:03,115 INFO L93 Difference]: Finished difference Result 4825 states and 15986 transitions. [2020-09-11 15:58:03,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:03,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-09-11 15:58:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:03,139 INFO L225 Difference]: With dead ends: 4825 [2020-09-11 15:58:03,139 INFO L226 Difference]: Without dead ends: 4813 [2020-09-11 15:58:03,140 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 15:58:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2020-09-11 15:58:03,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 2305. [2020-09-11 15:58:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2020-09-11 15:58:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 8815 transitions. [2020-09-11 15:58:03,269 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 8815 transitions. Word has length 19 [2020-09-11 15:58:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:03,271 INFO L479 AbstractCegarLoop]: Abstraction has 2305 states and 8815 transitions. [2020-09-11 15:58:03,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:58:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 8815 transitions. [2020-09-11 15:58:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 15:58:03,274 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:03,275 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:03,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:03,489 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:03,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash -131464925, now seen corresponding path program 1 times [2020-09-11 15:58:03,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:03,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713784905] [2020-09-11 15:58:03,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 15:58:03,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713784905] [2020-09-11 15:58:03,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915407931] [2020-09-11 15:58:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:03,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 15:58:03,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 15:58:03,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:03,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 15:58:03,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715000586] [2020-09-11 15:58:03,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:58:03,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:03,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:58:03,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:58:03,697 INFO L87 Difference]: Start difference. First operand 2305 states and 8815 transitions. Second operand 9 states. [2020-09-11 15:58:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:03,975 INFO L93 Difference]: Finished difference Result 4942 states and 16410 transitions. [2020-09-11 15:58:03,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:03,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-09-11 15:58:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:03,995 INFO L225 Difference]: With dead ends: 4942 [2020-09-11 15:58:03,995 INFO L226 Difference]: Without dead ends: 4925 [2020-09-11 15:58:03,996 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 15:58:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2020-09-11 15:58:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 2299. [2020-09-11 15:58:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2020-09-11 15:58:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 8782 transitions. [2020-09-11 15:58:04,181 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 8782 transitions. Word has length 19 [2020-09-11 15:58:04,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:04,181 INFO L479 AbstractCegarLoop]: Abstraction has 2299 states and 8782 transitions. [2020-09-11 15:58:04,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:58:04,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 8782 transitions. [2020-09-11 15:58:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 15:58:04,183 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:04,183 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:04,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:04,396 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:04,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2013120191, now seen corresponding path program 2 times [2020-09-11 15:58:04,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:04,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835998803] [2020-09-11 15:58:04,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:58:04,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835998803] [2020-09-11 15:58:04,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:04,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:58:04,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347557077] [2020-09-11 15:58:04,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:58:04,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:04,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:58:04,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:04,462 INFO L87 Difference]: Start difference. First operand 2299 states and 8782 transitions. Second operand 7 states. [2020-09-11 15:58:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:04,701 INFO L93 Difference]: Finished difference Result 4934 states and 16393 transitions. [2020-09-11 15:58:04,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:04,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 15:58:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:04,718 INFO L225 Difference]: With dead ends: 4934 [2020-09-11 15:58:04,719 INFO L226 Difference]: Without dead ends: 4917 [2020-09-11 15:58:04,719 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:58:04,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4917 states. [2020-09-11 15:58:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4917 to 2216. [2020-09-11 15:58:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2216 states. [2020-09-11 15:58:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 8477 transitions. [2020-09-11 15:58:04,822 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 8477 transitions. Word has length 19 [2020-09-11 15:58:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:04,823 INFO L479 AbstractCegarLoop]: Abstraction has 2216 states and 8477 transitions. [2020-09-11 15:58:04,823 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:58:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 8477 transitions. [2020-09-11 15:58:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 15:58:04,825 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:04,825 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:04,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-11 15:58:04,825 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:04,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:04,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2013113743, now seen corresponding path program 2 times [2020-09-11 15:58:04,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:04,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905163439] [2020-09-11 15:58:04,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:58:04,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905163439] [2020-09-11 15:58:04,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:04,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:58:04,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28490690] [2020-09-11 15:58:04,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:58:04,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:04,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:58:04,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:04,896 INFO L87 Difference]: Start difference. First operand 2216 states and 8477 transitions. Second operand 7 states. [2020-09-11 15:58:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:05,111 INFO L93 Difference]: Finished difference Result 4774 states and 15828 transitions. [2020-09-11 15:58:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:05,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 15:58:05,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:05,127 INFO L225 Difference]: With dead ends: 4774 [2020-09-11 15:58:05,127 INFO L226 Difference]: Without dead ends: 4757 [2020-09-11 15:58:05,128 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:58:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2020-09-11 15:58:05,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 2150. [2020-09-11 15:58:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2020-09-11 15:58:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 8243 transitions. [2020-09-11 15:58:05,220 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 8243 transitions. Word has length 19 [2020-09-11 15:58:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:05,220 INFO L479 AbstractCegarLoop]: Abstraction has 2150 states and 8243 transitions. [2020-09-11 15:58:05,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:58:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 8243 transitions. [2020-09-11 15:58:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:05,222 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:05,222 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:05,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-11 15:58:05,223 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:05,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:05,223 INFO L82 PathProgramCache]: Analyzing trace with hash -9146414, now seen corresponding path program 1 times [2020-09-11 15:58:05,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:05,223 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595822537] [2020-09-11 15:58:05,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:58:05,319 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595822537] [2020-09-11 15:58:05,319 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793725016] [2020-09-11 15:58:05,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:05,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:05,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:58:05,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:05,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:05,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625424882] [2020-09-11 15:58:05,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:05,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:05,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:05,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:05,437 INFO L87 Difference]: Start difference. First operand 2150 states and 8243 transitions. Second operand 11 states. [2020-09-11 15:58:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:06,221 INFO L93 Difference]: Finished difference Result 6025 states and 18746 transitions. [2020-09-11 15:58:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:06,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-09-11 15:58:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:06,235 INFO L225 Difference]: With dead ends: 6025 [2020-09-11 15:58:06,235 INFO L226 Difference]: Without dead ends: 6017 [2020-09-11 15:58:06,236 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-09-11 15:58:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 2117. [2020-09-11 15:58:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2020-09-11 15:58:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 8106 transitions. [2020-09-11 15:58:06,345 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 8106 transitions. Word has length 21 [2020-09-11 15:58:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:06,345 INFO L479 AbstractCegarLoop]: Abstraction has 2117 states and 8106 transitions. [2020-09-11 15:58:06,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 8106 transitions. [2020-09-11 15:58:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:06,347 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:06,347 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:06,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-09-11 15:58:06,560 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:06,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:06,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1890795232, now seen corresponding path program 2 times [2020-09-11 15:58:06,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:06,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741039986] [2020-09-11 15:58:06,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 15:58:06,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741039986] [2020-09-11 15:58:06,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86745471] [2020-09-11 15:58:06,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:06,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 15:58:06,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:58:06,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:06,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 15:58:06,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:06,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:06,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047245] [2020-09-11 15:58:06,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:06,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:06,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:06,774 INFO L87 Difference]: Start difference. First operand 2117 states and 8106 transitions. Second operand 11 states. [2020-09-11 15:58:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:07,419 INFO L93 Difference]: Finished difference Result 5914 states and 18384 transitions. [2020-09-11 15:58:07,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:07,420 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-09-11 15:58:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:07,430 INFO L225 Difference]: With dead ends: 5914 [2020-09-11 15:58:07,430 INFO L226 Difference]: Without dead ends: 5903 [2020-09-11 15:58:07,431 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2020-09-11 15:58:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 2085. [2020-09-11 15:58:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2020-09-11 15:58:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 7975 transitions. [2020-09-11 15:58:07,521 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 7975 transitions. Word has length 21 [2020-09-11 15:58:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:07,521 INFO L479 AbstractCegarLoop]: Abstraction has 2085 states and 7975 transitions. [2020-09-11 15:58:07,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 7975 transitions. [2020-09-11 15:58:07,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:07,524 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:07,524 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:07,738 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:07,738 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:07,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:07,739 INFO L82 PathProgramCache]: Analyzing trace with hash 180724060, now seen corresponding path program 3 times [2020-09-11 15:58:07,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:07,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271374866] [2020-09-11 15:58:07,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 15:58:07,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271374866] [2020-09-11 15:58:07,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570707458] [2020-09-11 15:58:07,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:08,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-09-11 15:58:08,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:58:08,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:08,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 15:58:08,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:08,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:08,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96369726] [2020-09-11 15:58:08,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:08,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:08,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:08,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:08,071 INFO L87 Difference]: Start difference. First operand 2085 states and 7975 transitions. Second operand 11 states. [2020-09-11 15:58:08,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:08,659 INFO L93 Difference]: Finished difference Result 5907 states and 18375 transitions. [2020-09-11 15:58:08,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:08,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-09-11 15:58:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:08,669 INFO L225 Difference]: With dead ends: 5907 [2020-09-11 15:58:08,669 INFO L226 Difference]: Without dead ends: 5899 [2020-09-11 15:58:08,670 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2020-09-11 15:58:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 2008. [2020-09-11 15:58:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2020-09-11 15:58:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 7698 transitions. [2020-09-11 15:58:08,764 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 7698 transitions. Word has length 21 [2020-09-11 15:58:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:08,765 INFO L479 AbstractCegarLoop]: Abstraction has 2008 states and 7698 transitions. [2020-09-11 15:58:08,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 7698 transitions. [2020-09-11 15:58:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:08,767 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:08,767 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:08,981 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-09-11 15:58:08,981 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:08,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:08,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1783759286, now seen corresponding path program 4 times [2020-09-11 15:58:08,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:08,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545226400] [2020-09-11 15:58:08,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 15:58:09,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545226400] [2020-09-11 15:58:09,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692755051] [2020-09-11 15:58:09,098 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:09,185 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-11 15:58:09,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:58:09,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:09,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-11 15:58:09,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:09,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:09,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592752990] [2020-09-11 15:58:09,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:09,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:09,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:09,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:09,226 INFO L87 Difference]: Start difference. First operand 2008 states and 7698 transitions. Second operand 11 states. [2020-09-11 15:58:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:09,846 INFO L93 Difference]: Finished difference Result 5835 states and 18155 transitions. [2020-09-11 15:58:09,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:09,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-09-11 15:58:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:09,856 INFO L225 Difference]: With dead ends: 5835 [2020-09-11 15:58:09,857 INFO L226 Difference]: Without dead ends: 5824 [2020-09-11 15:58:09,857 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2020-09-11 15:58:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 1976. [2020-09-11 15:58:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1976 states. [2020-09-11 15:58:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 7567 transitions. [2020-09-11 15:58:10,005 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 7567 transitions. Word has length 21 [2020-09-11 15:58:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:10,006 INFO L479 AbstractCegarLoop]: Abstraction has 1976 states and 7567 transitions. [2020-09-11 15:58:10,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 7567 transitions. [2020-09-11 15:58:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:10,008 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:10,008 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:10,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-09-11 15:58:10,223 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:10,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:10,223 INFO L82 PathProgramCache]: Analyzing trace with hash -964809789, now seen corresponding path program 1 times [2020-09-11 15:58:10,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:10,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737560163] [2020-09-11 15:58:10,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 15:58:10,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737560163] [2020-09-11 15:58:10,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:10,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:58:10,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601131001] [2020-09-11 15:58:10,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:58:10,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:10,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:58:10,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:58:10,277 INFO L87 Difference]: Start difference. First operand 1976 states and 7567 transitions. Second operand 5 states. [2020-09-11 15:58:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:10,362 INFO L93 Difference]: Finished difference Result 3016 states and 10840 transitions. [2020-09-11 15:58:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:58:10,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-09-11 15:58:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:10,368 INFO L225 Difference]: With dead ends: 3016 [2020-09-11 15:58:10,368 INFO L226 Difference]: Without dead ends: 3000 [2020-09-11 15:58:10,369 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-09-11 15:58:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 2183. [2020-09-11 15:58:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2020-09-11 15:58:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 8210 transitions. [2020-09-11 15:58:10,419 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 8210 transitions. Word has length 21 [2020-09-11 15:58:10,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:10,419 INFO L479 AbstractCegarLoop]: Abstraction has 2183 states and 8210 transitions. [2020-09-11 15:58:10,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:58:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 8210 transitions. [2020-09-11 15:58:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:10,421 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:10,421 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:10,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-09-11 15:58:10,421 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:10,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1873231848, now seen corresponding path program 5 times [2020-09-11 15:58:10,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:10,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133884775] [2020-09-11 15:58:10,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:58:10,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133884775] [2020-09-11 15:58:10,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:10,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 15:58:10,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931303431] [2020-09-11 15:58:10,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:58:10,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:10,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:58:10,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:58:10,511 INFO L87 Difference]: Start difference. First operand 2183 states and 8210 transitions. Second operand 9 states. [2020-09-11 15:58:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:11,067 INFO L93 Difference]: Finished difference Result 6150 states and 19247 transitions. [2020-09-11 15:58:11,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:11,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 15:58:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:11,082 INFO L225 Difference]: With dead ends: 6150 [2020-09-11 15:58:11,082 INFO L226 Difference]: Without dead ends: 6139 [2020-09-11 15:58:11,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 15:58:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6139 states. [2020-09-11 15:58:11,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6139 to 2096. [2020-09-11 15:58:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2096 states. [2020-09-11 15:58:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 7876 transitions. [2020-09-11 15:58:11,184 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 7876 transitions. Word has length 21 [2020-09-11 15:58:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:11,185 INFO L479 AbstractCegarLoop]: Abstraction has 2096 states and 7876 transitions. [2020-09-11 15:58:11,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:58:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 7876 transitions. [2020-09-11 15:58:11,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:11,187 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:11,187 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:11,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-09-11 15:58:11,187 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:11,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1867041768, now seen corresponding path program 6 times [2020-09-11 15:58:11,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:11,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257171226] [2020-09-11 15:58:11,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:11,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:58:11,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257171226] [2020-09-11 15:58:11,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:11,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 15:58:11,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671507066] [2020-09-11 15:58:11,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:58:11,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:11,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:58:11,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:58:11,295 INFO L87 Difference]: Start difference. First operand 2096 states and 7876 transitions. Second operand 9 states. [2020-09-11 15:58:11,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:11,865 INFO L93 Difference]: Finished difference Result 6017 states and 18791 transitions. [2020-09-11 15:58:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:11,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 15:58:11,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:11,881 INFO L225 Difference]: With dead ends: 6017 [2020-09-11 15:58:11,881 INFO L226 Difference]: Without dead ends: 6002 [2020-09-11 15:58:11,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 15:58:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-09-11 15:58:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2020-09-11 15:58:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2020-09-11 15:58:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2020-09-11 15:58:12,083 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2020-09-11 15:58:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:12,083 INFO L479 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2020-09-11 15:58:12,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:58:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2020-09-11 15:58:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-11 15:58:12,085 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:12,085 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:12,085 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-09-11 15:58:12,086 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-09-11 15:58:12,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:12,086 INFO L82 PathProgramCache]: Analyzing trace with hash 150840888, now seen corresponding path program 1 times [2020-09-11 15:58:12,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:12,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492756258] [2020-09-11 15:58:12,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 15:58:12,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 15:58:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 15:58:12,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 15:58:12,119 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-11 15:58:12,120 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-11 15:58:12,120 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-09-11 15:58:12,121 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-09-11 15:58:12,121 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-09-11 15:58:12,133 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,134 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,134 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,134 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,134 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,134 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,134 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,135 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,135 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,135 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,135 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,135 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,135 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,136 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,136 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,136 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,136 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,136 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,136 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,137 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,137 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,137 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,137 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,137 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,137 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,137 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,138 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,138 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,138 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,138 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,138 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,138 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,138 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,139 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,139 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,139 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,139 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,139 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,139 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,139 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,140 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,140 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,140 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,140 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,140 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,141 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,141 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,142 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,142 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,143 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,143 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,144 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,144 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,145 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,145 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,146 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,146 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,147 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,147 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,148 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,148 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,149 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,149 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,150 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,150 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,150 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,150 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,151 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,151 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,154 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,154 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,154 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,155 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,155 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,156 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,156 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,156 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,156 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,157 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,158 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,158 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,158 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,158 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,158 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,159 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,160 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,160 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,160 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,160 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,161 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,161 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,162 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,162 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,163 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,163 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,163 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,164 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,164 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,165 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,165 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,166 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,167 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,167 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,168 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,168 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,169 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,169 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,170 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:58:12,171 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-09-11 15:58:12,171 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 15:58:12,172 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 15:58:12,172 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-11 15:58:12,172 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 15:58:12,172 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 15:58:12,172 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 15:58:12,172 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 15:58:12,172 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 15:58:12,174 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 123 transitions, 336 flow [2020-09-11 15:58:12,174 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions, 336 flow [2020-09-11 15:58:12,191 INFO L129 PetriNetUnfolder]: 7/149 cut-off events. [2020-09-11 15:58:12,192 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-09-11 15:58:12,193 INFO L80 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2020-09-11 15:58:12,198 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions, 336 flow [2020-09-11 15:58:12,213 INFO L129 PetriNetUnfolder]: 7/149 cut-off events. [2020-09-11 15:58:12,213 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-09-11 15:58:12,215 INFO L80 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2020-09-11 15:58:12,219 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2020-09-11 15:58:12,219 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-09-11 15:58:14,290 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-09-11 15:58:14,373 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3096 [2020-09-11 15:58:14,374 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2020-09-11 15:58:14,374 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 39 transitions, 168 flow [2020-09-11 15:58:14,871 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2020-09-11 15:58:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2020-09-11 15:58:14,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-09-11 15:58:14,871 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:14,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-09-11 15:58:14,871 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:14,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:14,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1011964, now seen corresponding path program 1 times [2020-09-11 15:58:14,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:14,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517886635] [2020-09-11 15:58:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:58:14,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517886635] [2020-09-11 15:58:14,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:14,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-09-11 15:58:14,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222448530] [2020-09-11 15:58:14,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 15:58:14,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 15:58:14,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 15:58:14,902 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2020-09-11 15:58:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:14,973 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2020-09-11 15:58:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 15:58:14,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-09-11 15:58:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:14,994 INFO L225 Difference]: With dead ends: 5844 [2020-09-11 15:58:14,994 INFO L226 Difference]: Without dead ends: 5479 [2020-09-11 15:58:14,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 15:58:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-09-11 15:58:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-09-11 15:58:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-09-11 15:58:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 24493 transitions. [2020-09-11 15:58:15,170 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 24493 transitions. Word has length 3 [2020-09-11 15:58:15,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:15,170 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 24493 transitions. [2020-09-11 15:58:15,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 15:58:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 24493 transitions. [2020-09-11 15:58:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-11 15:58:15,170 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:15,170 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:15,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-09-11 15:58:15,171 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:15,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:15,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1084774388, now seen corresponding path program 1 times [2020-09-11 15:58:15,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:15,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318638868] [2020-09-11 15:58:15,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:58:15,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318638868] [2020-09-11 15:58:15,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:15,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:58:15,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858217417] [2020-09-11 15:58:15,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:58:15,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:15,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:58:15,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:58:15,214 INFO L87 Difference]: Start difference. First operand 5479 states and 24493 transitions. Second operand 5 states. [2020-09-11 15:58:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:15,345 INFO L93 Difference]: Finished difference Result 9673 states and 40333 transitions. [2020-09-11 15:58:15,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:58:15,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-09-11 15:58:15,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:15,369 INFO L225 Difference]: With dead ends: 9673 [2020-09-11 15:58:15,369 INFO L226 Difference]: Without dead ends: 9666 [2020-09-11 15:58:15,370 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:15,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2020-09-11 15:58:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 6331. [2020-09-11 15:58:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6331 states. [2020-09-11 15:58:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6331 states to 6331 states and 28544 transitions. [2020-09-11 15:58:15,598 INFO L78 Accepts]: Start accepts. Automaton has 6331 states and 28544 transitions. Word has length 9 [2020-09-11 15:58:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:15,598 INFO L479 AbstractCegarLoop]: Abstraction has 6331 states and 28544 transitions. [2020-09-11 15:58:15,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:58:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 6331 states and 28544 transitions. [2020-09-11 15:58:15,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-11 15:58:15,599 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:15,599 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:15,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-09-11 15:58:15,599 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:15,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:15,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2112403116, now seen corresponding path program 1 times [2020-09-11 15:58:15,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:15,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192629142] [2020-09-11 15:58:15,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:58:15,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192629142] [2020-09-11 15:58:15,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:15,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:58:15,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97427054] [2020-09-11 15:58:15,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:58:15,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:15,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:58:15,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:58:15,646 INFO L87 Difference]: Start difference. First operand 6331 states and 28544 transitions. Second operand 5 states. [2020-09-11 15:58:15,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:15,966 INFO L93 Difference]: Finished difference Result 11081 states and 46826 transitions. [2020-09-11 15:58:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:58:15,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-11 15:58:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:16,001 INFO L225 Difference]: With dead ends: 11081 [2020-09-11 15:58:16,001 INFO L226 Difference]: Without dead ends: 11068 [2020-09-11 15:58:16,002 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:16,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11068 states. [2020-09-11 15:58:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11068 to 7391. [2020-09-11 15:58:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7391 states. [2020-09-11 15:58:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7391 states to 7391 states and 33694 transitions. [2020-09-11 15:58:16,239 INFO L78 Accepts]: Start accepts. Automaton has 7391 states and 33694 transitions. Word has length 13 [2020-09-11 15:58:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:16,240 INFO L479 AbstractCegarLoop]: Abstraction has 7391 states and 33694 transitions. [2020-09-11 15:58:16,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:58:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 7391 states and 33694 transitions. [2020-09-11 15:58:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 15:58:16,240 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:16,240 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:16,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-09-11 15:58:16,241 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:16,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:16,241 INFO L82 PathProgramCache]: Analyzing trace with hash -28983895, now seen corresponding path program 1 times [2020-09-11 15:58:16,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:16,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275679940] [2020-09-11 15:58:16,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:58:16,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275679940] [2020-09-11 15:58:16,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341927174] [2020-09-11 15:58:16,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:16,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 15:58:16,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:58:16,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:16,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 15:58:16,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647757411] [2020-09-11 15:58:16,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:58:16,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:16,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:58:16,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:58:16,434 INFO L87 Difference]: Start difference. First operand 7391 states and 33694 transitions. Second operand 9 states. [2020-09-11 15:58:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:16,730 INFO L93 Difference]: Finished difference Result 16749 states and 66010 transitions. [2020-09-11 15:58:16,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:16,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-09-11 15:58:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:16,771 INFO L225 Difference]: With dead ends: 16749 [2020-09-11 15:58:16,771 INFO L226 Difference]: Without dead ends: 16736 [2020-09-11 15:58:16,771 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 15:58:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16736 states. [2020-09-11 15:58:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16736 to 7303. [2020-09-11 15:58:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7303 states. [2020-09-11 15:58:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7303 states to 7303 states and 33260 transitions. [2020-09-11 15:58:18,096 INFO L78 Accepts]: Start accepts. Automaton has 7303 states and 33260 transitions. Word has length 15 [2020-09-11 15:58:18,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:18,096 INFO L479 AbstractCegarLoop]: Abstraction has 7303 states and 33260 transitions. [2020-09-11 15:58:18,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:58:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 7303 states and 33260 transitions. [2020-09-11 15:58:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 15:58:18,097 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:18,097 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:18,303 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:18,304 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:18,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:18,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1500121559, now seen corresponding path program 2 times [2020-09-11 15:58:18,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:18,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703668776] [2020-09-11 15:58:18,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:58:18,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703668776] [2020-09-11 15:58:18,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:18,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:58:18,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011293353] [2020-09-11 15:58:18,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:58:18,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:18,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:58:18,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:18,379 INFO L87 Difference]: Start difference. First operand 7303 states and 33260 transitions. Second operand 7 states. [2020-09-11 15:58:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:18,687 INFO L93 Difference]: Finished difference Result 17085 states and 67393 transitions. [2020-09-11 15:58:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:18,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-09-11 15:58:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:18,729 INFO L225 Difference]: With dead ends: 17085 [2020-09-11 15:58:18,729 INFO L226 Difference]: Without dead ends: 17071 [2020-09-11 15:58:18,730 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:58:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17071 states. [2020-09-11 15:58:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17071 to 7048. [2020-09-11 15:58:18,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2020-09-11 15:58:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 32136 transitions. [2020-09-11 15:58:19,012 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 32136 transitions. Word has length 15 [2020-09-11 15:58:19,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:19,012 INFO L479 AbstractCegarLoop]: Abstraction has 7048 states and 32136 transitions. [2020-09-11 15:58:19,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:58:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 32136 transitions. [2020-09-11 15:58:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-11 15:58:19,013 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:19,013 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:19,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-09-11 15:58:19,013 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:19,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:19,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1891696605, now seen corresponding path program 1 times [2020-09-11 15:58:19,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:19,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444796602] [2020-09-11 15:58:19,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:58:19,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444796602] [2020-09-11 15:58:19,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:19,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:58:19,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245346130] [2020-09-11 15:58:19,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:58:19,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:19,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:58:19,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:58:19,073 INFO L87 Difference]: Start difference. First operand 7048 states and 32136 transitions. Second operand 5 states. [2020-09-11 15:58:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:19,211 INFO L93 Difference]: Finished difference Result 12234 states and 52488 transitions. [2020-09-11 15:58:19,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:58:19,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-11 15:58:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:19,242 INFO L225 Difference]: With dead ends: 12234 [2020-09-11 15:58:19,242 INFO L226 Difference]: Without dead ends: 12212 [2020-09-11 15:58:19,242 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:19,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12212 states. [2020-09-11 15:58:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12212 to 8342. [2020-09-11 15:58:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8342 states. [2020-09-11 15:58:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 38278 transitions. [2020-09-11 15:58:19,663 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 38278 transitions. Word has length 17 [2020-09-11 15:58:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:19,664 INFO L479 AbstractCegarLoop]: Abstraction has 8342 states and 38278 transitions. [2020-09-11 15:58:19,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:58:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 38278 transitions. [2020-09-11 15:58:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 15:58:19,665 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:19,665 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:19,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-09-11 15:58:19,665 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:19,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:19,665 INFO L82 PathProgramCache]: Analyzing trace with hash -74039136, now seen corresponding path program 1 times [2020-09-11 15:58:19,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:19,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479921486] [2020-09-11 15:58:19,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 15:58:19,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479921486] [2020-09-11 15:58:19,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489165772] [2020-09-11 15:58:19,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:19,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 15:58:19,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 15:58:19,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:19,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 15:58:19,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322803690] [2020-09-11 15:58:19,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:58:19,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:19,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:58:19,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:58:19,860 INFO L87 Difference]: Start difference. First operand 8342 states and 38278 transitions. Second operand 9 states. [2020-09-11 15:58:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:20,200 INFO L93 Difference]: Finished difference Result 19016 states and 76191 transitions. [2020-09-11 15:58:20,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:20,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-09-11 15:58:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:20,248 INFO L225 Difference]: With dead ends: 19016 [2020-09-11 15:58:20,248 INFO L226 Difference]: Without dead ends: 18998 [2020-09-11 15:58:20,248 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 15:58:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2020-09-11 15:58:20,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 8452. [2020-09-11 15:58:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8452 states. [2020-09-11 15:58:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8452 states to 8452 states and 38704 transitions. [2020-09-11 15:58:20,572 INFO L78 Accepts]: Start accepts. Automaton has 8452 states and 38704 transitions. Word has length 19 [2020-09-11 15:58:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:20,573 INFO L479 AbstractCegarLoop]: Abstraction has 8452 states and 38704 transitions. [2020-09-11 15:58:20,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:58:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 8452 states and 38704 transitions. [2020-09-11 15:58:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 15:58:20,574 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:20,574 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:20,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-09-11 15:58:20,775 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:20,776 INFO L82 PathProgramCache]: Analyzing trace with hash -274460668, now seen corresponding path program 1 times [2020-09-11 15:58:20,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:20,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626633747] [2020-09-11 15:58:20,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:20,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:58:20,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626633747] [2020-09-11 15:58:20,835 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977125918] [2020-09-11 15:58:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:20,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 15:58:20,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:58:20,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:20,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 15:58:20,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386659101] [2020-09-11 15:58:20,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:58:20,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:20,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:58:20,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:58:20,959 INFO L87 Difference]: Start difference. First operand 8452 states and 38704 transitions. Second operand 9 states. [2020-09-11 15:58:21,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:21,413 INFO L93 Difference]: Finished difference Result 19670 states and 79028 transitions. [2020-09-11 15:58:21,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:21,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-09-11 15:58:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:21,500 INFO L225 Difference]: With dead ends: 19670 [2020-09-11 15:58:21,501 INFO L226 Difference]: Without dead ends: 19645 [2020-09-11 15:58:21,501 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 15:58:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19645 states. [2020-09-11 15:58:22,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19645 to 8480. [2020-09-11 15:58:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8480 states. [2020-09-11 15:58:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8480 states to 8480 states and 38825 transitions. [2020-09-11 15:58:22,064 INFO L78 Accepts]: Start accepts. Automaton has 8480 states and 38825 transitions. Word has length 19 [2020-09-11 15:58:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:22,064 INFO L479 AbstractCegarLoop]: Abstraction has 8480 states and 38825 transitions. [2020-09-11 15:58:22,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:58:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 8480 states and 38825 transitions. [2020-09-11 15:58:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 15:58:22,065 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:22,066 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:22,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-09-11 15:58:22,267 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:22,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1149256224, now seen corresponding path program 2 times [2020-09-11 15:58:22,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:22,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720483373] [2020-09-11 15:58:22,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:58:22,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720483373] [2020-09-11 15:58:22,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:22,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:58:22,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743950988] [2020-09-11 15:58:22,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:58:22,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:22,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:58:22,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:22,331 INFO L87 Difference]: Start difference. First operand 8480 states and 38825 transitions. Second operand 7 states. [2020-09-11 15:58:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:22,636 INFO L93 Difference]: Finished difference Result 19852 states and 79846 transitions. [2020-09-11 15:58:22,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:22,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 15:58:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:22,685 INFO L225 Difference]: With dead ends: 19852 [2020-09-11 15:58:22,685 INFO L226 Difference]: Without dead ends: 19827 [2020-09-11 15:58:22,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:58:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19827 states. [2020-09-11 15:58:23,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19827 to 8379. [2020-09-11 15:58:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8379 states. [2020-09-11 15:58:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8379 states to 8379 states and 38406 transitions. [2020-09-11 15:58:23,034 INFO L78 Accepts]: Start accepts. Automaton has 8379 states and 38406 transitions. Word has length 19 [2020-09-11 15:58:23,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:23,034 INFO L479 AbstractCegarLoop]: Abstraction has 8379 states and 38406 transitions. [2020-09-11 15:58:23,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:58:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 8379 states and 38406 transitions. [2020-09-11 15:58:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 15:58:23,035 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:23,035 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:23,036 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-09-11 15:58:23,036 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:23,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:23,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1149271290, now seen corresponding path program 2 times [2020-09-11 15:58:23,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:23,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052301270] [2020-09-11 15:58:23,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:58:23,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052301270] [2020-09-11 15:58:23,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:23,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:58:23,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236055045] [2020-09-11 15:58:23,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:58:23,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:23,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:58:23,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:23,096 INFO L87 Difference]: Start difference. First operand 8379 states and 38406 transitions. Second operand 7 states. [2020-09-11 15:58:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:23,430 INFO L93 Difference]: Finished difference Result 19555 states and 78564 transitions. [2020-09-11 15:58:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:23,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 15:58:23,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:23,489 INFO L225 Difference]: With dead ends: 19555 [2020-09-11 15:58:23,490 INFO L226 Difference]: Without dead ends: 19530 [2020-09-11 15:58:23,490 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:58:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19530 states. [2020-09-11 15:58:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19530 to 8317. [2020-09-11 15:58:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8317 states. [2020-09-11 15:58:23,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 38184 transitions. [2020-09-11 15:58:23,984 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 38184 transitions. Word has length 19 [2020-09-11 15:58:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:23,984 INFO L479 AbstractCegarLoop]: Abstraction has 8317 states and 38184 transitions. [2020-09-11 15:58:23,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:58:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 38184 transitions. [2020-09-11 15:58:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:23,986 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:23,986 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:23,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-09-11 15:58:23,986 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:23,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:23,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1557322431, now seen corresponding path program 1 times [2020-09-11 15:58:23,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:23,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665406831] [2020-09-11 15:58:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:58:24,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665406831] [2020-09-11 15:58:24,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068666346] [2020-09-11 15:58:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:24,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:24,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:58:24,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:24,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:24,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304518572] [2020-09-11 15:58:24,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:24,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:24,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:24,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:24,187 INFO L87 Difference]: Start difference. First operand 8317 states and 38184 transitions. Second operand 11 states. [2020-09-11 15:58:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:25,035 INFO L93 Difference]: Finished difference Result 26969 states and 101544 transitions. [2020-09-11 15:58:25,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:25,037 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-09-11 15:58:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:25,106 INFO L225 Difference]: With dead ends: 26969 [2020-09-11 15:58:25,106 INFO L226 Difference]: Without dead ends: 26957 [2020-09-11 15:58:25,107 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2020-09-11 15:58:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 8204. [2020-09-11 15:58:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2020-09-11 15:58:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 37628 transitions. [2020-09-11 15:58:25,549 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 37628 transitions. Word has length 21 [2020-09-11 15:58:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:25,549 INFO L479 AbstractCegarLoop]: Abstraction has 8204 states and 37628 transitions. [2020-09-11 15:58:25,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 37628 transitions. [2020-09-11 15:58:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:25,550 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:25,550 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:25,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:25,751 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:25,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:25,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1862834243, now seen corresponding path program 2 times [2020-09-11 15:58:25,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:25,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612517159] [2020-09-11 15:58:25,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 15:58:25,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612517159] [2020-09-11 15:58:25,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57167422] [2020-09-11 15:58:25,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:25,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 15:58:25,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:58:25,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:25,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 15:58:25,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:25,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:25,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624552025] [2020-09-11 15:58:25,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:25,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:25,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:25,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:25,960 INFO L87 Difference]: Start difference. First operand 8204 states and 37628 transitions. Second operand 11 states. [2020-09-11 15:58:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:27,000 INFO L93 Difference]: Finished difference Result 26661 states and 100277 transitions. [2020-09-11 15:58:27,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:27,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-09-11 15:58:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:27,083 INFO L225 Difference]: With dead ends: 26661 [2020-09-11 15:58:27,084 INFO L226 Difference]: Without dead ends: 26645 [2020-09-11 15:58:27,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26645 states. [2020-09-11 15:58:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26645 to 8091. [2020-09-11 15:58:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2020-09-11 15:58:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 37076 transitions. [2020-09-11 15:58:27,476 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 37076 transitions. Word has length 21 [2020-09-11 15:58:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:27,476 INFO L479 AbstractCegarLoop]: Abstraction has 8091 states and 37076 transitions. [2020-09-11 15:58:27,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 37076 transitions. [2020-09-11 15:58:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:27,477 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:27,477 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:27,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2020-09-11 15:58:27,678 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:27,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:27,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1769991039, now seen corresponding path program 3 times [2020-09-11 15:58:27,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:27,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855019112] [2020-09-11 15:58:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:58:27,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855019112] [2020-09-11 15:58:27,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894863670] [2020-09-11 15:58:27,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:27,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-09-11 15:58:27,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:58:27,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:27,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:58:27,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:27,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:27,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348748551] [2020-09-11 15:58:27,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:27,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:27,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:27,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:27,893 INFO L87 Difference]: Start difference. First operand 8091 states and 37076 transitions. Second operand 11 states. [2020-09-11 15:58:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:28,670 INFO L93 Difference]: Finished difference Result 26686 states and 100402 transitions. [2020-09-11 15:58:28,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:28,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-09-11 15:58:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:28,745 INFO L225 Difference]: With dead ends: 26686 [2020-09-11 15:58:28,745 INFO L226 Difference]: Without dead ends: 26674 [2020-09-11 15:58:28,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:28,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26674 states. [2020-09-11 15:58:29,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26674 to 7861. [2020-09-11 15:58:29,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2020-09-11 15:58:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 36066 transitions. [2020-09-11 15:58:29,140 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 36066 transitions. Word has length 21 [2020-09-11 15:58:29,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:29,140 INFO L479 AbstractCegarLoop]: Abstraction has 7861 states and 36066 transitions. [2020-09-11 15:58:29,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:29,140 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 36066 transitions. [2020-09-11 15:58:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:29,141 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:29,141 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:29,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:29,349 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:29,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:29,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1763681919, now seen corresponding path program 4 times [2020-09-11 15:58:29,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:29,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243328655] [2020-09-11 15:58:29,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:58:29,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243328655] [2020-09-11 15:58:29,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104114164] [2020-09-11 15:58:29,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:29,664 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-11 15:58:29,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:58:29,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:29,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:58:29,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:29,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:29,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36099804] [2020-09-11 15:58:29,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:29,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:29,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:29,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:29,697 INFO L87 Difference]: Start difference. First operand 7861 states and 36066 transitions. Second operand 11 states. [2020-09-11 15:58:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:30,443 INFO L93 Difference]: Finished difference Result 26489 states and 99650 transitions. [2020-09-11 15:58:30,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:30,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-09-11 15:58:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:30,513 INFO L225 Difference]: With dead ends: 26489 [2020-09-11 15:58:30,514 INFO L226 Difference]: Without dead ends: 26473 [2020-09-11 15:58:30,514 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26473 states. [2020-09-11 15:58:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26473 to 7748. [2020-09-11 15:58:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7748 states. [2020-09-11 15:58:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7748 states to 7748 states and 35514 transitions. [2020-09-11 15:58:30,906 INFO L78 Accepts]: Start accepts. Automaton has 7748 states and 35514 transitions. Word has length 21 [2020-09-11 15:58:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:30,906 INFO L479 AbstractCegarLoop]: Abstraction has 7748 states and 35514 transitions. [2020-09-11 15:58:30,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 7748 states and 35514 transitions. [2020-09-11 15:58:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:30,907 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:30,907 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:31,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2020-09-11 15:58:31,121 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:31,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:31,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1774143127, now seen corresponding path program 1 times [2020-09-11 15:58:31,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:31,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680976071] [2020-09-11 15:58:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 15:58:31,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680976071] [2020-09-11 15:58:31,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:31,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:58:31,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462897161] [2020-09-11 15:58:31,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:58:31,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:31,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:58:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:58:31,173 INFO L87 Difference]: Start difference. First operand 7748 states and 35514 transitions. Second operand 5 states. [2020-09-11 15:58:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:31,332 INFO L93 Difference]: Finished difference Result 13251 states and 57501 transitions. [2020-09-11 15:58:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:58:31,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-09-11 15:58:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:31,380 INFO L225 Difference]: With dead ends: 13251 [2020-09-11 15:58:31,380 INFO L226 Difference]: Without dead ends: 13220 [2020-09-11 15:58:31,381 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:31,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13220 states. [2020-09-11 15:58:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13220 to 9255. [2020-09-11 15:58:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9255 states. [2020-09-11 15:58:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9255 states to 9255 states and 42368 transitions. [2020-09-11 15:58:31,693 INFO L78 Accepts]: Start accepts. Automaton has 9255 states and 42368 transitions. Word has length 21 [2020-09-11 15:58:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:31,694 INFO L479 AbstractCegarLoop]: Abstraction has 9255 states and 42368 transitions. [2020-09-11 15:58:31,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:58:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 9255 states and 42368 transitions. [2020-09-11 15:58:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:31,695 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:31,696 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:31,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-09-11 15:58:31,696 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:31,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:31,696 INFO L82 PathProgramCache]: Analyzing trace with hash -628636285, now seen corresponding path program 5 times [2020-09-11 15:58:31,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:31,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798377135] [2020-09-11 15:58:31,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:58:31,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798377135] [2020-09-11 15:58:31,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:31,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 15:58:31,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467906219] [2020-09-11 15:58:31,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:58:31,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:31,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:58:31,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:58:31,787 INFO L87 Difference]: Start difference. First operand 9255 states and 42368 transitions. Second operand 9 states. [2020-09-11 15:58:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:32,505 INFO L93 Difference]: Finished difference Result 29788 states and 113841 transitions. [2020-09-11 15:58:32,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:32,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 15:58:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:32,589 INFO L225 Difference]: With dead ends: 29788 [2020-09-11 15:58:32,589 INFO L226 Difference]: Without dead ends: 29770 [2020-09-11 15:58:32,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 15:58:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2020-09-11 15:58:33,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 8964. [2020-09-11 15:58:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2020-09-11 15:58:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 41031 transitions. [2020-09-11 15:58:33,191 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 41031 transitions. Word has length 21 [2020-09-11 15:58:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:33,191 INFO L479 AbstractCegarLoop]: Abstraction has 8964 states and 41031 transitions. [2020-09-11 15:58:33,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:58:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 41031 transitions. [2020-09-11 15:58:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:58:33,193 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:33,193 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:33,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-09-11 15:58:33,193 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:33,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:33,194 INFO L82 PathProgramCache]: Analyzing trace with hash -643099645, now seen corresponding path program 6 times [2020-09-11 15:58:33,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:33,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749849057] [2020-09-11 15:58:33,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:58:33,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749849057] [2020-09-11 15:58:33,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:33,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 15:58:33,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424598573] [2020-09-11 15:58:33,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:58:33,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:33,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:58:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:58:33,280 INFO L87 Difference]: Start difference. First operand 8964 states and 41031 transitions. Second operand 9 states. [2020-09-11 15:58:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:34,171 INFO L93 Difference]: Finished difference Result 29379 states and 112099 transitions. [2020-09-11 15:58:34,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:34,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 15:58:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:34,241 INFO L225 Difference]: With dead ends: 29379 [2020-09-11 15:58:34,242 INFO L226 Difference]: Without dead ends: 29356 [2020-09-11 15:58:34,242 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 15:58:34,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29356 states. [2020-09-11 15:58:34,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29356 to 8573. [2020-09-11 15:58:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8573 states. [2020-09-11 15:58:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8573 states to 8573 states and 39353 transitions. [2020-09-11 15:58:34,701 INFO L78 Accepts]: Start accepts. Automaton has 8573 states and 39353 transitions. Word has length 21 [2020-09-11 15:58:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:34,702 INFO L479 AbstractCegarLoop]: Abstraction has 8573 states and 39353 transitions. [2020-09-11 15:58:34,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:58:34,702 INFO L276 IsEmpty]: Start isEmpty. Operand 8573 states and 39353 transitions. [2020-09-11 15:58:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 15:58:34,704 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:34,704 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:34,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-09-11 15:58:34,704 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:34,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1599602836, now seen corresponding path program 1 times [2020-09-11 15:58:34,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:34,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911115405] [2020-09-11 15:58:34,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 15:58:34,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911115405] [2020-09-11 15:58:34,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476155023] [2020-09-11 15:58:34,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:34,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 15:58:34,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 15:58:34,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:34,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 15:58:34,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120833533] [2020-09-11 15:58:34,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:58:34,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:34,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:58:34,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:58:34,925 INFO L87 Difference]: Start difference. First operand 8573 states and 39353 transitions. Second operand 9 states. [2020-09-11 15:58:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:35,309 INFO L93 Difference]: Finished difference Result 19727 states and 80274 transitions. [2020-09-11 15:58:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:35,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-09-11 15:58:35,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:35,358 INFO L225 Difference]: With dead ends: 19727 [2020-09-11 15:58:35,358 INFO L226 Difference]: Without dead ends: 19703 [2020-09-11 15:58:35,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 15:58:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19703 states. [2020-09-11 15:58:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19703 to 8847. [2020-09-11 15:58:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2020-09-11 15:58:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40495 transitions. [2020-09-11 15:58:35,822 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40495 transitions. Word has length 23 [2020-09-11 15:58:35,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:35,822 INFO L479 AbstractCegarLoop]: Abstraction has 8847 states and 40495 transitions. [2020-09-11 15:58:35,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:58:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40495 transitions. [2020-09-11 15:58:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 15:58:35,824 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:35,825 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:36,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2020-09-11 15:58:36,026 INFO L427 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:36,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:36,026 INFO L82 PathProgramCache]: Analyzing trace with hash 72758744, now seen corresponding path program 1 times [2020-09-11 15:58:36,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:36,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512058886] [2020-09-11 15:58:36,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 15:58:36,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512058886] [2020-09-11 15:58:36,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193014271] [2020-09-11 15:58:36,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:36,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 15:58:36,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 15:58:36,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:36,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 15:58:36,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518622460] [2020-09-11 15:58:36,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:58:36,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:36,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:58:36,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:58:36,230 INFO L87 Difference]: Start difference. First operand 8847 states and 40495 transitions. Second operand 9 states. [2020-09-11 15:58:36,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:36,576 INFO L93 Difference]: Finished difference Result 20694 states and 84261 transitions. [2020-09-11 15:58:36,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:36,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-09-11 15:58:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:36,627 INFO L225 Difference]: With dead ends: 20694 [2020-09-11 15:58:36,628 INFO L226 Difference]: Without dead ends: 20666 [2020-09-11 15:58:36,628 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 15:58:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20666 states. [2020-09-11 15:58:36,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20666 to 9115. [2020-09-11 15:58:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2020-09-11 15:58:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 41679 transitions. [2020-09-11 15:58:36,982 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 41679 transitions. Word has length 23 [2020-09-11 15:58:36,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:36,982 INFO L479 AbstractCegarLoop]: Abstraction has 9115 states and 41679 transitions. [2020-09-11 15:58:36,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:58:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 41679 transitions. [2020-09-11 15:58:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 15:58:36,984 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:36,985 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:37,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:37,185 INFO L427 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:37,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:37,186 INFO L82 PathProgramCache]: Analyzing trace with hash -328675496, now seen corresponding path program 1 times [2020-09-11 15:58:37,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:37,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888985478] [2020-09-11 15:58:37,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 15:58:37,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888985478] [2020-09-11 15:58:37,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662244745] [2020-09-11 15:58:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:37,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 15:58:37,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 15:58:37,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:37,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 15:58:37,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706829178] [2020-09-11 15:58:37,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:58:37,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:37,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:58:37,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:58:37,357 INFO L87 Difference]: Start difference. First operand 9115 states and 41679 transitions. Second operand 9 states. [2020-09-11 15:58:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:37,725 INFO L93 Difference]: Finished difference Result 21396 states and 87360 transitions. [2020-09-11 15:58:37,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:37,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-09-11 15:58:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:37,776 INFO L225 Difference]: With dead ends: 21396 [2020-09-11 15:58:37,776 INFO L226 Difference]: Without dead ends: 21359 [2020-09-11 15:58:37,777 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 15:58:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21359 states. [2020-09-11 15:58:38,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21359 to 9320. [2020-09-11 15:58:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9320 states. [2020-09-11 15:58:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9320 states to 9320 states and 42648 transitions. [2020-09-11 15:58:38,130 INFO L78 Accepts]: Start accepts. Automaton has 9320 states and 42648 transitions. Word has length 23 [2020-09-11 15:58:38,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:38,130 INFO L479 AbstractCegarLoop]: Abstraction has 9320 states and 42648 transitions. [2020-09-11 15:58:38,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:58:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9320 states and 42648 transitions. [2020-09-11 15:58:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 15:58:38,132 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:38,132 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:38,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2020-09-11 15:58:38,333 INFO L427 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:38,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:38,334 INFO L82 PathProgramCache]: Analyzing trace with hash -150456492, now seen corresponding path program 2 times [2020-09-11 15:58:38,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:38,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501381575] [2020-09-11 15:58:38,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 15:58:38,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501381575] [2020-09-11 15:58:38,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:38,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:58:38,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396672382] [2020-09-11 15:58:38,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:58:38,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:38,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:58:38,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:38,405 INFO L87 Difference]: Start difference. First operand 9320 states and 42648 transitions. Second operand 7 states. [2020-09-11 15:58:38,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:38,728 INFO L93 Difference]: Finished difference Result 21489 states and 87752 transitions. [2020-09-11 15:58:38,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:38,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-11 15:58:38,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:38,786 INFO L225 Difference]: With dead ends: 21489 [2020-09-11 15:58:38,786 INFO L226 Difference]: Without dead ends: 21452 [2020-09-11 15:58:38,786 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:58:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2020-09-11 15:58:39,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 9401. [2020-09-11 15:58:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9401 states. [2020-09-11 15:58:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9401 states to 9401 states and 43010 transitions. [2020-09-11 15:58:39,335 INFO L78 Accepts]: Start accepts. Automaton has 9401 states and 43010 transitions. Word has length 23 [2020-09-11 15:58:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:39,337 INFO L479 AbstractCegarLoop]: Abstraction has 9401 states and 43010 transitions. [2020-09-11 15:58:39,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:58:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 9401 states and 43010 transitions. [2020-09-11 15:58:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 15:58:39,339 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:39,339 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:39,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-09-11 15:58:39,339 INFO L427 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:39,340 INFO L82 PathProgramCache]: Analyzing trace with hash -150471558, now seen corresponding path program 2 times [2020-09-11 15:58:39,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:39,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236782012] [2020-09-11 15:58:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 15:58:39,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236782012] [2020-09-11 15:58:39,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:39,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:58:39,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967203719] [2020-09-11 15:58:39,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:58:39,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:39,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:58:39,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:39,406 INFO L87 Difference]: Start difference. First operand 9401 states and 43010 transitions. Second operand 7 states. [2020-09-11 15:58:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:39,759 INFO L93 Difference]: Finished difference Result 21218 states and 86469 transitions. [2020-09-11 15:58:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:39,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-11 15:58:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:39,810 INFO L225 Difference]: With dead ends: 21218 [2020-09-11 15:58:39,811 INFO L226 Difference]: Without dead ends: 21181 [2020-09-11 15:58:39,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:58:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21181 states. [2020-09-11 15:58:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21181 to 9396. [2020-09-11 15:58:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9396 states. [2020-09-11 15:58:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9396 states to 9396 states and 42985 transitions. [2020-09-11 15:58:40,187 INFO L78 Accepts]: Start accepts. Automaton has 9396 states and 42985 transitions. Word has length 23 [2020-09-11 15:58:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:40,187 INFO L479 AbstractCegarLoop]: Abstraction has 9396 states and 42985 transitions. [2020-09-11 15:58:40,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:58:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 9396 states and 42985 transitions. [2020-09-11 15:58:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 15:58:40,190 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:40,190 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:40,190 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-09-11 15:58:40,190 INFO L427 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:40,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:40,190 INFO L82 PathProgramCache]: Analyzing trace with hash -150449920, now seen corresponding path program 2 times [2020-09-11 15:58:40,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:40,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881433108] [2020-09-11 15:58:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 15:58:40,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881433108] [2020-09-11 15:58:40,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:58:40,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:58:40,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735497971] [2020-09-11 15:58:40,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:58:40,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:40,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:58:40,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:58:40,251 INFO L87 Difference]: Start difference. First operand 9396 states and 42985 transitions. Second operand 7 states. [2020-09-11 15:58:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:40,601 INFO L93 Difference]: Finished difference Result 21047 states and 85702 transitions. [2020-09-11 15:58:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:58:40,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-11 15:58:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:40,656 INFO L225 Difference]: With dead ends: 21047 [2020-09-11 15:58:40,656 INFO L226 Difference]: Without dead ends: 21010 [2020-09-11 15:58:40,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:58:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21010 states. [2020-09-11 15:58:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21010 to 9426. [2020-09-11 15:58:40,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9426 states. [2020-09-11 15:58:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 43057 transitions. [2020-09-11 15:58:41,020 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 43057 transitions. Word has length 23 [2020-09-11 15:58:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:41,020 INFO L479 AbstractCegarLoop]: Abstraction has 9426 states and 43057 transitions. [2020-09-11 15:58:41,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:58:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 43057 transitions. [2020-09-11 15:58:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:58:41,023 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:41,023 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:41,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-09-11 15:58:41,023 INFO L427 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:41,024 INFO L82 PathProgramCache]: Analyzing trace with hash -156736363, now seen corresponding path program 1 times [2020-09-11 15:58:41,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:41,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546571751] [2020-09-11 15:58:41,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 15:58:41,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546571751] [2020-09-11 15:58:41,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391204188] [2020-09-11 15:58:41,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:41,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:41,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 15:58:41,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:41,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:41,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171608827] [2020-09-11 15:58:41,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:41,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:41,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:41,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:41,254 INFO L87 Difference]: Start difference. First operand 9426 states and 43057 transitions. Second operand 11 states. [2020-09-11 15:58:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:42,182 INFO L93 Difference]: Finished difference Result 30145 states and 115754 transitions. [2020-09-11 15:58:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:42,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 15:58:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:42,259 INFO L225 Difference]: With dead ends: 30145 [2020-09-11 15:58:42,259 INFO L226 Difference]: Without dead ends: 30125 [2020-09-11 15:58:42,260 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30125 states. [2020-09-11 15:58:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30125 to 9338. [2020-09-11 15:58:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9338 states. [2020-09-11 15:58:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9338 states to 9338 states and 42582 transitions. [2020-09-11 15:58:42,871 INFO L78 Accepts]: Start accepts. Automaton has 9338 states and 42582 transitions. Word has length 25 [2020-09-11 15:58:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:42,872 INFO L479 AbstractCegarLoop]: Abstraction has 9338 states and 42582 transitions. [2020-09-11 15:58:42,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 9338 states and 42582 transitions. [2020-09-11 15:58:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:58:42,875 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:42,875 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:43,076 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2020-09-11 15:58:43,076 INFO L427 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:43,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:43,077 INFO L82 PathProgramCache]: Analyzing trace with hash -558170603, now seen corresponding path program 1 times [2020-09-11 15:58:43,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:43,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334731972] [2020-09-11 15:58:43,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 15:58:43,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334731972] [2020-09-11 15:58:43,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918406021] [2020-09-11 15:58:43,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:43,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:43,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 15:58:43,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:43,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:43,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493124795] [2020-09-11 15:58:43,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:43,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:43,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:43,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:43,305 INFO L87 Difference]: Start difference. First operand 9338 states and 42582 transitions. Second operand 11 states. [2020-09-11 15:58:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:44,182 INFO L93 Difference]: Finished difference Result 29696 states and 113916 transitions. [2020-09-11 15:58:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:44,183 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 15:58:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:44,258 INFO L225 Difference]: With dead ends: 29696 [2020-09-11 15:58:44,258 INFO L226 Difference]: Without dead ends: 29676 [2020-09-11 15:58:44,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:44,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29676 states. [2020-09-11 15:58:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29676 to 9291. [2020-09-11 15:58:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9291 states. [2020-09-11 15:58:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9291 states to 9291 states and 42295 transitions. [2020-09-11 15:58:44,722 INFO L78 Accepts]: Start accepts. Automaton has 9291 states and 42295 transitions. Word has length 25 [2020-09-11 15:58:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:44,722 INFO L479 AbstractCegarLoop]: Abstraction has 9291 states and 42295 transitions. [2020-09-11 15:58:44,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:44,722 INFO L276 IsEmpty]: Start isEmpty. Operand 9291 states and 42295 transitions. [2020-09-11 15:58:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:58:44,725 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:44,725 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:44,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2020-09-11 15:58:44,926 INFO L427 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:44,927 INFO L82 PathProgramCache]: Analyzing trace with hash -379966665, now seen corresponding path program 2 times [2020-09-11 15:58:44,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:44,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949686727] [2020-09-11 15:58:44,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 15:58:45,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949686727] [2020-09-11 15:58:45,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154657027] [2020-09-11 15:58:45,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:45,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 15:58:45,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:58:45,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:45,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 15:58:45,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:45,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:45,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466236779] [2020-09-11 15:58:45,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:45,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:45,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:45,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:45,135 INFO L87 Difference]: Start difference. First operand 9291 states and 42295 transitions. Second operand 11 states. [2020-09-11 15:58:45,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:45,950 INFO L93 Difference]: Finished difference Result 29267 states and 112142 transitions. [2020-09-11 15:58:45,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:45,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 15:58:45,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:46,019 INFO L225 Difference]: With dead ends: 29267 [2020-09-11 15:58:46,019 INFO L226 Difference]: Without dead ends: 29245 [2020-09-11 15:58:46,020 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:46,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2020-09-11 15:58:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 9288. [2020-09-11 15:58:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9288 states. [2020-09-11 15:58:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 42242 transitions. [2020-09-11 15:58:46,487 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 42242 transitions. Word has length 25 [2020-09-11 15:58:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:46,488 INFO L479 AbstractCegarLoop]: Abstraction has 9288 states and 42242 transitions. [2020-09-11 15:58:46,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 42242 transitions. [2020-09-11 15:58:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:58:46,491 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:46,491 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:46,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2020-09-11 15:58:46,692 INFO L427 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:46,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:46,693 INFO L82 PathProgramCache]: Analyzing trace with hash -379945027, now seen corresponding path program 2 times [2020-09-11 15:58:46,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:46,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063150190] [2020-09-11 15:58:46,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 15:58:46,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063150190] [2020-09-11 15:58:46,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121832624] [2020-09-11 15:58:46,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:47,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 15:58:47,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:58:47,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:47,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 15:58:47,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:47,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:47,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460939995] [2020-09-11 15:58:47,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:47,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:47,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:47,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:47,058 INFO L87 Difference]: Start difference. First operand 9288 states and 42242 transitions. Second operand 11 states. [2020-09-11 15:58:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:47,944 INFO L93 Difference]: Finished difference Result 28920 states and 110796 transitions. [2020-09-11 15:58:47,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:47,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 15:58:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:48,012 INFO L225 Difference]: With dead ends: 28920 [2020-09-11 15:58:48,012 INFO L226 Difference]: Without dead ends: 28898 [2020-09-11 15:58:48,012 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28898 states. [2020-09-11 15:58:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28898 to 9176. [2020-09-11 15:58:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2020-09-11 15:58:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 41695 transitions. [2020-09-11 15:58:48,459 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 41695 transitions. Word has length 25 [2020-09-11 15:58:48,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:48,460 INFO L479 AbstractCegarLoop]: Abstraction has 9176 states and 41695 transitions. [2020-09-11 15:58:48,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 41695 transitions. [2020-09-11 15:58:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:58:48,463 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:48,464 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:48,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:48,664 INFO L427 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:48,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:48,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1211690581, now seen corresponding path program 3 times [2020-09-11 15:58:48,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:48,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275691101] [2020-09-11 15:58:48,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 15:58:48,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275691101] [2020-09-11 15:58:48,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813859296] [2020-09-11 15:58:48,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:48,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-09-11 15:58:48,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:58:48,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:48,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 15:58:48,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:48,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:48,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227429861] [2020-09-11 15:58:48,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:48,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:48,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:48,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:48,893 INFO L87 Difference]: Start difference. First operand 9176 states and 41695 transitions. Second operand 11 states. [2020-09-11 15:58:49,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:49,737 INFO L93 Difference]: Finished difference Result 29038 states and 111216 transitions. [2020-09-11 15:58:49,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:49,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 15:58:49,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:49,811 INFO L225 Difference]: With dead ends: 29038 [2020-09-11 15:58:49,811 INFO L226 Difference]: Without dead ends: 29018 [2020-09-11 15:58:49,812 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29018 states. [2020-09-11 15:58:50,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29018 to 9000. [2020-09-11 15:58:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9000 states. [2020-09-11 15:58:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9000 states to 9000 states and 40897 transitions. [2020-09-11 15:58:50,254 INFO L78 Accepts]: Start accepts. Automaton has 9000 states and 40897 transitions. Word has length 25 [2020-09-11 15:58:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:50,254 INFO L479 AbstractCegarLoop]: Abstraction has 9000 states and 40897 transitions. [2020-09-11 15:58:50,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:50,254 INFO L276 IsEmpty]: Start isEmpty. Operand 9000 states and 40897 transitions. [2020-09-11 15:58:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:58:50,257 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:50,257 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:50,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2020-09-11 15:58:50,458 INFO L427 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:50,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:50,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1201691221, now seen corresponding path program 4 times [2020-09-11 15:58:50,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:50,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500925233] [2020-09-11 15:58:50,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 15:58:50,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500925233] [2020-09-11 15:58:50,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934079367] [2020-09-11 15:58:50,536 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:50,617 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-11 15:58:50,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:58:50,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:50,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:50,646 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 15:58:50,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:50,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:50,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901278943] [2020-09-11 15:58:50,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:50,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:50,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:50,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:50,648 INFO L87 Difference]: Start difference. First operand 9000 states and 40897 transitions. Second operand 11 states. [2020-09-11 15:58:51,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:51,575 INFO L93 Difference]: Finished difference Result 29283 states and 112236 transitions. [2020-09-11 15:58:51,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:51,575 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 15:58:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:51,645 INFO L225 Difference]: With dead ends: 29283 [2020-09-11 15:58:51,645 INFO L226 Difference]: Without dead ends: 29261 [2020-09-11 15:58:51,645 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29261 states. [2020-09-11 15:58:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29261 to 8997. [2020-09-11 15:58:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8997 states. [2020-09-11 15:58:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8997 states to 8997 states and 40842 transitions. [2020-09-11 15:58:52,252 INFO L78 Accepts]: Start accepts. Automaton has 8997 states and 40842 transitions. Word has length 25 [2020-09-11 15:58:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:52,252 INFO L479 AbstractCegarLoop]: Abstraction has 8997 states and 40842 transitions. [2020-09-11 15:58:52,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 8997 states and 40842 transitions. [2020-09-11 15:58:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:58:52,256 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:52,256 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:52,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:52,457 INFO L427 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:52,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:52,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1201697793, now seen corresponding path program 1 times [2020-09-11 15:58:52,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:52,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631656502] [2020-09-11 15:58:52,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 15:58:52,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631656502] [2020-09-11 15:58:52,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049586708] [2020-09-11 15:58:52,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:52,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:52,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 15:58:52,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:52,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:52,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741963718] [2020-09-11 15:58:52,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:52,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:52,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:52,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:52,668 INFO L87 Difference]: Start difference. First operand 8997 states and 40842 transitions. Second operand 11 states. [2020-09-11 15:58:53,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:53,636 INFO L93 Difference]: Finished difference Result 29105 states and 111801 transitions. [2020-09-11 15:58:53,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:53,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 15:58:53,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:53,717 INFO L225 Difference]: With dead ends: 29105 [2020-09-11 15:58:53,717 INFO L226 Difference]: Without dead ends: 29085 [2020-09-11 15:58:53,717 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:53,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29085 states. [2020-09-11 15:58:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29085 to 8955. [2020-09-11 15:58:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8955 states. [2020-09-11 15:58:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8955 states to 8955 states and 40593 transitions. [2020-09-11 15:58:54,177 INFO L78 Accepts]: Start accepts. Automaton has 8955 states and 40593 transitions. Word has length 25 [2020-09-11 15:58:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:54,178 INFO L479 AbstractCegarLoop]: Abstraction has 8955 states and 40593 transitions. [2020-09-11 15:58:54,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 8955 states and 40593 transitions. [2020-09-11 15:58:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:58:54,182 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:54,182 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:54,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2020-09-11 15:58:54,383 INFO L427 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:54,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1218006273, now seen corresponding path program 2 times [2020-09-11 15:58:54,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:54,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088048052] [2020-09-11 15:58:54,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 15:58:54,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088048052] [2020-09-11 15:58:54,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749281177] [2020-09-11 15:58:54,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:54,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 15:58:54,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:58:54,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:54,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-11 15:58:54,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:54,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:54,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609846462] [2020-09-11 15:58:54,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:54,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:54,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:54,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:54,583 INFO L87 Difference]: Start difference. First operand 8955 states and 40593 transitions. Second operand 11 states. [2020-09-11 15:58:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:55,595 INFO L93 Difference]: Finished difference Result 28806 states and 110558 transitions. [2020-09-11 15:58:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:55,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 15:58:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:55,706 INFO L225 Difference]: With dead ends: 28806 [2020-09-11 15:58:55,706 INFO L226 Difference]: Without dead ends: 28779 [2020-09-11 15:58:55,706 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28779 states. [2020-09-11 15:58:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28779 to 8841. [2020-09-11 15:58:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2020-09-11 15:58:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 40062 transitions. [2020-09-11 15:58:56,126 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 40062 transitions. Word has length 25 [2020-09-11 15:58:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:56,126 INFO L479 AbstractCegarLoop]: Abstraction has 8841 states and 40062 transitions. [2020-09-11 15:58:56,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 40062 transitions. [2020-09-11 15:58:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:58:56,130 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:56,130 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:56,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:56,331 INFO L427 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:56,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1980442581, now seen corresponding path program 3 times [2020-09-11 15:58:56,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:56,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819803247] [2020-09-11 15:58:56,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 15:58:56,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819803247] [2020-09-11 15:58:56,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515407048] [2020-09-11 15:58:56,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:56,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-09-11 15:58:56,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:58:56,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:56,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 15:58:56,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:56,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:56,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389693955] [2020-09-11 15:58:56,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:56,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:56,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:56,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:56,560 INFO L87 Difference]: Start difference. First operand 8841 states and 40062 transitions. Second operand 11 states. [2020-09-11 15:58:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:57,454 INFO L93 Difference]: Finished difference Result 28636 states and 109852 transitions. [2020-09-11 15:58:57,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:57,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 15:58:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:57,527 INFO L225 Difference]: With dead ends: 28636 [2020-09-11 15:58:57,527 INFO L226 Difference]: Without dead ends: 28616 [2020-09-11 15:58:57,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28616 states. [2020-09-11 15:58:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28616 to 8702. [2020-09-11 15:58:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8702 states. [2020-09-11 15:58:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8702 states to 8702 states and 39438 transitions. [2020-09-11 15:58:58,085 INFO L78 Accepts]: Start accepts. Automaton has 8702 states and 39438 transitions. Word has length 25 [2020-09-11 15:58:58,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:58:58,085 INFO L479 AbstractCegarLoop]: Abstraction has 8702 states and 39438 transitions. [2020-09-11 15:58:58,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:58:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 8702 states and 39438 transitions. [2020-09-11 15:58:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:58:58,088 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:58:58,088 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:58:58,289 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2020-09-11 15:58:58,289 INFO L427 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:58:58,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:58:58,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1965964155, now seen corresponding path program 3 times [2020-09-11 15:58:58,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:58:58,290 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20814157] [2020-09-11 15:58:58,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:58:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:58:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 15:58:58,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20814157] [2020-09-11 15:58:58,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251167321] [2020-09-11 15:58:58,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:58:58,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-09-11 15:58:58,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:58:58,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:58:58,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:58:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 15:58:58,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:58:58,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:58:58,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36151334] [2020-09-11 15:58:58,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:58:58,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:58:58,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:58:58,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:58:58,511 INFO L87 Difference]: Start difference. First operand 8702 states and 39438 transitions. Second operand 11 states. [2020-09-11 15:58:59,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:58:59,539 INFO L93 Difference]: Finished difference Result 28297 states and 108461 transitions. [2020-09-11 15:58:59,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:58:59,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 15:58:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:58:59,641 INFO L225 Difference]: With dead ends: 28297 [2020-09-11 15:58:59,642 INFO L226 Difference]: Without dead ends: 28277 [2020-09-11 15:58:59,647 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:58:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28277 states. [2020-09-11 15:59:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28277 to 8596. [2020-09-11 15:59:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8596 states. [2020-09-11 15:59:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8596 states to 8596 states and 38978 transitions. [2020-09-11 15:59:00,209 INFO L78 Accepts]: Start accepts. Automaton has 8596 states and 38978 transitions. Word has length 25 [2020-09-11 15:59:00,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:00,209 INFO L479 AbstractCegarLoop]: Abstraction has 8596 states and 38978 transitions. [2020-09-11 15:59:00,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:59:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 8596 states and 38978 transitions. [2020-09-11 15:59:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:59:00,212 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:00,212 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:00,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:59:00,413 INFO L427 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:00,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:00,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1970443221, now seen corresponding path program 4 times [2020-09-11 15:59:00,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:00,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408086540] [2020-09-11 15:59:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 15:59:00,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408086540] [2020-09-11 15:59:00,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580807409] [2020-09-11 15:59:00,503 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:59:00,609 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-11 15:59:00,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:59:00,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:59:00,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:59:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 15:59:00,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:59:00,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:59:00,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709866806] [2020-09-11 15:59:00,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:59:00,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:00,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:59:00,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:59:00,638 INFO L87 Difference]: Start difference. First operand 8596 states and 38978 transitions. Second operand 11 states. [2020-09-11 15:59:01,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:01,495 INFO L93 Difference]: Finished difference Result 28565 states and 109596 transitions. [2020-09-11 15:59:01,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:59:01,496 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 15:59:01,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:01,576 INFO L225 Difference]: With dead ends: 28565 [2020-09-11 15:59:01,576 INFO L226 Difference]: Without dead ends: 28538 [2020-09-11 15:59:01,576 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:59:01,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2020-09-11 15:59:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8563. [2020-09-11 15:59:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8563 states. [2020-09-11 15:59:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8563 states to 8563 states and 38809 transitions. [2020-09-11 15:59:02,035 INFO L78 Accepts]: Start accepts. Automaton has 8563 states and 38809 transitions. Word has length 25 [2020-09-11 15:59:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:02,035 INFO L479 AbstractCegarLoop]: Abstraction has 8563 states and 38809 transitions. [2020-09-11 15:59:02,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:59:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 8563 states and 38809 transitions. [2020-09-11 15:59:02,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:59:02,038 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:02,039 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:02,239 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2020-09-11 15:59:02,240 INFO L427 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1970428155, now seen corresponding path program 4 times [2020-09-11 15:59:02,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:02,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195386689] [2020-09-11 15:59:02,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:02,330 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 15:59:02,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195386689] [2020-09-11 15:59:02,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980612526] [2020-09-11 15:59:02,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:59:02,435 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-11 15:59:02,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:59:02,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:59:02,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:59:02,467 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-11 15:59:02,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:59:02,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:59:02,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837774858] [2020-09-11 15:59:02,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:59:02,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:02,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:59:02,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:59:02,469 INFO L87 Difference]: Start difference. First operand 8563 states and 38809 transitions. Second operand 11 states. [2020-09-11 15:59:03,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:03,352 INFO L93 Difference]: Finished difference Result 28213 states and 108237 transitions. [2020-09-11 15:59:03,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:59:03,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 15:59:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:03,417 INFO L225 Difference]: With dead ends: 28213 [2020-09-11 15:59:03,417 INFO L226 Difference]: Without dead ends: 28186 [2020-09-11 15:59:03,417 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:59:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28186 states. [2020-09-11 15:59:03,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28186 to 8421. [2020-09-11 15:59:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8421 states. [2020-09-11 15:59:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8421 states to 8421 states and 38146 transitions. [2020-09-11 15:59:03,998 INFO L78 Accepts]: Start accepts. Automaton has 8421 states and 38146 transitions. Word has length 25 [2020-09-11 15:59:03,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:03,998 INFO L479 AbstractCegarLoop]: Abstraction has 8421 states and 38146 transitions. [2020-09-11 15:59:03,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:59:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 8421 states and 38146 transitions. [2020-09-11 15:59:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:59:04,001 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:04,001 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:04,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:59:04,202 INFO L427 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:04,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:04,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1943046054, now seen corresponding path program 1 times [2020-09-11 15:59:04,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:04,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748689051] [2020-09-11 15:59:04,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-09-11 15:59:04,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748689051] [2020-09-11 15:59:04,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:04,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:59:04,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735665617] [2020-09-11 15:59:04,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:59:04,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:04,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:59:04,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:59:04,257 INFO L87 Difference]: Start difference. First operand 8421 states and 38146 transitions. Second operand 5 states. [2020-09-11 15:59:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:04,475 INFO L93 Difference]: Finished difference Result 13647 states and 59401 transitions. [2020-09-11 15:59:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:59:04,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-09-11 15:59:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:04,542 INFO L225 Difference]: With dead ends: 13647 [2020-09-11 15:59:04,543 INFO L226 Difference]: Without dead ends: 13615 [2020-09-11 15:59:04,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:59:04,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13615 states. [2020-09-11 15:59:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13615 to 9928. [2020-09-11 15:59:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9928 states. [2020-09-11 15:59:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9928 states to 9928 states and 44651 transitions. [2020-09-11 15:59:05,027 INFO L78 Accepts]: Start accepts. Automaton has 9928 states and 44651 transitions. Word has length 25 [2020-09-11 15:59:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:05,028 INFO L479 AbstractCegarLoop]: Abstraction has 9928 states and 44651 transitions. [2020-09-11 15:59:05,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:59:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 9928 states and 44651 transitions. [2020-09-11 15:59:05,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:59:05,033 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:05,033 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:05,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-09-11 15:59:05,034 INFO L427 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:05,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:05,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1440199159, now seen corresponding path program 5 times [2020-09-11 15:59:05,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:05,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363475742] [2020-09-11 15:59:05,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 15:59:05,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363475742] [2020-09-11 15:59:05,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:05,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 15:59:05,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786572691] [2020-09-11 15:59:05,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:59:05,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:05,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:59:05,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:59:05,130 INFO L87 Difference]: Start difference. First operand 9928 states and 44651 transitions. Second operand 9 states. [2020-09-11 15:59:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:05,933 INFO L93 Difference]: Finished difference Result 31816 states and 123346 transitions. [2020-09-11 15:59:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:59:05,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-09-11 15:59:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:06,018 INFO L225 Difference]: With dead ends: 31816 [2020-09-11 15:59:06,018 INFO L226 Difference]: Without dead ends: 31790 [2020-09-11 15:59:06,018 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 15:59:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31790 states. [2020-09-11 15:59:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31790 to 9766. [2020-09-11 15:59:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9766 states. [2020-09-11 15:59:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 43873 transitions. [2020-09-11 15:59:06,522 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 43873 transitions. Word has length 25 [2020-09-11 15:59:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:06,522 INFO L479 AbstractCegarLoop]: Abstraction has 9766 states and 43873 transitions. [2020-09-11 15:59:06,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:59:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 43873 transitions. [2020-09-11 15:59:06,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:59:06,525 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:06,525 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:06,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-09-11 15:59:06,526 INFO L427 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:06,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:06,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1440220797, now seen corresponding path program 5 times [2020-09-11 15:59:06,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:06,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002832440] [2020-09-11 15:59:06,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 15:59:06,613 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002832440] [2020-09-11 15:59:06,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:06,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 15:59:06,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376095643] [2020-09-11 15:59:06,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:59:06,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:06,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:59:06,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:59:06,614 INFO L87 Difference]: Start difference. First operand 9766 states and 43873 transitions. Second operand 9 states. [2020-09-11 15:59:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:07,437 INFO L93 Difference]: Finished difference Result 31277 states and 121098 transitions. [2020-09-11 15:59:07,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:59:07,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-09-11 15:59:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:07,528 INFO L225 Difference]: With dead ends: 31277 [2020-09-11 15:59:07,529 INFO L226 Difference]: Without dead ends: 31251 [2020-09-11 15:59:07,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 15:59:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31251 states. [2020-09-11 15:59:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31251 to 9592. [2020-09-11 15:59:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9592 states. [2020-09-11 15:59:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9592 states to 9592 states and 43051 transitions. [2020-09-11 15:59:08,060 INFO L78 Accepts]: Start accepts. Automaton has 9592 states and 43051 transitions. Word has length 25 [2020-09-11 15:59:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:08,060 INFO L479 AbstractCegarLoop]: Abstraction has 9592 states and 43051 transitions. [2020-09-11 15:59:08,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:59:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 9592 states and 43051 transitions. [2020-09-11 15:59:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:59:08,064 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:08,064 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:08,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-09-11 15:59:08,064 INFO L427 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:08,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:08,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1425735799, now seen corresponding path program 6 times [2020-09-11 15:59:08,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:08,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638541228] [2020-09-11 15:59:08,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 15:59:08,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638541228] [2020-09-11 15:59:08,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:08,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 15:59:08,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246146910] [2020-09-11 15:59:08,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:59:08,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:08,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:59:08,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:59:08,153 INFO L87 Difference]: Start difference. First operand 9592 states and 43051 transitions. Second operand 9 states. [2020-09-11 15:59:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:08,920 INFO L93 Difference]: Finished difference Result 30952 states and 119650 transitions. [2020-09-11 15:59:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:59:08,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-09-11 15:59:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:08,992 INFO L225 Difference]: With dead ends: 30952 [2020-09-11 15:59:08,992 INFO L226 Difference]: Without dead ends: 30919 [2020-09-11 15:59:08,992 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 15:59:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30919 states. [2020-09-11 15:59:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30919 to 9246. [2020-09-11 15:59:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9246 states. [2020-09-11 15:59:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9246 states to 9246 states and 41509 transitions. [2020-09-11 15:59:09,675 INFO L78 Accepts]: Start accepts. Automaton has 9246 states and 41509 transitions. Word has length 25 [2020-09-11 15:59:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:09,675 INFO L479 AbstractCegarLoop]: Abstraction has 9246 states and 41509 transitions. [2020-09-11 15:59:09,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:59:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 9246 states and 41509 transitions. [2020-09-11 15:59:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:59:09,678 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:09,678 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:09,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-09-11 15:59:09,679 INFO L427 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:09,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:09,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1425742371, now seen corresponding path program 5 times [2020-09-11 15:59:09,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:09,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733229003] [2020-09-11 15:59:09,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 15:59:09,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733229003] [2020-09-11 15:59:09,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:09,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 15:59:09,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53911900] [2020-09-11 15:59:09,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:59:09,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:09,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:59:09,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:59:09,766 INFO L87 Difference]: Start difference. First operand 9246 states and 41509 transitions. Second operand 9 states. [2020-09-11 15:59:10,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:10,635 INFO L93 Difference]: Finished difference Result 30541 states and 117947 transitions. [2020-09-11 15:59:10,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:59:10,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-09-11 15:59:10,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:10,713 INFO L225 Difference]: With dead ends: 30541 [2020-09-11 15:59:10,714 INFO L226 Difference]: Without dead ends: 30515 [2020-09-11 15:59:10,714 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 15:59:10,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30515 states. [2020-09-11 15:59:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30515 to 9136. [2020-09-11 15:59:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9136 states. [2020-09-11 15:59:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9136 states to 9136 states and 40999 transitions. [2020-09-11 15:59:11,187 INFO L78 Accepts]: Start accepts. Automaton has 9136 states and 40999 transitions. Word has length 25 [2020-09-11 15:59:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:11,187 INFO L479 AbstractCegarLoop]: Abstraction has 9136 states and 40999 transitions. [2020-09-11 15:59:11,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:59:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 9136 states and 40999 transitions. [2020-09-11 15:59:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:59:11,190 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:11,190 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:11,190 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-09-11 15:59:11,190 INFO L427 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1446529917, now seen corresponding path program 6 times [2020-09-11 15:59:11,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:11,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377966989] [2020-09-11 15:59:11,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 15:59:11,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377966989] [2020-09-11 15:59:11,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:11,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 15:59:11,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071639100] [2020-09-11 15:59:11,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:59:11,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:11,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:59:11,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:59:11,281 INFO L87 Difference]: Start difference. First operand 9136 states and 40999 transitions. Second operand 9 states. [2020-09-11 15:59:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:12,149 INFO L93 Difference]: Finished difference Result 30263 states and 116773 transitions. [2020-09-11 15:59:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:59:12,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-09-11 15:59:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:12,218 INFO L225 Difference]: With dead ends: 30263 [2020-09-11 15:59:12,218 INFO L226 Difference]: Without dead ends: 30230 [2020-09-11 15:59:12,219 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 15:59:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30230 states. [2020-09-11 15:59:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30230 to 8877. [2020-09-11 15:59:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8877 states. [2020-09-11 15:59:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8877 states to 8877 states and 39872 transitions. [2020-09-11 15:59:12,661 INFO L78 Accepts]: Start accepts. Automaton has 8877 states and 39872 transitions. Word has length 25 [2020-09-11 15:59:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:12,661 INFO L479 AbstractCegarLoop]: Abstraction has 8877 states and 39872 transitions. [2020-09-11 15:59:12,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:59:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 8877 states and 39872 transitions. [2020-09-11 15:59:12,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 15:59:12,664 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:12,664 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:12,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-09-11 15:59:12,664 INFO L427 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:12,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:12,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1446514851, now seen corresponding path program 6 times [2020-09-11 15:59:12,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:12,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887854366] [2020-09-11 15:59:12,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 15:59:12,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887854366] [2020-09-11 15:59:12,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:12,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 15:59:12,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625339538] [2020-09-11 15:59:12,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:59:12,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:59:12,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:59:12,750 INFO L87 Difference]: Start difference. First operand 8877 states and 39872 transitions. Second operand 9 states. [2020-09-11 15:59:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:13,636 INFO L93 Difference]: Finished difference Result 29856 states and 115140 transitions. [2020-09-11 15:59:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:59:13,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-09-11 15:59:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:13,700 INFO L225 Difference]: With dead ends: 29856 [2020-09-11 15:59:13,701 INFO L226 Difference]: Without dead ends: 29823 [2020-09-11 15:59:13,701 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 15:59:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29823 states. [2020-09-11 15:59:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29823 to 8560. [2020-09-11 15:59:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8560 states. [2020-09-11 15:59:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8560 states to 8560 states and 38495 transitions. [2020-09-11 15:59:14,140 INFO L78 Accepts]: Start accepts. Automaton has 8560 states and 38495 transitions. Word has length 25 [2020-09-11 15:59:14,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:14,140 INFO L479 AbstractCegarLoop]: Abstraction has 8560 states and 38495 transitions. [2020-09-11 15:59:14,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:59:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 8560 states and 38495 transitions. [2020-09-11 15:59:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-11 15:59:14,144 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:14,144 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:14,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-09-11 15:59:14,144 INFO L427 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -110415564, now seen corresponding path program 1 times [2020-09-11 15:59:14,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:14,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589943196] [2020-09-11 15:59:14,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 15:59:14,155 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 15:59:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-11 15:59:14,167 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-11 15:59:14,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-11 15:59:14,180 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-11 15:59:14,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-09-11 15:59:14,182 WARN L363 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-09-11 15:59:14,182 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-09-11 15:59:14,196 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,196 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,197 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,197 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,197 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,197 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,197 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,197 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,197 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,198 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,198 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,198 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,198 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,198 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,198 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,198 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,199 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,199 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,199 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,199 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,199 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,199 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,199 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,200 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,200 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,200 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,200 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,200 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,200 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,200 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,201 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,201 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,201 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,201 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,201 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,201 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,202 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,202 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,202 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,202 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,202 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,202 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,202 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,203 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,203 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,203 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,203 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,203 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,203 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,203 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,204 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,204 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,204 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,204 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,204 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,205 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,205 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,206 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,206 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,207 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,207 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,208 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,209 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,209 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,210 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,210 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,211 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,211 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,212 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,213 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,213 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,214 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,214 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,215 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,215 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,216 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,216 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,216 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,216 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,216 WARN L313 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,218 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,218 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,218 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,218 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,218 WARN L313 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,219 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,220 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,220 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,220 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,220 WARN L313 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,226 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,226 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,227 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,227 WARN L313 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,227 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,228 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,228 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,228 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,229 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,229 WARN L313 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,230 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,230 WARN L313 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,230 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,230 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,231 WARN L313 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,232 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,232 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,233 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,234 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,234 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,236 WARN L313 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,236 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,237 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,238 WARN L313 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,238 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,239 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,239 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,240 WARN L313 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,241 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,241 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,242 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,242 WARN L313 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,242 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-11 15:59:14,243 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-09-11 15:59:14,243 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-11 15:59:14,243 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-11 15:59:14,243 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-11 15:59:14,244 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-11 15:59:14,244 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-11 15:59:14,244 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-11 15:59:14,244 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-11 15:59:14,244 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-11 15:59:14,246 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 141 transitions, 402 flow [2020-09-11 15:59:14,246 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions, 402 flow [2020-09-11 15:59:14,264 INFO L129 PetriNetUnfolder]: 8/171 cut-off events. [2020-09-11 15:59:14,264 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-09-11 15:59:14,265 INFO L80 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 310 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2020-09-11 15:59:14,272 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions, 402 flow [2020-09-11 15:59:14,291 INFO L129 PetriNetUnfolder]: 8/171 cut-off events. [2020-09-11 15:59:14,291 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-09-11 15:59:14,292 INFO L80 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 310 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2020-09-11 15:59:14,300 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3612 [2020-09-11 15:59:14,300 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-09-11 15:59:16,579 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-09-11 15:59:16,944 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4226 [2020-09-11 15:59:16,944 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2020-09-11 15:59:16,944 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 45 transitions, 210 flow [2020-09-11 15:59:18,459 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2020-09-11 15:59:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2020-09-11 15:59:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-09-11 15:59:18,460 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:18,460 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-09-11 15:59:18,460 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:18,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:18,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1291919, now seen corresponding path program 1 times [2020-09-11 15:59:18,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:18,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099914134] [2020-09-11 15:59:18,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:59:18,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099914134] [2020-09-11 15:59:18,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:18,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-09-11 15:59:18,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312965603] [2020-09-11 15:59:18,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-11 15:59:18,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:18,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-11 15:59:18,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 15:59:18,485 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2020-09-11 15:59:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:18,632 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2020-09-11 15:59:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-11 15:59:18,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-09-11 15:59:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:18,687 INFO L225 Difference]: With dead ends: 17885 [2020-09-11 15:59:18,687 INFO L226 Difference]: Without dead ends: 16791 [2020-09-11 15:59:18,688 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-11 15:59:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2020-09-11 15:59:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16791. [2020-09-11 15:59:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16791 states. [2020-09-11 15:59:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16791 states to 16791 states and 86558 transitions. [2020-09-11 15:59:19,459 INFO L78 Accepts]: Start accepts. Automaton has 16791 states and 86558 transitions. Word has length 3 [2020-09-11 15:59:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:19,459 INFO L479 AbstractCegarLoop]: Abstraction has 16791 states and 86558 transitions. [2020-09-11 15:59:19,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-11 15:59:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 16791 states and 86558 transitions. [2020-09-11 15:59:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-11 15:59:19,459 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:19,460 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:19,460 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-09-11 15:59:19,460 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1124534846, now seen corresponding path program 1 times [2020-09-11 15:59:19,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:19,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949026706] [2020-09-11 15:59:19,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:59:19,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949026706] [2020-09-11 15:59:19,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:19,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:59:19,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801618415] [2020-09-11 15:59:19,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:59:19,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:19,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:59:19,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:59:19,495 INFO L87 Difference]: Start difference. First operand 16791 states and 86558 transitions. Second operand 5 states. [2020-09-11 15:59:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:19,754 INFO L93 Difference]: Finished difference Result 30985 states and 150574 transitions. [2020-09-11 15:59:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:59:19,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-09-11 15:59:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:19,853 INFO L225 Difference]: With dead ends: 30985 [2020-09-11 15:59:19,854 INFO L226 Difference]: Without dead ends: 30977 [2020-09-11 15:59:19,854 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:59:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30977 states. [2020-09-11 15:59:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30977 to 19868. [2020-09-11 15:59:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19868 states. [2020-09-11 15:59:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 103363 transitions. [2020-09-11 15:59:23,219 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 103363 transitions. Word has length 9 [2020-09-11 15:59:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:23,219 INFO L479 AbstractCegarLoop]: Abstraction has 19868 states and 103363 transitions. [2020-09-11 15:59:23,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:59:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 103363 transitions. [2020-09-11 15:59:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-11 15:59:23,219 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:23,220 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:23,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-09-11 15:59:23,220 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:23,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:23,220 INFO L82 PathProgramCache]: Analyzing trace with hash -696216523, now seen corresponding path program 1 times [2020-09-11 15:59:23,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:23,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112814228] [2020-09-11 15:59:23,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:59:23,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112814228] [2020-09-11 15:59:23,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:23,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:59:23,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979498948] [2020-09-11 15:59:23,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:59:23,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:23,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:59:23,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:59:23,258 INFO L87 Difference]: Start difference. First operand 19868 states and 103363 transitions. Second operand 5 states. [2020-09-11 15:59:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:23,540 INFO L93 Difference]: Finished difference Result 36296 states and 178836 transitions. [2020-09-11 15:59:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:59:23,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-11 15:59:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:23,650 INFO L225 Difference]: With dead ends: 36296 [2020-09-11 15:59:23,650 INFO L226 Difference]: Without dead ends: 36280 [2020-09-11 15:59:23,650 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:59:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36280 states. [2020-09-11 15:59:24,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36280 to 23806. [2020-09-11 15:59:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23806 states. [2020-09-11 15:59:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 125455 transitions. [2020-09-11 15:59:24,854 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 125455 transitions. Word has length 13 [2020-09-11 15:59:24,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:24,855 INFO L479 AbstractCegarLoop]: Abstraction has 23806 states and 125455 transitions. [2020-09-11 15:59:24,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:59:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 125455 transitions. [2020-09-11 15:59:24,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 15:59:24,855 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:24,855 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:24,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-09-11 15:59:24,855 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:24,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:24,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2123666531, now seen corresponding path program 1 times [2020-09-11 15:59:24,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:24,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113098361] [2020-09-11 15:59:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:59:24,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113098361] [2020-09-11 15:59:24,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849795766] [2020-09-11 15:59:24,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:59:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:25,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 15:59:25,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:59:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-11 15:59:25,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:59:25,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 15:59:25,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210895303] [2020-09-11 15:59:25,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:59:25,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:25,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:59:25,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:59:25,056 INFO L87 Difference]: Start difference. First operand 23806 states and 125455 transitions. Second operand 9 states. [2020-09-11 15:59:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:25,631 INFO L93 Difference]: Finished difference Result 56720 states and 262685 transitions. [2020-09-11 15:59:25,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:59:25,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-09-11 15:59:25,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:25,822 INFO L225 Difference]: With dead ends: 56720 [2020-09-11 15:59:25,822 INFO L226 Difference]: Without dead ends: 56704 [2020-09-11 15:59:25,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 15:59:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56704 states. [2020-09-11 15:59:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56704 to 23629. [2020-09-11 15:59:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23629 states. [2020-09-11 15:59:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23629 states to 23629 states and 124418 transitions. [2020-09-11 15:59:27,891 INFO L78 Accepts]: Start accepts. Automaton has 23629 states and 124418 transitions. Word has length 15 [2020-09-11 15:59:27,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:27,891 INFO L479 AbstractCegarLoop]: Abstraction has 23629 states and 124418 transitions. [2020-09-11 15:59:27,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:59:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 23629 states and 124418 transitions. [2020-09-11 15:59:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-09-11 15:59:27,891 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:27,892 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:28,092 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-09-11 15:59:28,092 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:28,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:28,093 INFO L82 PathProgramCache]: Analyzing trace with hash 950817645, now seen corresponding path program 2 times [2020-09-11 15:59:28,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:28,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076194887] [2020-09-11 15:59:28,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-11 15:59:28,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076194887] [2020-09-11 15:59:28,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:28,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:59:28,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925471563] [2020-09-11 15:59:28,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:59:28,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:28,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:59:28,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:59:28,147 INFO L87 Difference]: Start difference. First operand 23629 states and 124418 transitions. Second operand 7 states. [2020-09-11 15:59:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:28,732 INFO L93 Difference]: Finished difference Result 58078 states and 269185 transitions. [2020-09-11 15:59:28,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:59:28,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-09-11 15:59:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:28,918 INFO L225 Difference]: With dead ends: 58078 [2020-09-11 15:59:28,919 INFO L226 Difference]: Without dead ends: 58061 [2020-09-11 15:59:28,919 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:59:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58061 states. [2020-09-11 15:59:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58061 to 23109. [2020-09-11 15:59:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23109 states. [2020-09-11 15:59:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23109 states to 23109 states and 121651 transitions. [2020-09-11 15:59:30,491 INFO L78 Accepts]: Start accepts. Automaton has 23109 states and 121651 transitions. Word has length 15 [2020-09-11 15:59:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:30,491 INFO L479 AbstractCegarLoop]: Abstraction has 23109 states and 121651 transitions. [2020-09-11 15:59:30,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:59:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 23109 states and 121651 transitions. [2020-09-11 15:59:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-11 15:59:30,492 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:30,492 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:30,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-09-11 15:59:30,492 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:30,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:30,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2120658652, now seen corresponding path program 1 times [2020-09-11 15:59:30,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:30,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3974691] [2020-09-11 15:59:30,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:59:30,534 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3974691] [2020-09-11 15:59:30,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:30,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 15:59:30,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232694823] [2020-09-11 15:59:30,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 15:59:30,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:30,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 15:59:30,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 15:59:30,535 INFO L87 Difference]: Start difference. First operand 23109 states and 121651 transitions. Second operand 5 states. [2020-09-11 15:59:30,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:30,894 INFO L93 Difference]: Finished difference Result 41885 states and 209629 transitions. [2020-09-11 15:59:30,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 15:59:30,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-11 15:59:30,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:31,022 INFO L225 Difference]: With dead ends: 41885 [2020-09-11 15:59:31,022 INFO L226 Difference]: Without dead ends: 41856 [2020-09-11 15:59:31,022 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:59:31,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41856 states. [2020-09-11 15:59:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41856 to 28237. [2020-09-11 15:59:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28237 states. [2020-09-11 15:59:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28237 states to 28237 states and 150261 transitions. [2020-09-11 15:59:34,850 INFO L78 Accepts]: Start accepts. Automaton has 28237 states and 150261 transitions. Word has length 17 [2020-09-11 15:59:34,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:34,850 INFO L479 AbstractCegarLoop]: Abstraction has 28237 states and 150261 transitions. [2020-09-11 15:59:34,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 15:59:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand 28237 states and 150261 transitions. [2020-09-11 15:59:34,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 15:59:34,851 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:34,851 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:34,851 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-09-11 15:59:34,852 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:34,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:34,852 INFO L82 PathProgramCache]: Analyzing trace with hash 269605662, now seen corresponding path program 1 times [2020-09-11 15:59:34,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:34,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788416181] [2020-09-11 15:59:34,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 15:59:34,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788416181] [2020-09-11 15:59:34,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593806143] [2020-09-11 15:59:34,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:59:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:35,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 15:59:35,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:59:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 15:59:35,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:59:35,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 15:59:35,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964554178] [2020-09-11 15:59:35,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 15:59:35,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:35,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 15:59:35,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 15:59:35,025 INFO L87 Difference]: Start difference. First operand 28237 states and 150261 transitions. Second operand 9 states. [2020-09-11 15:59:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:35,648 INFO L93 Difference]: Finished difference Result 66831 states and 314874 transitions. [2020-09-11 15:59:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:59:35,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-09-11 15:59:35,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:35,872 INFO L225 Difference]: With dead ends: 66831 [2020-09-11 15:59:35,873 INFO L226 Difference]: Without dead ends: 66807 [2020-09-11 15:59:35,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 15:59:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66807 states. [2020-09-11 15:59:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66807 to 28673. [2020-09-11 15:59:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28673 states. [2020-09-11 15:59:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 152375 transitions. [2020-09-11 15:59:37,657 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 152375 transitions. Word has length 19 [2020-09-11 15:59:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:37,658 INFO L479 AbstractCegarLoop]: Abstraction has 28673 states and 152375 transitions. [2020-09-11 15:59:37,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 15:59:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 152375 transitions. [2020-09-11 15:59:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 15:59:37,658 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:37,659 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:37,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2020-09-11 15:59:37,874 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:37,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:37,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2138468196, now seen corresponding path program 2 times [2020-09-11 15:59:37,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:37,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776115921] [2020-09-11 15:59:37,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:59:37,935 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776115921] [2020-09-11 15:59:37,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:37,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:59:37,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221132565] [2020-09-11 15:59:37,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:59:37,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:37,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:59:37,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:59:37,937 INFO L87 Difference]: Start difference. First operand 28673 states and 152375 transitions. Second operand 7 states. [2020-09-11 15:59:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:38,557 INFO L93 Difference]: Finished difference Result 68538 states and 323189 transitions. [2020-09-11 15:59:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:59:38,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 15:59:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:38,778 INFO L225 Difference]: With dead ends: 68538 [2020-09-11 15:59:38,778 INFO L226 Difference]: Without dead ends: 68505 [2020-09-11 15:59:38,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:59:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68505 states. [2020-09-11 15:59:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68505 to 28061. [2020-09-11 15:59:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28061 states. [2020-09-11 15:59:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28061 states to 28061 states and 149307 transitions. [2020-09-11 15:59:41,159 INFO L78 Accepts]: Start accepts. Automaton has 28061 states and 149307 transitions. Word has length 19 [2020-09-11 15:59:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:41,159 INFO L479 AbstractCegarLoop]: Abstraction has 28061 states and 149307 transitions. [2020-09-11 15:59:41,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:59:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 28061 states and 149307 transitions. [2020-09-11 15:59:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 15:59:41,160 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:41,160 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:41,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2020-09-11 15:59:41,160 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2138444729, now seen corresponding path program 1 times [2020-09-11 15:59:41,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:41,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054199293] [2020-09-11 15:59:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:41,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:59:41,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054199293] [2020-09-11 15:59:41,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:41,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:59:41,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825079560] [2020-09-11 15:59:41,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:59:41,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:41,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:59:41,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:59:41,220 INFO L87 Difference]: Start difference. First operand 28061 states and 149307 transitions. Second operand 7 states. [2020-09-11 15:59:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:41,836 INFO L93 Difference]: Finished difference Result 69070 states and 326154 transitions. [2020-09-11 15:59:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:59:41,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 15:59:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:42,056 INFO L225 Difference]: With dead ends: 69070 [2020-09-11 15:59:42,056 INFO L226 Difference]: Without dead ends: 69037 [2020-09-11 15:59:42,057 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:59:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69037 states. [2020-09-11 15:59:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69037 to 28938. [2020-09-11 15:59:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28938 states. [2020-09-11 15:59:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28938 states to 28938 states and 153909 transitions. [2020-09-11 15:59:46,289 INFO L78 Accepts]: Start accepts. Automaton has 28938 states and 153909 transitions. Word has length 19 [2020-09-11 15:59:46,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:46,290 INFO L479 AbstractCegarLoop]: Abstraction has 28938 states and 153909 transitions. [2020-09-11 15:59:46,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:59:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 28938 states and 153909 transitions. [2020-09-11 15:59:46,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-11 15:59:46,290 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:46,291 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:46,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-09-11 15:59:46,291 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:46,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:46,291 INFO L82 PathProgramCache]: Analyzing trace with hash -2117255609, now seen corresponding path program 2 times [2020-09-11 15:59:46,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:46,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591910154] [2020-09-11 15:59:46,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 15:59:46,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591910154] [2020-09-11 15:59:46,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 15:59:46,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 15:59:46,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106821774] [2020-09-11 15:59:46,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 15:59:46,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:46,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 15:59:46,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 15:59:46,354 INFO L87 Difference]: Start difference. First operand 28938 states and 153909 transitions. Second operand 7 states. [2020-09-11 15:59:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:46,977 INFO L93 Difference]: Finished difference Result 70096 states and 331298 transitions. [2020-09-11 15:59:46,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 15:59:46,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-11 15:59:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:47,212 INFO L225 Difference]: With dead ends: 70096 [2020-09-11 15:59:47,212 INFO L226 Difference]: Without dead ends: 70063 [2020-09-11 15:59:47,212 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 15:59:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70063 states. [2020-09-11 15:59:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70063 to 29094. [2020-09-11 15:59:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29094 states. [2020-09-11 15:59:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29094 states to 29094 states and 154883 transitions. [2020-09-11 15:59:49,050 INFO L78 Accepts]: Start accepts. Automaton has 29094 states and 154883 transitions. Word has length 19 [2020-09-11 15:59:49,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:49,050 INFO L479 AbstractCegarLoop]: Abstraction has 29094 states and 154883 transitions. [2020-09-11 15:59:49,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 15:59:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 29094 states and 154883 transitions. [2020-09-11 15:59:49,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:59:49,051 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:49,051 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:49,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-09-11 15:59:49,052 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:49,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1393024961, now seen corresponding path program 1 times [2020-09-11 15:59:49,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:49,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058454218] [2020-09-11 15:59:49,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 15:59:49,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058454218] [2020-09-11 15:59:49,136 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442892429] [2020-09-11 15:59:49,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:59:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:49,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:59:49,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:59:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 15:59:49,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:59:49,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:59:49,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723819583] [2020-09-11 15:59:49,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:59:49,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:49,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:59:49,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:59:49,811 INFO L87 Difference]: Start difference. First operand 29094 states and 154883 transitions. Second operand 11 states. [2020-09-11 15:59:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:51,098 INFO L93 Difference]: Finished difference Result 100731 states and 448596 transitions. [2020-09-11 15:59:51,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:59:51,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-09-11 15:59:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:51,397 INFO L225 Difference]: With dead ends: 100731 [2020-09-11 15:59:51,397 INFO L226 Difference]: Without dead ends: 100715 [2020-09-11 15:59:51,397 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 15:59:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100715 states. [2020-09-11 15:59:57,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100715 to 28723. [2020-09-11 15:59:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28723 states. [2020-09-11 15:59:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 152772 transitions. [2020-09-11 15:59:57,120 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 152772 transitions. Word has length 21 [2020-09-11 15:59:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 15:59:57,120 INFO L479 AbstractCegarLoop]: Abstraction has 28723 states and 152772 transitions. [2020-09-11 15:59:57,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 15:59:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 152772 transitions. [2020-09-11 15:59:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 15:59:57,121 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 15:59:57,121 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 15:59:57,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:59:57,322 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 15:59:57,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 15:59:57,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1414214081, now seen corresponding path program 2 times [2020-09-11 15:59:57,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 15:59:57,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477703390] [2020-09-11 15:59:57,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 15:59:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 15:59:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 15:59:57,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477703390] [2020-09-11 15:59:57,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634431789] [2020-09-11 15:59:57,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 15:59:57,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 15:59:57,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 15:59:57,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 15:59:57,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 15:59:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-11 15:59:57,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 15:59:57,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 15:59:57,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254226643] [2020-09-11 15:59:57,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 15:59:57,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 15:59:57,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 15:59:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 15:59:57,560 INFO L87 Difference]: Start difference. First operand 28723 states and 152772 transitions. Second operand 11 states. [2020-09-11 15:59:58,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 15:59:58,876 INFO L93 Difference]: Finished difference Result 99884 states and 444368 transitions. [2020-09-11 15:59:58,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 15:59:58,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-09-11 15:59:58,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 15:59:59,188 INFO L225 Difference]: With dead ends: 99884 [2020-09-11 15:59:59,188 INFO L226 Difference]: Without dead ends: 99863 [2020-09-11 15:59:59,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 16:00:00,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99863 states. [2020-09-11 16:00:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99863 to 28343. [2020-09-11 16:00:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28343 states. [2020-09-11 16:00:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28343 states to 28343 states and 150639 transitions. [2020-09-11 16:00:02,202 INFO L78 Accepts]: Start accepts. Automaton has 28343 states and 150639 transitions. Word has length 21 [2020-09-11 16:00:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:00:02,202 INFO L479 AbstractCegarLoop]: Abstraction has 28343 states and 150639 transitions. [2020-09-11 16:00:02,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 16:00:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 28343 states and 150639 transitions. [2020-09-11 16:00:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 16:00:02,203 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:00:02,203 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:00:02,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2020-09-11 16:00:02,404 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:00:02,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:00:02,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2073547329, now seen corresponding path program 3 times [2020-09-11 16:00:02,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:00:02,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759137067] [2020-09-11 16:00:02,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:00:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 16:00:02,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759137067] [2020-09-11 16:00:02,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:00:02,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 16:00:02,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063763703] [2020-09-11 16:00:02,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 16:00:02,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:00:02,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 16:00:02,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 16:00:02,490 INFO L87 Difference]: Start difference. First operand 28343 states and 150639 transitions. Second operand 9 states. [2020-09-11 16:00:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:00:03,833 INFO L93 Difference]: Finished difference Result 100063 states and 445271 transitions. [2020-09-11 16:00:03,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 16:00:03,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 16:00:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:00:04,163 INFO L225 Difference]: With dead ends: 100063 [2020-09-11 16:00:04,164 INFO L226 Difference]: Without dead ends: 100047 [2020-09-11 16:00:04,164 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 16:00:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100047 states. [2020-09-11 16:00:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100047 to 27662. [2020-09-11 16:00:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27662 states. [2020-09-11 16:00:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27662 states to 27662 states and 147100 transitions. [2020-09-11 16:00:07,188 INFO L78 Accepts]: Start accepts. Automaton has 27662 states and 147100 transitions. Word has length 21 [2020-09-11 16:00:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:00:07,188 INFO L479 AbstractCegarLoop]: Abstraction has 27662 states and 147100 transitions. [2020-09-11 16:00:07,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 16:00:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 27662 states and 147100 transitions. [2020-09-11 16:00:07,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 16:00:07,189 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:00:07,189 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:00:07,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2020-09-11 16:00:07,190 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:00:07,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:00:07,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2051019009, now seen corresponding path program 4 times [2020-09-11 16:00:07,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:00:07,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777128708] [2020-09-11 16:00:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:00:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 16:00:07,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777128708] [2020-09-11 16:00:07,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:00:07,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 16:00:07,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235723131] [2020-09-11 16:00:07,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 16:00:07,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:00:07,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 16:00:07,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 16:00:07,274 INFO L87 Difference]: Start difference. First operand 27662 states and 147100 transitions. Second operand 9 states. [2020-09-11 16:00:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:00:08,569 INFO L93 Difference]: Finished difference Result 99531 states and 442783 transitions. [2020-09-11 16:00:08,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 16:00:08,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 16:00:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:00:08,877 INFO L225 Difference]: With dead ends: 99531 [2020-09-11 16:00:08,877 INFO L226 Difference]: Without dead ends: 99510 [2020-09-11 16:00:08,877 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 16:00:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99510 states. [2020-09-11 16:00:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99510 to 27286. [2020-09-11 16:00:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27286 states. [2020-09-11 16:00:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27286 states to 27286 states and 144979 transitions. [2020-09-11 16:00:11,688 INFO L78 Accepts]: Start accepts. Automaton has 27286 states and 144979 transitions. Word has length 21 [2020-09-11 16:00:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:00:11,689 INFO L479 AbstractCegarLoop]: Abstraction has 27286 states and 144979 transitions. [2020-09-11 16:00:11,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 16:00:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 27286 states and 144979 transitions. [2020-09-11 16:00:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 16:00:11,690 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:00:11,690 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:00:11,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2020-09-11 16:00:11,690 INFO L427 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:00:11,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:00:11,690 INFO L82 PathProgramCache]: Analyzing trace with hash 102150333, now seen corresponding path program 1 times [2020-09-11 16:00:11,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:00:11,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035220881] [2020-09-11 16:00:11,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:00:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 16:00:11,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035220881] [2020-09-11 16:00:11,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:00:11,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-11 16:00:11,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697861398] [2020-09-11 16:00:11,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-11 16:00:11,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:00:11,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-11 16:00:11,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-11 16:00:11,737 INFO L87 Difference]: Start difference. First operand 27286 states and 144979 transitions. Second operand 5 states. [2020-09-11 16:00:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:00:12,140 INFO L93 Difference]: Finished difference Result 49004 states and 248721 transitions. [2020-09-11 16:00:12,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-11 16:00:12,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-09-11 16:00:12,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:00:12,325 INFO L225 Difference]: With dead ends: 49004 [2020-09-11 16:00:12,325 INFO L226 Difference]: Without dead ends: 48958 [2020-09-11 16:00:12,325 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-11 16:00:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48958 states. [2020-09-11 16:00:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48958 to 33985. [2020-09-11 16:00:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33985 states. [2020-09-11 16:00:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33985 states to 33985 states and 181777 transitions. [2020-09-11 16:00:13,861 INFO L78 Accepts]: Start accepts. Automaton has 33985 states and 181777 transitions. Word has length 21 [2020-09-11 16:00:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:00:13,861 INFO L479 AbstractCegarLoop]: Abstraction has 33985 states and 181777 transitions. [2020-09-11 16:00:13,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-11 16:00:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 33985 states and 181777 transitions. [2020-09-11 16:00:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 16:00:13,862 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:00:13,863 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:00:13,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-09-11 16:00:13,863 INFO L427 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:00:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:00:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1130516927, now seen corresponding path program 5 times [2020-09-11 16:00:13,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:00:13,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407230782] [2020-09-11 16:00:13,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:00:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 16:00:13,936 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407230782] [2020-09-11 16:00:13,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:00:13,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 16:00:13,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202945848] [2020-09-11 16:00:13,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 16:00:13,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:00:13,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 16:00:13,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 16:00:13,939 INFO L87 Difference]: Start difference. First operand 33985 states and 181777 transitions. Second operand 9 states. [2020-09-11 16:00:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:00:15,587 INFO L93 Difference]: Finished difference Result 115592 states and 523747 transitions. [2020-09-11 16:00:15,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 16:00:15,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 16:00:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:00:15,944 INFO L225 Difference]: With dead ends: 115592 [2020-09-11 16:00:15,944 INFO L226 Difference]: Without dead ends: 115567 [2020-09-11 16:00:15,944 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 16:00:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115567 states. [2020-09-11 16:00:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115567 to 33074. [2020-09-11 16:00:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33074 states. [2020-09-11 16:00:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33074 states to 33074 states and 176935 transitions. [2020-09-11 16:00:21,597 INFO L78 Accepts]: Start accepts. Automaton has 33074 states and 176935 transitions. Word has length 21 [2020-09-11 16:00:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:00:21,598 INFO L479 AbstractCegarLoop]: Abstraction has 33074 states and 176935 transitions. [2020-09-11 16:00:21,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 16:00:21,598 INFO L276 IsEmpty]: Start isEmpty. Operand 33074 states and 176935 transitions. [2020-09-11 16:00:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-11 16:00:21,599 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:00:21,599 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:00:21,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-09-11 16:00:21,599 INFO L427 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:00:21,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:00:21,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1131856127, now seen corresponding path program 6 times [2020-09-11 16:00:21,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:00:21,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849112867] [2020-09-11 16:00:21,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:00:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 16:00:21,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849112867] [2020-09-11 16:00:21,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:00:21,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-11 16:00:21,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527719990] [2020-09-11 16:00:21,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 16:00:21,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:00:21,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 16:00:21,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-11 16:00:21,684 INFO L87 Difference]: Start difference. First operand 33074 states and 176935 transitions. Second operand 9 states. [2020-09-11 16:00:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:00:23,017 INFO L93 Difference]: Finished difference Result 114402 states and 517732 transitions. [2020-09-11 16:00:23,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 16:00:23,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-11 16:00:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:00:23,365 INFO L225 Difference]: With dead ends: 114402 [2020-09-11 16:00:23,366 INFO L226 Difference]: Without dead ends: 114371 [2020-09-11 16:00:23,366 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2020-09-11 16:00:24,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114371 states. [2020-09-11 16:00:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114371 to 31960. [2020-09-11 16:00:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31960 states. [2020-09-11 16:00:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31960 states to 31960 states and 171209 transitions. [2020-09-11 16:00:26,799 INFO L78 Accepts]: Start accepts. Automaton has 31960 states and 171209 transitions. Word has length 21 [2020-09-11 16:00:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:00:26,799 INFO L479 AbstractCegarLoop]: Abstraction has 31960 states and 171209 transitions. [2020-09-11 16:00:26,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 16:00:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 31960 states and 171209 transitions. [2020-09-11 16:00:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 16:00:26,801 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:00:26,801 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:00:26,801 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-09-11 16:00:26,801 INFO L427 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:00:26,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:00:26,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1106577557, now seen corresponding path program 1 times [2020-09-11 16:00:26,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:00:26,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466691081] [2020-09-11 16:00:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:00:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 16:00:26,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466691081] [2020-09-11 16:00:26,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261984460] [2020-09-11 16:00:26,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 16:00:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:26,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 16:00:26,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 16:00:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 16:00:26,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 16:00:26,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 16:00:26,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156667693] [2020-09-11 16:00:26,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 16:00:26,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:00:26,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 16:00:26,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 16:00:26,992 INFO L87 Difference]: Start difference. First operand 31960 states and 171209 transitions. Second operand 9 states. [2020-09-11 16:00:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:00:27,735 INFO L93 Difference]: Finished difference Result 75380 states and 361389 transitions. [2020-09-11 16:00:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 16:00:27,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-09-11 16:00:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:00:27,974 INFO L225 Difference]: With dead ends: 75380 [2020-09-11 16:00:27,974 INFO L226 Difference]: Without dead ends: 75344 [2020-09-11 16:00:27,975 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 16:00:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75344 states. [2020-09-11 16:00:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75344 to 32974. [2020-09-11 16:00:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32974 states. [2020-09-11 16:00:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32974 states to 32974 states and 176363 transitions. [2020-09-11 16:00:30,727 INFO L78 Accepts]: Start accepts. Automaton has 32974 states and 176363 transitions. Word has length 23 [2020-09-11 16:00:30,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:00:30,727 INFO L479 AbstractCegarLoop]: Abstraction has 32974 states and 176363 transitions. [2020-09-11 16:00:30,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 16:00:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 32974 states and 176363 transitions. [2020-09-11 16:00:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 16:00:30,729 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:00:30,729 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:00:30,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 16:00:30,930 INFO L427 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:00:30,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:00:30,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1026706248, now seen corresponding path program 1 times [2020-09-11 16:00:30,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:00:30,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179199850] [2020-09-11 16:00:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:00:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 16:00:30,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179199850] [2020-09-11 16:00:30,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432957040] [2020-09-11 16:00:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 16:00:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:31,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-11 16:00:31,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 16:00:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 16:00:31,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 16:00:31,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-09-11 16:00:31,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317986450] [2020-09-11 16:00:31,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-11 16:00:31,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:00:31,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-11 16:00:31,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-09-11 16:00:31,136 INFO L87 Difference]: Start difference. First operand 32974 states and 176363 transitions. Second operand 9 states. [2020-09-11 16:00:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:00:31,916 INFO L93 Difference]: Finished difference Result 79463 states and 381713 transitions. [2020-09-11 16:00:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 16:00:31,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-09-11 16:00:31,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:00:32,209 INFO L225 Difference]: With dead ends: 79463 [2020-09-11 16:00:32,209 INFO L226 Difference]: Without dead ends: 79421 [2020-09-11 16:00:32,209 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-09-11 16:00:33,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79421 states. [2020-09-11 16:00:34,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79421 to 33977. [2020-09-11 16:00:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33977 states. [2020-09-11 16:00:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33977 states to 33977 states and 181698 transitions. [2020-09-11 16:00:34,830 INFO L78 Accepts]: Start accepts. Automaton has 33977 states and 181698 transitions. Word has length 23 [2020-09-11 16:00:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:00:34,830 INFO L479 AbstractCegarLoop]: Abstraction has 33977 states and 181698 transitions. [2020-09-11 16:00:34,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-11 16:00:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 33977 states and 181698 transitions. [2020-09-11 16:00:34,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 16:00:34,832 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:00:34,832 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:00:35,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 16:00:35,034 INFO L427 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:00:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:00:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash -617779723, now seen corresponding path program 2 times [2020-09-11 16:00:35,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:00:35,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435202345] [2020-09-11 16:00:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:00:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 16:00:35,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435202345] [2020-09-11 16:00:35,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:00:35,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 16:00:35,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612311463] [2020-09-11 16:00:35,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 16:00:35,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:00:35,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 16:00:35,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 16:00:35,096 INFO L87 Difference]: Start difference. First operand 33977 states and 181698 transitions. Second operand 7 states. [2020-09-11 16:00:35,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:00:35,829 INFO L93 Difference]: Finished difference Result 80867 states and 388763 transitions. [2020-09-11 16:00:35,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 16:00:35,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-11 16:00:35,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:00:36,099 INFO L225 Difference]: With dead ends: 80867 [2020-09-11 16:00:36,099 INFO L226 Difference]: Without dead ends: 80812 [2020-09-11 16:00:36,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 16:00:37,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80812 states. [2020-09-11 16:00:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80812 to 34223. [2020-09-11 16:00:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34223 states. [2020-09-11 16:00:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34223 states to 34223 states and 183033 transitions. [2020-09-11 16:00:38,780 INFO L78 Accepts]: Start accepts. Automaton has 34223 states and 183033 transitions. Word has length 23 [2020-09-11 16:00:38,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:00:38,780 INFO L479 AbstractCegarLoop]: Abstraction has 34223 states and 183033 transitions. [2020-09-11 16:00:38,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 16:00:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 34223 states and 183033 transitions. [2020-09-11 16:00:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 16:00:38,782 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:00:38,782 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:00:38,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2020-09-11 16:00:38,782 INFO L427 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:00:38,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:00:38,782 INFO L82 PathProgramCache]: Analyzing trace with hash -617778328, now seen corresponding path program 2 times [2020-09-11 16:00:38,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:00:38,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825408622] [2020-09-11 16:00:38,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:00:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 16:00:38,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825408622] [2020-09-11 16:00:38,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:00:38,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 16:00:38,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117714523] [2020-09-11 16:00:38,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 16:00:38,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:00:38,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 16:00:38,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 16:00:38,846 INFO L87 Difference]: Start difference. First operand 34223 states and 183033 transitions. Second operand 7 states. [2020-09-11 16:00:39,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:00:39,544 INFO L93 Difference]: Finished difference Result 80887 states and 388540 transitions. [2020-09-11 16:00:39,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 16:00:39,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-11 16:00:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:00:39,815 INFO L225 Difference]: With dead ends: 80887 [2020-09-11 16:00:39,815 INFO L226 Difference]: Without dead ends: 80832 [2020-09-11 16:00:39,815 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 16:00:40,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80832 states. [2020-09-11 16:00:42,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80832 to 34508. [2020-09-11 16:00:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34508 states. [2020-09-11 16:00:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34508 states to 34508 states and 184670 transitions. [2020-09-11 16:00:42,512 INFO L78 Accepts]: Start accepts. Automaton has 34508 states and 184670 transitions. Word has length 23 [2020-09-11 16:00:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:00:42,512 INFO L479 AbstractCegarLoop]: Abstraction has 34508 states and 184670 transitions. [2020-09-11 16:00:42,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 16:00:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 34508 states and 184670 transitions. [2020-09-11 16:00:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 16:00:42,514 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:00:42,514 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:00:42,514 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-09-11 16:00:42,514 INFO L427 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:00:42,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:00:42,515 INFO L82 PathProgramCache]: Analyzing trace with hash -617756256, now seen corresponding path program 1 times [2020-09-11 16:00:42,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:00:42,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935250727] [2020-09-11 16:00:42,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:00:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 16:00:42,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935250727] [2020-09-11 16:00:42,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:00:42,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 16:00:42,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490861699] [2020-09-11 16:00:42,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 16:00:42,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:00:42,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 16:00:42,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 16:00:42,581 INFO L87 Difference]: Start difference. First operand 34508 states and 184670 transitions. Second operand 7 states. [2020-09-11 16:00:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:00:43,358 INFO L93 Difference]: Finished difference Result 83313 states and 401031 transitions. [2020-09-11 16:00:43,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 16:00:43,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-11 16:00:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:00:43,651 INFO L225 Difference]: With dead ends: 83313 [2020-09-11 16:00:43,651 INFO L226 Difference]: Without dead ends: 83258 [2020-09-11 16:00:43,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 16:00:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83258 states. [2020-09-11 16:00:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83258 to 36258. [2020-09-11 16:00:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36258 states. [2020-09-11 16:00:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36258 states to 36258 states and 193887 transitions. [2020-09-11 16:00:46,478 INFO L78 Accepts]: Start accepts. Automaton has 36258 states and 193887 transitions. Word has length 23 [2020-09-11 16:00:46,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:00:46,479 INFO L479 AbstractCegarLoop]: Abstraction has 36258 states and 193887 transitions. [2020-09-11 16:00:46,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 16:00:46,479 INFO L276 IsEmpty]: Start isEmpty. Operand 36258 states and 193887 transitions. [2020-09-11 16:00:46,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-11 16:00:46,481 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:00:46,481 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:00:46,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-09-11 16:00:46,481 INFO L427 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:00:46,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:00:46,481 INFO L82 PathProgramCache]: Analyzing trace with hash -581716896, now seen corresponding path program 2 times [2020-09-11 16:00:46,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:00:46,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160203678] [2020-09-11 16:00:46,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:00:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-09-11 16:00:46,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160203678] [2020-09-11 16:00:46,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-11 16:00:46,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-11 16:00:46,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222813862] [2020-09-11 16:00:46,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-11 16:00:46,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:00:46,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-11 16:00:46,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-11 16:00:46,547 INFO L87 Difference]: Start difference. First operand 36258 states and 193887 transitions. Second operand 7 states. [2020-09-11 16:00:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:00:47,327 INFO L93 Difference]: Finished difference Result 84364 states and 406246 transitions. [2020-09-11 16:00:47,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-11 16:00:47,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-11 16:00:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:00:47,603 INFO L225 Difference]: With dead ends: 84364 [2020-09-11 16:00:47,603 INFO L226 Difference]: Without dead ends: 84309 [2020-09-11 16:00:47,604 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-09-11 16:00:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84309 states. [2020-09-11 16:00:50,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84309 to 37062. [2020-09-11 16:00:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37062 states. [2020-09-11 16:00:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37062 states to 37062 states and 198528 transitions. [2020-09-11 16:00:50,439 INFO L78 Accepts]: Start accepts. Automaton has 37062 states and 198528 transitions. Word has length 23 [2020-09-11 16:00:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:00:50,439 INFO L479 AbstractCegarLoop]: Abstraction has 37062 states and 198528 transitions. [2020-09-11 16:00:50,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-11 16:00:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 37062 states and 198528 transitions. [2020-09-11 16:00:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 16:00:50,443 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:00:50,443 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:00:50,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-09-11 16:00:50,443 INFO L427 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:00:50,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:00:50,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1745706838, now seen corresponding path program 1 times [2020-09-11 16:00:50,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:00:50,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320389818] [2020-09-11 16:00:50,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:00:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 16:00:50,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320389818] [2020-09-11 16:00:50,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448810643] [2020-09-11 16:00:50,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 16:00:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:50,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 16:00:50,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 16:00:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 16:00:50,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 16:00:50,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 16:00:50,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495805390] [2020-09-11 16:00:50,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 16:00:50,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:00:50,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 16:00:50,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 16:00:50,680 INFO L87 Difference]: Start difference. First operand 37062 states and 198528 transitions. Second operand 11 states. [2020-09-11 16:00:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:00:52,167 INFO L93 Difference]: Finished difference Result 122892 states and 561130 transitions. [2020-09-11 16:00:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 16:00:52,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 16:00:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:00:52,554 INFO L225 Difference]: With dead ends: 122892 [2020-09-11 16:00:52,554 INFO L226 Difference]: Without dead ends: 122862 [2020-09-11 16:00:52,554 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 16:00:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122862 states. [2020-09-11 16:00:55,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122862 to 36735. [2020-09-11 16:00:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36735 states. [2020-09-11 16:00:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36735 states to 36735 states and 196486 transitions. [2020-09-11 16:00:56,024 INFO L78 Accepts]: Start accepts. Automaton has 36735 states and 196486 transitions. Word has length 25 [2020-09-11 16:00:56,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:00:56,024 INFO L479 AbstractCegarLoop]: Abstraction has 36735 states and 196486 transitions. [2020-09-11 16:00:56,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 16:00:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 36735 states and 196486 transitions. [2020-09-11 16:00:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 16:00:56,027 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:00:56,027 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:00:56,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2020-09-11 16:00:56,228 INFO L427 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:00:56,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:00:56,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1730856598, now seen corresponding path program 2 times [2020-09-11 16:00:56,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:00:56,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139616773] [2020-09-11 16:00:56,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:00:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:00:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 16:00:56,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139616773] [2020-09-11 16:00:56,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240070677] [2020-09-11 16:00:56,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 16:00:56,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 16:00:56,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 16:00:56,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 16:00:56,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 16:00:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 16:00:56,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 16:00:56,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 16:00:56,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244855207] [2020-09-11 16:00:56,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 16:00:56,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:00:56,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 16:00:56,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 16:00:56,454 INFO L87 Difference]: Start difference. First operand 36735 states and 196486 transitions. Second operand 11 states. [2020-09-11 16:00:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:00:58,546 INFO L93 Difference]: Finished difference Result 121506 states and 554103 transitions. [2020-09-11 16:00:58,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 16:00:58,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 16:00:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:00:58,934 INFO L225 Difference]: With dead ends: 121506 [2020-09-11 16:00:58,934 INFO L226 Difference]: Without dead ends: 121473 [2020-09-11 16:00:58,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 16:01:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121473 states. [2020-09-11 16:01:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121473 to 36666. [2020-09-11 16:01:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36666 states. [2020-09-11 16:01:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36666 states to 36666 states and 195964 transitions. [2020-09-11 16:01:05,760 INFO L78 Accepts]: Start accepts. Automaton has 36666 states and 195964 transitions. Word has length 25 [2020-09-11 16:01:05,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:05,761 INFO L479 AbstractCegarLoop]: Abstraction has 36666 states and 195964 transitions. [2020-09-11 16:01:05,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 16:01:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 36666 states and 195964 transitions. [2020-09-11 16:01:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 16:01:05,765 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:05,765 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:05,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 16:01:05,966 INFO L427 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:01:05,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1730878670, now seen corresponding path program 1 times [2020-09-11 16:01:05,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:05,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111147377] [2020-09-11 16:01:05,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 16:01:06,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111147377] [2020-09-11 16:01:06,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776035072] [2020-09-11 16:01:06,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 16:01:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:06,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 16:01:06,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 16:01:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 16:01:06,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 16:01:06,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 16:01:06,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198493717] [2020-09-11 16:01:06,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 16:01:06,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:06,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 16:01:06,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 16:01:06,206 INFO L87 Difference]: Start difference. First operand 36666 states and 195964 transitions. Second operand 11 states. [2020-09-11 16:01:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:07,606 INFO L93 Difference]: Finished difference Result 120500 states and 549397 transitions. [2020-09-11 16:01:07,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 16:01:07,606 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 16:01:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:07,987 INFO L225 Difference]: With dead ends: 120500 [2020-09-11 16:01:07,987 INFO L226 Difference]: Without dead ends: 120470 [2020-09-11 16:01:07,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 16:01:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120470 states. [2020-09-11 16:01:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120470 to 36343. [2020-09-11 16:01:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36343 states. [2020-09-11 16:01:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36343 states to 36343 states and 194056 transitions. [2020-09-11 16:01:11,395 INFO L78 Accepts]: Start accepts. Automaton has 36343 states and 194056 transitions. Word has length 25 [2020-09-11 16:01:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:11,395 INFO L479 AbstractCegarLoop]: Abstraction has 36343 states and 194056 transitions. [2020-09-11 16:01:11,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 16:01:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 36343 states and 194056 transitions. [2020-09-11 16:01:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 16:01:11,398 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:11,399 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:11,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2020-09-11 16:01:11,599 INFO L427 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:01:11,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:11,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1766918030, now seen corresponding path program 2 times [2020-09-11 16:01:11,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:11,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573114225] [2020-09-11 16:01:11,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 16:01:11,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573114225] [2020-09-11 16:01:11,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183250479] [2020-09-11 16:01:11,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 16:01:11,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-11 16:01:11,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 16:01:11,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 16:01:11,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 16:01:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-11 16:01:11,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 16:01:11,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 16:01:11,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045397273] [2020-09-11 16:01:11,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 16:01:11,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:11,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 16:01:11,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 16:01:11,845 INFO L87 Difference]: Start difference. First operand 36343 states and 194056 transitions. Second operand 11 states. [2020-09-11 16:01:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:13,282 INFO L93 Difference]: Finished difference Result 119731 states and 545560 transitions. [2020-09-11 16:01:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 16:01:13,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 16:01:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:13,687 INFO L225 Difference]: With dead ends: 119731 [2020-09-11 16:01:13,687 INFO L226 Difference]: Without dead ends: 119698 [2020-09-11 16:01:13,688 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 16:01:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119698 states. [2020-09-11 16:01:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119698 to 36040. [2020-09-11 16:01:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36040 states. [2020-09-11 16:01:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36040 states to 36040 states and 192287 transitions. [2020-09-11 16:01:17,228 INFO L78 Accepts]: Start accepts. Automaton has 36040 states and 192287 transitions. Word has length 25 [2020-09-11 16:01:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:17,228 INFO L479 AbstractCegarLoop]: Abstraction has 36040 states and 192287 transitions. [2020-09-11 16:01:17,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 16:01:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 36040 states and 192287 transitions. [2020-09-11 16:01:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 16:01:17,231 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:17,231 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:17,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 16:01:17,432 INFO L427 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:01:17,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:17,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1849107924, now seen corresponding path program 3 times [2020-09-11 16:01:17,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:17,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349094952] [2020-09-11 16:01:17,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 16:01:17,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349094952] [2020-09-11 16:01:17,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511986900] [2020-09-11 16:01:17,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 16:01:17,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-09-11 16:01:17,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 16:01:17,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 16:01:17,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 16:01:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 16:01:17,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 16:01:17,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 16:01:17,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208149982] [2020-09-11 16:01:17,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 16:01:17,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:17,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 16:01:17,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 16:01:17,661 INFO L87 Difference]: Start difference. First operand 36040 states and 192287 transitions. Second operand 11 states. [2020-09-11 16:01:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:19,489 INFO L93 Difference]: Finished difference Result 119762 states and 545615 transitions. [2020-09-11 16:01:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 16:01:19,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 16:01:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:19,868 INFO L225 Difference]: With dead ends: 119762 [2020-09-11 16:01:19,868 INFO L226 Difference]: Without dead ends: 119732 [2020-09-11 16:01:19,869 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 16:01:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119732 states. [2020-09-11 16:01:25,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119732 to 35475. [2020-09-11 16:01:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35475 states. [2020-09-11 16:01:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35475 states to 35475 states and 189246 transitions. [2020-09-11 16:01:26,087 INFO L78 Accepts]: Start accepts. Automaton has 35475 states and 189246 transitions. Word has length 25 [2020-09-11 16:01:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-11 16:01:26,087 INFO L479 AbstractCegarLoop]: Abstraction has 35475 states and 189246 transitions. [2020-09-11 16:01:26,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-11 16:01:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 35475 states and 189246 transitions. [2020-09-11 16:01:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-11 16:01:26,090 INFO L414 BasicCegarLoop]: Found error trace [2020-09-11 16:01:26,090 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-11 16:01:26,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2020-09-11 16:01:26,291 INFO L427 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-11 16:01:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-11 16:01:26,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1177775680, now seen corresponding path program 4 times [2020-09-11 16:01:26,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-11 16:01:26,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026634395] [2020-09-11 16:01:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-11 16:01:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-11 16:01:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 16:01:26,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026634395] [2020-09-11 16:01:26,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954989500] [2020-09-11 16:01:26,380 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-11 16:01:26,500 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-11 16:01:26,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-11 16:01:26,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-11 16:01:26,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-11 16:01:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-09-11 16:01:26,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-11 16:01:26,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-11 16:01:26,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525047172] [2020-09-11 16:01:26,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-11 16:01:26,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-11 16:01:26,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-11 16:01:26,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-11 16:01:26,528 INFO L87 Difference]: Start difference. First operand 35475 states and 189246 transitions. Second operand 11 states. [2020-09-11 16:01:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-11 16:01:28,030 INFO L93 Difference]: Finished difference Result 120788 states and 550630 transitions. [2020-09-11 16:01:28,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-11 16:01:28,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-09-11 16:01:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-11 16:01:28,471 INFO L225 Difference]: With dead ends: 120788 [2020-09-11 16:01:28,471 INFO L226 Difference]: Without dead ends: 120755 [2020-09-11 16:01:28,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2020-09-11 16:01:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120755 states. Received shutdown request... [2020-09-11 16:01:31,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2020-09-11 16:01:31,480 WARN L544 AbstractCegarLoop]: Verification canceled [2020-09-11 16:01:31,486 WARN L228 ceAbstractionStarter]: Timeout [2020-09-11 16:01:31,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 04:01:31 BasicIcfg [2020-09-11 16:01:31,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-11 16:01:31,488 INFO L168 Benchmark]: Toolchain (without parser) took 223022.90 ms. Allocated memory was 141.0 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 101.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2020-09-11 16:01:31,488 INFO L168 Benchmark]: CDTParser took 0.67 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-11 16:01:31,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.16 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 101.1 MB in the beginning and 162.2 MB in the end (delta: -61.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2020-09-11 16:01:31,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.82 ms. Allocated memory is still 204.5 MB. Free memory was 162.2 MB in the beginning and 160.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-09-11 16:01:31,490 INFO L168 Benchmark]: Boogie Preprocessor took 33.32 ms. Allocated memory is still 204.5 MB. Free memory was 160.3 MB in the beginning and 159.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-09-11 16:01:31,490 INFO L168 Benchmark]: RCFGBuilder took 456.44 ms. Allocated memory is still 204.5 MB. Free memory was 159.0 MB in the beginning and 139.5 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2020-09-11 16:01:31,490 INFO L168 Benchmark]: TraceAbstraction took 221655.84 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 138.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2020-09-11 16:01:31,492 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.67 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.16 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 101.1 MB in the beginning and 162.2 MB in the end (delta: -61.1 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.82 ms. Allocated memory is still 204.5 MB. Free memory was 162.2 MB in the beginning and 160.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.32 ms. Allocated memory is still 204.5 MB. Free memory was 160.3 MB in the beginning and 159.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 456.44 ms. Allocated memory is still 204.5 MB. Free memory was 159.0 MB in the beginning and 139.5 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 221655.84 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 138.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 55 ProgramPointsBefore, 18 ProgramPointsAfterwards, 51 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 6 FixpointIterations, 13 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 389 VarBasedMoverChecksPositive, 4 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 4 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 576 CheckedPairsTotal, 45 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.3s, 76 ProgramPointsBefore, 31 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 3 ChoiceCompositions, 577 VarBasedMoverChecksPositive, 8 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 8 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 964 CheckedPairsTotal, 59 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 97 ProgramPointsBefore, 41 ProgramPointsAfterwards, 87 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 781 VarBasedMoverChecksPositive, 14 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 18 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 1796 CheckedPairsTotal, 73 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 118 ProgramPointsBefore, 51 ProgramPointsAfterwards, 105 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 6 FixpointIterations, 43 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 5 ConcurrentYvCompositions, 5 ChoiceCompositions, 1100 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 2240 CheckedPairsTotal, 92 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 139 ProgramPointsBefore, 61 ProgramPointsAfterwards, 123 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 6 FixpointIterations, 59 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 5 ConcurrentYvCompositions, 6 ChoiceCompositions, 1387 VarBasedMoverChecksPositive, 25 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 29 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3096 CheckedPairsTotal, 115 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 160 ProgramPointsBefore, 71 ProgramPointsAfterwards, 141 TransitionsBefore, 45 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 6 FixpointIterations, 66 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1785 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 36 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 4226 CheckedPairsTotal, 127 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 679]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 679). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Started 6 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 221.2s, OverallIterations: 104, TraceHistogramMax: 6, AutomataDifference: 71.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.8s, HoareTripleCheckerStatistics: 6043 SDtfs, 19681 SDslu, 19320 SDs, 0 SdLazy, 21073 SolverSat, 1752 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2662 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 1858 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11181 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37062occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 112.7s AutomataMinimizationTime, 99 MinimizatonAttempts, 2113691 StatesRemovedByMinimization, 91 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 2911 NumberOfCodeBlocks, 2879 NumberOfCodeBlocksAsserted, 168 NumberOfCheckSat, 2682 ConstructedInterpolants, 0 QuantifiedInterpolants, 166140 SizeOfPredicates, 224 NumberOfNonLiveVariables, 4909 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 141 InterpolantComputations, 57 PerfectInterpolantSequences, 992/1574 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown